Cryptology ePrint Archive: Report 2012/177

Everlasting Multi-Party Computation

Unruh, Dominique

Abstract: A protocol has everlasting security if it is secure against adversaries that are computationally unlimited after the protocol execution. This models the fact that we cannot predict which cryptographic schemes will be broken, say, several decades after the protocol execution. In classical cryptography, everlasting security is difficult to achieve: even using trusted setup like common reference strings or signature cards, many tasks such as secure communication and oblivious transfer cannot be achieved with everlasting security. An analogous result in the quantum setting excludes protocols based on common reference strings, but not protocols using a signature card. We define a variant of the Universal Composability framework, everlasting quantum-UC, and show that in this model, we can implement secure communication and general multi-party computation using signature cards as trusted setup.

Category / Keywords: foundations / Quantum cryptography, everlasting security, universal composability

Original Publication (with major differences): IACR-CRYPTO-2013
DOI: 10.1007/978-3-642-40084-1_22

Date: received 3 Apr 2012, last revised 23 Aug 2013

Contact author: unruh at ut ee

Available format(s): PDF | BibTeX Citation

Note: Title changed to match the conference version. A number of small changes and corrections.

Version: 20130823:142045 (All versions of this report)

Short URL: ia.cr/2012/177

Discussion forum: Show discussion | Start new discussion