Title
Standard Security Does Imply Security Against Selective Opening for Markov Distributions.
Abstract
About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-CPA security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other. In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial.
Year
DOI
Venue
2016
10.1007/978-3-662-49096-9_12
Lecture Notes in Computer Science
Keywords
Field
DocType
Public-key encryption,Selective opening security,Markov,IND-CPA,IND-SO-CPA
Discrete mathematics,Exponential function,Polynomial,Computer science,Markov chain,Communication channel,Encryption,Selective opening,Public-key cryptography,Special case
Conference
Volume
ISSN
Citations 
9562
0302-9743
1
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Georg Fuchsbauer147522.51
Felix Heuer2110.83
Eike Kiltz32872117.46
Krzysztof Pietrzak4151372.60