An uninstantiable random-oracle-model scheme for a hybrid-encryption problem

作者: Mihir Bellare , Alexandra Boldyreva , Adriana Palacio

DOI: 10.1007/978-3-540-24676-3_11

关键词:

摘要: We present a simple, natural random-oracle (RO) model scheme, for practical goal, that is uninstantiable, meaning proven in the RO to meet its goal yet admits no standard-model instantiation meets this goal. The question IND-CCA-preserving asymmetric encryption which formally captures security of most common usage encryption, namely transport symmetric key such way under latter remains secure. scheme an ElGamal variant, called Hash ElGamal, resembles numerous existing RO-model schemes, and on surface shows evidence anomalous properties. These results extend our understanding gap between standard models, bring concerns raised by previous work closer practice indicating problem schemes admitting secure can arise domains where are commonly designed.

参考文章(22)
Joonsang Baek, Byoungcheon Lee, Kwangjo Kim, Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption Information Security and Privacy. pp. 49- 58 ,(2000) , 10.1007/10718964_5
Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen, Optimal Chosen-Ciphertext Secure Encryption of Arbitrary-Length Messages public key cryptography. pp. 17- 33 ,(2002) , 10.1007/3-540-45664-3_2
Coron Jean-Sébastien, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen, GEM: A Generic Chosen-Ciphertext Secure Encryption Method the cryptographers track at the rsa conference. pp. 263- 276 ,(2002) , 10.1007/3-540-45760-7_18
Amos Fiat, Adi Shamir, How to prove yourself: practical solutions to identification and signature problems international cryptology conference. ,vol. 263, pp. 186- 194 ,(1987) , 10.1007/3-540-47721-7_12
Silvio Micali, Computationally Sound Proofs SIAM Journal on Computing. ,vol. 30, pp. 1253- 1298 ,(2000) , 10.1137/S0097539795284959
Eiichiro Fujisaki, Tatsuaki Okamoto, Secure Integration of Asymmetric and Symmetric Encryption Schemes Journal of Cryptology. ,vol. 26, pp. 80- 101 ,(2013) , 10.1007/S00145-011-9114-1
Ran Canetti, Oded Goldreich, Shai Halevi, The random oracle methodology, revisited (preliminary version) symposium on the theory of computing. pp. 209- 218 ,(1998) , 10.1145/276698.276741
Mihir Bellare, Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols computer and communications security. pp. 62- 73 ,(1993) , 10.1145/168588.168596
Joonsang Baek Baek, Byoungcheon Lee Lee, Kwangjo Kim Kim, Provably Secure Length-saving Public-Key Encryption Scheme under the Computational Diffie-Hellman Assumption Etri Journal. ,vol. 22, pp. 25- 31 ,(2000) , 10.4218/ETRIJ.00.0100.0403