Cryptology ePrint Archive: Report 2015/385
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
Serge Fehr and Jonathan Katz and Fang Song and Hong-Sheng Zhou and Vassilis Zikas
Abstract: It is known that cryptographic feasibility results can change by moving from the classical to the quantum world. With this in mind, we study the feasibility of realizing functionalities in the framework of universal composability, with respect to both computational and information-theoretic security. With respect to computational security, we show that existing feasibility results carry over unchanged from the classical to the quantum world; a functionality is “trivial” (i.e., can be realized without setup) in the quantum world if and only if it is trivial in the classical world. The same holds with regard to functionalities that are complete (i.e., can be used to realize arbitrary other functionalities).
In the information-theoretic setting, the quantum and classical worlds differ. In the quantum world, functionalities in the class we consider are either complete, trivial, or belong to a family of simultaneous-exchange functionalities (e.g., XOR). However, other results in the information-theoretic setting remain roughly unchanged.
Category / Keywords: cryptographic protocols / cryptographic reductions, quantum security
Original Publication (in the same form): IACR-TCC-2013
Date: received 24 Apr 2015, last revised 28 Apr 2015
Contact author: fang song at uwaterloo ca
Available format(s): PDF | BibTeX Citation
Version: 20150429:014537 (All versions of this report)
Short URL: ia.cr/2015/385
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]