Shi-Feng Sun
ABSTRACT
Non-malleability is an important and intensively studied security notion for many cryptographic primitives. In the context of public key encryption, this notion means it is infeasible for an adversary to transform an encryption of some message m into one of a related message m' under the given public key. Although it has provided a strong security property for many applications, it still does not suffice for some scenarios like the system where the users could issue keys on-the-fly. In such settings, the adversary may have the power to transform the given public key and the ciphertext. To withstand such attacks, Fischlin introduced a stronger notion, known as complete non-malleability, which requires that the non-malleability property be preserved even for the adversaries attempting to produce a ciphertext of some related message under the transformed public key. To date, many schemes satisfying this stronger security have been proposed, but they are either inefficient or proved secure in the random oracle model. In this work, we put forward a new encryption scheme in the common reference string model. Based on the standard DBDH assumption, the proposed scheme is proved completely non-malleable secure against adaptive chosen ciphertext attacks in the standard model. In our scheme, the well-formed public keys and ciphertexts could be publicly recognized without drawing support from unwieldy techniques like non-interactive zero knowledge proofs or one-time signatures, thus achieving a better performance.
- S. Agrawal, D. Boneh, and X. Boyen. Efficient lattice (H)IBE in the standard model. In Advances in Cryptology - EUROCRYPT 2010, French Riviera, May 30 - June 3, 2010, pages 553--572, 2010. Google Scholar
Digital Library
- S. S. Al-Riyami and K. G. Paterson. Certificateless public key cryptography. In Advances in Cryptology - ASIACRYPT 2003, Taipei, Taiwan, November 30 - December 4, 2003, pages 452--473, 2003.Google Scholar
- M. Barbosa and P. Farshim. Relations among notions of complete non-malleability: Indistinguishability characterisation and efficient construction without random oracles. In ACISP 2010, Sydney, Australia, July 5--7, 2010, pages 145--163, 2010. Google ScholarDigital Library
- M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology - CRYPTO '98, Santa Barbara, California, USA, August 23--27, 1998, pages 26--45, 1998. Google ScholarCross Ref
- M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Advances in Cryptology - EUROCRYPT '94, Perugia, Italy, May 9--12, 1994, pages 92--111, 1994.Google Scholar
- D. Boneh and X. Boyen. Efficient selective-id secure identity-based encryption without random oracles. In Advances in Cryptology - EUROCRYPT 2004, Interlaken, Switzerland, May 2--6, 2004, pages 223--238, 2004.Google Scholar
- R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In Advances in Cryptology - EUROCRYPT 2004, Interlaken, Switzerland, May 2--6, 2004, pages 207--222, 2004.Google Scholar
- D. Cash, E. Kiltz, and V. Shoup. The twin diffie-hellman problem and applications. In EUROCRYPT 2008, Istanbul, Turkey, April 13--17, 2008, pages 127--145, 2008. Google ScholarDigital Library
- R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology - CRYPTO '98, Santa Barbara, California, USA, August 23--27, 1998, pages 13--25, 1998. Google ScholarCross Ref
- R. Cramer and V. Shoup. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In EUROCRYPT 2002, Amsterdam, The Netherlands, April 28 - May 2, 2002, pages 45--64, 2002. Google ScholarDigital Library
- G. D. Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and non-interactive non-malleable commitment. In EUROCRYPT 2001, Innsbruck, Austria, May 6--10, 2001, pages 40--59, 2001. Google ScholarDigital Library
- D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM J. Comput., 30(2):391--437, 2000. Google ScholarDigital Library
- M. Fischlin. Completely non-malleable schemes. In ICALP 2005, Lisbon, Portugal, July 11--15, 2005, pages 779--790, 2005. Google ScholarDigital Library
- M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. In Advances in Cryptology - CRYPTO 2000, Santa Barbara, California, USA, August 20--24, 2000, pages 413--431, 2000. Google ScholarDigital Library
- E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is secure under the RSA assumption. In Advances in Cryptology - CRYPTO 2001, Santa Barbara, California, USA, August 19--23, 2001, pages 260--274, 2001. Google ScholarDigital Library
- G. Hanaoka and K. Kurosawa. Efficient chosen ciphertext secure public key encryption under the computational diffie-hellman assumption. In Advances in Cryptology - ASIACRYPT 2008, Melbourne, Australia, December 7--11, 2008, pages 308--325, 2008. Google ScholarDigital Library
- D. Hofheinz, E. Kiltz, and V. Shoup. Practical chosen ciphertext secure encryption from factoring. J. Cryptology, 26(1):102--118, 2013. Google ScholarDigital Library
- J. Lai, R. H. Deng, S. Liu, and W. Kou. Efficient CCA-secure PKE from identity-based techniques. In Topics in Cryptology - CT-RSA 2010, San Francisco, CA, USA, March 1--5, 2010, pages 132--147, 2010. Google ScholarDigital Library
- B. Libert and M. Yung. Efficient completely non-malleable public key encryption. In ICALP 2010, Bordeaux, France, July 6--10, 2010, pages 127--139, 2010. Google ScholarDigital Library
- C. Peikert and B. Waters. Lossy trapdoor functions and their applications. In STOC '08, Victoria, British Columbia, Canada, May 17--20, 2008, pages 187--196, 2008. Google ScholarDigital Library
- A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In FOCS '99, 17--18 October, 1999, New York, NY, USA, pages 543--553, 1999. Google ScholarDigital Library
- R. Sepahi, J. Pieprzyk, S. F. Shahandashti, and B. Schoenmakers. New security notions and relations for public-key encryption. J. Mathematical Cryptology, 6(3--4):183--227, 2012.Google ScholarCross Ref
- R. Sepahi, R. Steinfeld, and J. Pieprzyk. Lattice-based completely non-malleable public-key encryption in the standard model. Des. Codes Cryptography, 71(2):293--313, 2014. Google ScholarDigital Library
- C. Ventre and I. Visconti. Completely non-malleable encryption revisited. In Public Key Cryptography - PKC 2008, Barcelona, Spain, March 9--12, 2008, pages 65--84, 2008. Google ScholarDigital Library
- B. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005, Aarhus, Denmark, May 22--26, 2005, pages 114--127, 2005. Google ScholarDigital Library
Index Terms
- Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption
Recommendations
Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
Information Security and Cryptology --- ICISC 2008In this paper, we present a simple and generic method for constructing public key encryption (PKE) secure against chosen ciphertext attacks (CCA) from identity-based encryption (IBE). Specifically, we show that a CCA-secure PKE scheme can be generically ...
Lattice-based completely non-malleable public-key encryption in the standard model
An encryption scheme is non-malleable if giving an encryption of a message to an adversary does not increase its chances of producing an encryption of a related message (under a given public key). Fischlin introduced a stronger notion, known as complete ...
Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions
Proceedings, Part II, of the 21st Australasian Conference on Information Security and Privacy - Volume 9723Motivated by tampering attacks in practice, two different but related security notions, termed complete non-malleability and related-key attack security, have been proposed recently. In this work, we study their relations and present the first public key ...
Comments