Filters








4 Hits in 3.4 sec

Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security [article]

Benoît Libert, Khoa Nguyen, Alain Passelègue, Radu Titiu
2019 IACR Cryptology ePrint Archive  
Specifically, we give a direct construction of an unbounded simulation-sound NIZK argument system which, for carefully chosen parameters, makes it possible to express the equality of plaintexts encrypted  ...  The Naor-Yung paradigm is a well-known technique that constructs IND-CCA2-secure encryption schemes by means of non-interactive zero-knowledge proofs satisfying a notion of simulation-soundness.  ...  This work was also supported in part by the European Union PROMETHEUS project (Horizon 2020 Research and Innovation Program, grant 780701).  ... 
dblp:journals/iacr/LibertNPT19 fatcat:ugsj3yfrqfai7lgpfw7hb5qgou

Key dependent message security

Tal Malkin, Isamu Teranishi, Moti Yung
2011 Proceedings of the first ACM conference on Data and application security and privacy - CODASPY '11  
In this paper we review the definition, and survey recent results and applications of KDM security.  ...  An encryption scheme is Key Dependent Message (KDM) secure if it is secure even against an attacker who has access to encryptions of messages which depend on the secret key.  ...  They also gave a sufficient condition characterizing when their technique is applicable to a scheme, and use it to apply their technique to the scheme of [5] , resulting in a scheme based on the LWE assumption  ... 
doi:10.1145/1943513.1943516 dblp:conf/codaspy/MalkinTY11 fatcat:rtkk3y3kbvch7hdhcymuezmmqi

Reproducible Circularly Secure Bit Encryption: Applications and Realizations

Mohammad Hajiabadi, Bruce M. Kapron
2016 Journal of Cryptology  
Our results demonstrate a new set of applications of circularly-secure encryption beyond fully-homomorphic encryption and symbolic soundness.  ...  We show how to extract many hardcore bits for our constructed TDFs, and by applying the results of [36] we obtain a blackbox (BB) construction of CCA2-secure encryption from our assumptions.  ...  Fix u ∈ ω(log n) and let l i = l+p r +u and l o = 2l+p r −λ. Our goal is to build an (l i , l o )-INDsecure deterministic encryption scheme.  ... 
doi:10.1007/s00145-016-9246-4 fatcat:pq6mkmii6rg63jesjem6nvtp7y

Reproducible Circularly-Secure Bit Encryption: Applications and Realizations [chapter]

Mohammad Hajiabadi, Bruce M. Kapron
2015 Lecture Notes in Computer Science  
Our results demonstrate a new set of applications of circularly-secure encryption beyond fully-homomorphic encryption and symbolic soundness.  ...  We show how to extract many hardcore bits for our constructed TDFs, and by applying the results of [36] we obtain a blackbox (BB) construction of CCA2-secure encryption from our assumptions.  ...  Fix u ∈ ω(log n) and let l i = l+p r +u and l o = 2l+p r −λ. Our goal is to build an (l i , l o )-INDsecure deterministic encryption scheme.  ... 
doi:10.1007/978-3-662-47989-6_11 fatcat:fnvj6zwqynfgvmrpqrpkzvhylu