Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical...
A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private information...
View ArticleOnline Deniability for Multiparty Protocols with Applications to Externally...
In the problem of anonymous authentication (Boneh et al. CCS 1999), a sender wishes to authenticate a message to a given recipient in a way that preserves anonymity: the recipient does not know the...
View ArticleBilinear Entropy Expansion from the Decisional Linear Assumption, by Lucas...
We develop a technique inspired by pseudorandom functions that allows us to increase the entropy available for proving the security of dual system encryption schemes under the Decisional Linear...
View ArticleComputing Mod Without Mod, by Mark A. Will and Ryan K. L. Ko
Encryption algorithms are designed to be difficult to break without knowledge of the secrets or keys. To achieve this, the algorithms require the keys to be large, with some algorithms having a...
View ArticleTwo Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using...
The well-known classical constructions of garbled circuits use four ciphertexts per gate, although various methods have been proposed to reduce this cost. The best previously known methods for...
View ArticleAdaptively Secure Broadcast Encryption with Small System Parameters, by Mark...
We build the first public-key broadcast encryption system that simultaneously achieves adaptive security against arbitrary number of colluders, has small system parameters, and has a security proof...
View ArticleCryptographic Reverse Firewalls, by Ilya Mironov and Noah Stephens-Davidowitz
Recent revelations by Edward Snowden show that a user's own hardware and software can be used against her in various ways (e.g., to leak her private information). And, a series of recent announcements...
View ArticleHow to Efficiently Evaluate RAM Programs with Malicious Security, by Arash...
Secure 2-party computation (2PC) is becoming practical for some applications. However, most approaches are limited by the fact that the desired functionality must be represented as a boolean circuit....
View ArticleMontgomery Modular Multiplication on ARM-NEON Revisited, by Hwajeong Seo, Zhe...
Montgomery modular multiplication constitutes the "arithmetic foundation" of modern public-key cryptography with applications ranging from RSA, DSA and Diffie-Hellman over elliptic curve schemes to...
View ArticleGF(2^n) redundant representation using matrix embedding, by Yongjia Wang and...
By embedding a Toeplitz matrix-vector product (MVP) of dimension $n$ into a circulant MVP of dimension $N=2n+\delta -1$, where $\delta $ can be any nonnegative integer, we present a $GF(2^n)$...
View ArticleBootstrapping BGV Ciphertexts With A Wider Choice of p and q., by Emmanuela...
We describe a method to bootstrap a packed BGV ciphertext which does not depend (as much) on any special properties of the plaintext and ciphertext moduli. Prior ``efficient'' methods such as that of...
View ArticleAuthenticated Key Exchange from Ideal Lattices, by Jiang Zhang and Zhenfeng...
Authenticated key exchange (AKE) protocols, such as IKE and SSL/TLS, have been widely used to ensure secure communication over the Internet. We present in this paper a practical and provably secure AKE...
View ArticleCryptanalysis of Reduced-round SIMON32 and SIMON48, by Qingju Wang and...
SIMON family is one of the recent lightweight block cipher designs introduced by NSA. So far there have been several cryptanalytic results on this cipher by means of differential, linear and impossible...
View ArticleAccess Control in Publicly Verifiable Outsourced Computation, by James...
Publicly Verifiable Outsourced Computation (PVC) allows devices with restricted resources to delegate expensive computations to more powerful external servers, and to verify the correctness of results....
View ArticleOn the Privacy Provisions of Bloom Filters in Lightweight Bitcoin clients, by...
Lightweight Bitcoin clients are gaining increasing adoption among Bitcoin users, owing to their reduced resource and bandwidth consumption. These clients support a simplified payment verification (SPV)...
View ArticleOne-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin, by Jens...
We construct a 3-move public coin special honest verifier zero-knowledge proof, a so-called Sigma-protocol, for a list of commitments having at least one commitment that opens to 0. It is not required...
View ArticleThe Bitcoin Backbone Protocol: Analysis and Applications, by Juan Garay and...
Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin {\em backbone}, and prove...
View ArticleSuccinct Garbling Schemes and Applications, by Huijia Lin and Rafael Pass
Assuming the existence of iO for P/poly and one-way functions, we show how to succinctly garble bounded-space computations (BSC) M: the size of the garbled program (as well as the time needed to...
View ArticleAlgebraic Attacks on Human Identification Protocols, by Hassan Jameel Asghar...
Human identification protocols are challenge-response protocols that rely on human computational ability to reply to random challenges from the server based on a public function of a shared secret and...
View ArticleCut-and-Choose Bilateral Oblivious Transfer and Its Application in Secure...
In secure two-party computation protocols, the cut-and-choose paradigm is used to prevent the malicious party who constructs the garbled circuits from cheating. In previous realization of the...
View Article