Cryptology ePrint Archive: Report 2021/740

The Boneh-Katz Transformation, Revisited: Pseudorandom/Obliviously-Samplable PKE from Lattices and Codes and Its Application

Keita Xagawa

Abstract: The Boneh-Katz transformation (CT-RSA 2005) converts a selectively-secure identity/tag-based encryption scheme into a public-key encryption scheme secure against chosen-ciphertext attacks. We show that if the underlying primitives are pseudorandom, then the public-key encryption scheme obtained by the Boneh-Katz transformation is also pseudorandom. A similar result holds for oblivious sampleability (Canetti and Fischlin (CRYPTO 2001)).

As applications, we can construct

* pseudorandom and obliviously-samplable public-key encryption schemes from lattices and codes,

* universally-composable non-interactive bit-commitment from lattices,

* public-key steganography which is steganographically secure against adaptive chosen-covertext attacks and steganographic key-exchange from lattices and codes,

* anonymous authenticated key exchange from lattices and codes,

* public-key encryption secure against simulation-based, selective-opening chosen-ciphertext attacks from lattices and codes.

Category / Keywords: public-key cryptography / Public-Key Encryption, Tag-Based Encryption, Post-Quantum Cryptography, the Boneh-Katz Transformation, Selective-Opening Security, Anonymity

Original Publication (with major differences): SAC 2021

Date: received 3 Jun 2021, last revised 13 Sep 2021

Contact author: keita xagawa zv at hco ntt co jp

Available format(s): PDF | BibTeX Citation

Note: Add a concurrent work.

Version: 20210914:050152 (All versions of this report)

Short URL: ia.cr/2021/740


[ Cryptology ePrint archive ]