-
Article
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
In this work, we show how to use indistinguishability obfuscation to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing. Our schemes enjoy several interesting properti...
-
Article
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slightly homomorphic signatures, or ...
-
Article
Efficient Selective Identity-Based Encryption Without Random Oracles
We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identity secure IBE...
-
Article
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an effici...
-
Article
Oblivious signature-based envelope
We propose a new cryptographic primitive called oblivious signature-based envelope (OSBE). Informally, an OSBE scheme enables a sender to send an envelope (encrypted message) to a receiver, and has the followi...
-
Article
Short Signatures from the Weil Pairing
We introduce a short signature scheme based on the Computational Diffie–Hellman assumption on certain elliptic and hyperelliptic curves. For standard security parameters, the signature length is about half t...
-
Article
On the Importance of Eliminating Errors in Cryptographic Computations
We present a model for attacking various cryptographic schemes by taking advantage of random hardware faults. The model consists of a black-box containing some cryptographic secret. The box interacts with the...
