Universally Composable Quantum Multi-party Computation

Unruh, Dominique

doi:10.1007/978-3-642-13190-5_25

Cited by 104 publications

(213 citation statements)

References 24 publications

Supporting

Mentioning

213

Contrasting

Order By: Relevance

“…For instance, Unruh [Unr10] shows that classical statistical security in Canetti's universal composabitily (UC) model implies quantum statistical security. Hallgren, Smith, and Song [HSS11] give a two-party protocol that is quantum computationally secure in the UC.…”

Section: Related Workmentioning

confidence: 99%

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Zhandry

2012

Lecture Notes in Computer Science

131

View full text Add to dashboard Cite

We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even using additional assumptions. We also explain how to remove the extra assumptions from prior quantum random oracle model proofs. We accomplish these results by developing new tools for arguing that quantum algorithms cannot distinguish between two oracle distributions. Using a particular class of oracle distributions, so called semi-constant distributions, we argue that the aforementioned cryptosystems are secure against quantum adversaries.

show abstract

Section: Related Workmentioning

confidence: 99%

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Zhandry

2012

Lecture Notes in Computer Science

131

View full text Add to dashboard Cite

show abstract

“…We define the notion of BQS-UC-security, which is an extension of quantum-UC-security [15]. We have composability in the following sense: If π is a secure realization of a functionality F , and σ F securely realizes G by using one instance of F , then σ π , the result of replacing F by π, still securely realizes G. In contrast to quantum-UC-security, however, BQS-UC-security does not allow for concurrent self-composition: if π is secure, this does not automatically imply that two concurrent instances of π are secure 1 .…”

Section: Our Contributionmentioning

confidence: 99%

“…Given C ⊆ parties π , we denote by π C the protocol where all parties in C have been replaced by corruption parties which are controlled by the adversary. For details on the machine and the network model, we refer to the full version [16] or to [15].…”

Section: The Bqs-uc Modelmentioning

confidence: 99%

“…Third, the security proof of their OT protocols uses a computationally unlimited simulator. As discussed in [15], a protocol with an unlimited simulator cannot be composed with a computationally secure protocol. Fourth, since we have no concurrent composability, it is not clear what happens if the protocols are executed in an environment where we do not have total control about which protocols are executed at what time.…”

Section: Introductionmentioning

confidence: 99%

“…In this model, protocols can be arbitrarily composed, even concurrently with other protocols and with copies of themselves. The UC model has been adapted to the quantum setting by Ben-Or and Mayers [1] and by Unruh [14,15]. In light of the success of the UC model, it seems natural to combine the ideas of the UC model with those of the BQS model in order to allow for concurrent composition.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Concurrent Composition in the Bounded Quantum Storage Model

Unruh

2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in the BQS-UC model that composes concurrently with other protocols and an (a-priori) polynomially-bounded number of instances of itself. Our protocol has an efficient simulator which is important if one wishes to compose our protocol with protocols that are only computationally secure. Combining our result with prior results, we get a statistically BQS-UC secure constant-round protocol for general two-party computation without the need for any setup assumption.

show abstract

Composable and Finite Computational Security of Quantum Message Transmission

Banfi

Maurer

Portmann

et al. 2019

Theory of Cryptography

View full text Add to dashboard Cite

Recent research in quantum cryptography has led to the development of schemes that encrypt and authenticate quantum messages with computational security. The security definitions used so far in the literature are asymptotic, gamebased, and not known to be composable. We show how to define finite, composable, computational security for secure quantum message transmission. The new definitions do not involve any games or oracles, they are directly operational: a scheme is secure if it transforms an insecure channel and a shared key into an ideal secure channel from Alice to Bob, i.e., one which only allows Eve to block messages and learn their size, but not change them or read them. By modifying the ideal channel to provide Eve with more or less capabilities, one gets an array of different security notions. By design these transformations are composable, resulting in composable security. Crucially, the new definitions are finite. Security does not rely on the asymptotic hardness of a computational problem. Instead, one proves a finite reduction: if an adversary can distinguish the constructed (real) channel from the ideal one (for some fixed security parameters), then she can solve a finite instance of some computational problem. Such a finite statement is needed to make security claims about concrete implementations. We then prove that (slightly modified versions of) protocols proposed in the literature satisfy these composable definitions. And finally, we study the relations between some game-based definitions and our composable ones. In particular, we look at notions of quantum authenticated encryption and QCCA2, and show that they suffer from the same issues as their classical counterparts: they exclude certain protocols which are arguably secure.

show abstract

Universally Composable Quantum Multi-party Computation

Cited by 104 publications

References 24 publications

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Concurrent Composition in the Bounded Quantum Storage Model

Composable and Finite Computational Security of Quantum Message Transmission

Contact Info

Product

Resources

About