Efficient key encapsulation mechanisms with tight security reductions to standard assumptions in the two security models. Issue 12 (2nd March 2016)

• Record Type: Journal Article
• Authors: Hanatani, Yoshikazu; Hanaoka, Goichiro; Matsuda, Takahiro; Yamakawa, Takashi
• Other Names: Jiang Shaoquan guestEditor.; Takagi Tsuyoshi guestEditor.; Wang Guilin guestEditor.
• Is Part Of: Security and communication networks. Volume 9:Issue 12(2016)
• Page Start: 1676
• Page End: 1697
• Publication Date: 2016-03-02
• Subjects: public key encryption -- key encapsulation mechanism -- random oracle model -- standard model -- CCA security -- constrained CCA security; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1444
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: In this paper, we propose two new practical constructions of chosen ciphertext attack secure (CCA secure) key encapsulation mechanisms (KEM, which is the main building block for public key encryption in hybrid encryption), with remarkable security features: Our KEMs can be proved not only to satisfy CCA security (or constrained CCA security introduced by Hofheinz and Kiltz at CRYPTO'07) in the standard model with a tight security reduction to a basic indistinguishability‐type assumption but also to be CCA secure in the random oracle model with a tight security reduction to a basic computational ‐type assumption. Our first construction is based on the Diffie–Hellman‐type assumptions, and compared with the KEM by Shoup at EUROCRYPT'00 that has security reductions in two security models (but its security proof in the random model is a loose reduction), our proposed KEM has a smaller ciphertext size with the same computational costs, and more importantly, ours has a tight security reduction also in the random oracle model. Our second construction is based on assumptions related to integer factoring, and compared with the KEM by Hofheinz and Kiltz at CRYPTO'99 that also has tight security reductions in two security models to factoring‐related assumptions, our proposed KEM has similar efficiency (both ciphertext size and computational costs) and bases the security on incomparable assumptions. Copyright © 2016 John Wiley & Sons, Ltd. Abstract : We propose two new practical constructions of chosen ciphertext secure key encapsulation mechanism (KEM). Each of constructions has a tight security reduction to a search problem in the random oracle model and another tight security reduction to a distinguish problem in the standard model. The first construction is based on the DiffieŰHellman‐type assumptions, and the second construction is based on factoring‐related assumption. Both constructions achieve similar efficiency compared with other practical KEMs based on the same type computational assumptions.