Paper Info
Title
Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
Abstract
We give generic constructions of several fundamental cryptographic primitives based on a new encryption primitive that combines circular security for bit encryption with the so-called reproducibility property (Bellare et al. PKC 2003). At the heart of our constructions is a novel technique which gives a way of de-randomizing reproducible public-key bitencryption schemes and also a way of reducing one-wayness conditions of a constructed trapdoor-function family (TDF) to circular security of the base scheme. The main primitives that we build from our encryption primitive include k-wise one-way TDFs (Rosen and Segev TCC 2009), CCA2-secure encryption and deterministic encryption. Our results demonstrate a new set of applications of circularly-secure encryption beyond fully-homomorphic encryption and symbolic soundness. Finally, we show the plausibility of our assumptions by showing that the DDH-based circularly-secure scheme of Boneh et al. (Crypto 2008) and the subgroup indistinguishability based scheme of Brakerski and Goldwasser (Crypto 2010) are both reproducible.
Year
DOI
Venue
2015
10.1007/978-3-662-47989-6_11
ADVANCES IN CRYPTOLOGY, PT I
Keywords
Field
DocType
Circular security,Correlated-input security,Trapdoor functions,(non-)shielding CCA construction,Deterministic encryption
Multiple encryption,Optimal asymmetric encryption padding,Computer science,Attribute-based encryption,Deterministic encryption,Disk encryption theory,Plaintext-aware encryption,Theoretical computer science,Encryption,Probabilistic encryption
Conference
Volume
ISSN
Citations 
9215
0302-9743
2
PageRank 
References 
Authors
0.36
33
2
Name
Order
Citations
PageRank
Mohammad Hajiabadi1538.38
Bruce M. Kapron230826.02