University of Brighton

Displaying 1 - 10 of 49 results

The authors present oblivious implementations of several data structures for secure Multi-Party Computation (MPC) such as arrays, dictionaries, and priority queues. The resulting oblivious data structures have only poly-logarithmic overhead compared with their classical counterparts. To achieve this, they give secure multiparty protocols for the ORAM and the path ORAM
...

In a recent paper, Shim (2012) presented a very interesting authentication scheme for vehicular sensor networks. Shim claimed that the scheme is secure against the highest adopted level of attack, namely the Chosen-IDentity and Chosen-Message Attack (CID-CMA). Nevertheless, the authors find that the proof in Shim's paper does not actually
...

Attribute-based signatures allow a signer owning a set of attributes to anonymously sign a message w.r.t. some signing policy. A recipient of the signature is convinced that a signer with a set of attributes satisfying the signing policy has indeed produced the signature without learning the identity of the signer
...

Cryptography is generally used to protect sensitive data from an untrusted server. In this paper, the authors investigate the converse question: can they use cryptography to protect a trusted server from untrusted data. As a first step in this direction, they propose the notion of safe enclosures. Intuitively, a safe
...

The authors construct Secret-Key Encryption (SKE) schemes that are secure against Related-Key Attacks and in the presence of Key-Dependent Messages (RKA-KDM secure). They emphasize that RKA-KDM security is not merely the conjunction of individual security properties, but covers attacks in which cipher-texts of key-dependent messages under related keys are available.
...

With over 1.6 billion debit and credit cards in use worldwide, the EMV system (a.k.a. \"Chip-and-PIN\") has become one of the most important deployed cryptographic protocol suites. Recently, the EMV consortium has decided to upgrade the existing RSA based system with a new system relying on Elliptic Curve Cryptography (ECC).
...

Protocols for the protected execution of programs, like those based on a hardware root of trust, will become of fundamental importance for computer security. In parallel to such protocols, there is therefore a need to develop models and tools that allow formal specification and automated verification of the desired security
...

The authors present a runtime environment for executing secure programs via a multi-party computation protocol in the preprocessing model. The runtime environment is general and allows arbitrary reactive computations to be performed. A particularly novel aspect is that it automatically determines the minimum number of rounds needed for a computation,
...

In 1996, researchers introduced an efficient lattice based encryption scheme dubbed NTRUEncrypt. Unfortunately, this scheme lacks a proof of security. However, in 2011, other researchers showed how to modify NTRUEncrypt to reduce security to standard problems in ideal lattices. In 2012, they proposed a fully homomorphic scheme based on this
...

The authors revisit the estimation of parameters for use in applications of the BGV homomorphic encryption system, which generally require high dimensional lattices. In particular, they utilize the BKZ-2.0 simulator of chen and nguyen to identify the best lattice attack that can be mounted using BKZ in a given dimension
...