Chosen Ciphertext Security with Optimal Ciphertext Overhead
作者： Masayuki Abe , Eike Kiltz , Tatsuaki Okamoto
DOI: 10.1007/978-3-540-89255-7_22
关键词: Malleability 、 Unicity distance 、 Theoretical computer science 、 Distributed computing 、 Ciphertext indistinguishability 、 Ciphertext 、 Cramer–Shoup cryptosystem 、 Ciphertext stealing 、 Semantic security 、 Mathematics 、 Attribute-based encryption
摘要: Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts provide semantic security against chosen ciphertext attacks (IND-CCA). The difference between the length and embedded message is called overhead . While generic brute-force adversary running in 2 t steps gives theoretical lower bound bits on for IND-CPA security, best known IND-CCA secure schemes demand roughly 2t even random oracle model. Is -bit gap essential achieving security? We close by proposing an whose matches up small constant. Our uses variation four-round Feistel network model hence belongs family OAEP-based schemes. Maybe independent interest new efficient method encrypt long messages exceeding permutation while retaining minimal overhead.
core.ac.uk
springer.com
researchgate.net 
sci-hub.st 参考文章(29)
Hideki Imai, Kazukuni Kobara, OAEP++ : A Very Simple Way to Apply OAEP to Deterministic OW-CPA Primitives. IACR Cryptology ePrint Archive. ,vol. 2002, pp. 130- ,(2002)
Yuichi Komano, Kazuo Ohta, Efficient Universal Padding Techniques for Multiplicative Trapdoor One-Way Permutation Advances in Cryptology - CRYPTO 2003. pp. 366- 382 ,(2003) , 10.1007/978-3-540-45146-4_22
Yang Cui, Kazukuni Kobara, Hideki Imai, A Generic Conversion with Optimal Redundancy Lecture Notes in Computer Science. pp. 104- 117 ,(2005) , 10.1007/978-3-540-30574-3_9
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
Duong Hieu Phan, David Pointcheval, OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding international conference on the theory and application of cryptology and information security. pp. 63- 77 ,(2004) , 10.1007/978-3-540-30539-2_5
Jean-Sébastien Coron, Marc Joye, David Naccache, Pascal Paillier, Universal Padding Schemes for RSA Advances in Cryptology — CRYPTO 2002. pp. 226- 241 ,(2002) , 10.1007/3-540-45708-9_15
Tor E. Bjørstad, Alex W. Dent, Nigel P. Smart, Efficient KEMs with partial message recovery Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding. pp. 233- 256 ,(2007) , 10.1007/978-3-540-77272-9_15
Mihir Bellare, Phillip Rogaway, Optimal asymmetric encryption theory and application of cryptographic techniques. pp. 92- 111 ,(1994) , 10.1007/BFB0053428
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
Duong Hieu Phan, David Pointcheval, Chosen-Ciphertext Security without Redundancy international conference on the theory and application of cryptology and information security. pp. 1- 18 ,(2003) , 10.1007/978-3-540-40061-5_1