Encryption with Quantum Public Keys

Alex B. Grilo, Or Sattath, Quco-Huy Vu

Research output: Working paper/PreprintPreprint

Abstract

It is an important question to find constructions of quantum cryptographic protocols which rely on weaker computational assumptions than classical protocols. Recently, it has been shown that oblivious transfer and multi-party computation can be constructed from one-way functions, whereas this is impossible in the classical setting in a black-box way. In this work, we study the question of building quantum public-key encryption schemes from one-way functions and even weaker assumptions. Firstly, we revisit the definition of IND-CPA security to this setting. Then, we propose three schemes for quantum public-key encryption from one-way functions, pseudorandom function-like states with proof of deletion and pseudorandom function-like states, respectively.
Original languageEnglish
PublisherIACR Cryptology ePrint Archive
Pages1-16
Volume345
StatePublished - 2023

Fingerprint

Dive into the research topics of 'Encryption with Quantum Public Keys'. Together they form a unique fingerprint.

Cite this