Open AccessJournal Article
Secure Identity Based Encryption without random oracles
Dan Boneh,Xavier Boyen +1 more
Reads0
Chats0
TLDR
Boneh and Franklin this paper presented a fully secure identity based encryption scheme whose proof of security does not rely on the random oracle heuristic. Security is based on the Decision Bilinear Diffie-Hellman assumption.Abstract:
We present a fully secure Identity Based Encryption scheme whose proof of security does not rely on the random oracle heuristic. Security is based on the Decision Bilinear Diffie-Hellman assumption. This solves an open problem posed by Boneh and Franklin in 2001.read more
Citations
More filters
Journal Article
Efficient selective identity-based encryption without random oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: In this article, the authors presented two efficient identity-based encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map.
Posted Content
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques.
TL;DR: This paper develops new partitioning techniques that can be performed with compact parameters and proposes new schemes based on the idea to fill gaps in existing constructions of adaptively secure identity-based encryption from lattices and verifiable random function with large input spaces.
Posted Content
A Generic Approach to Constructing and Proving Verifiable Random Functions.
TL;DR: Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions wherein a secret key holder can also prove validity of the function evaluation relative to a statistically binding commitment.
Journal Article
Garbled Protocols and Two-Round MPC from Bilinear Maps.
TL;DR: This paper initiates the study of garbled protocols — a generalization of Yaos garbled circuits construction to distributed protocols and obtains a general compiler that compresses any arbitrary round multiparty secure computation protocol into a two-round UC secure protocol.
Patent
Data search device, data search method, data search program, data registration device, data registration method, data registration program and information processing device
TL;DR: In this paper, a data search server 300 stores a system ciphertext 230 including a data ciphertext and a keyword ciphertext in each category specific DB unit 391 for each data category, and stores each category-determination secret key 153 being associated with each database unit.