Concurrent Composition in the Bounded Quantum Storage Model

Unruh, Dominique

doi:10.1007/978-3-642-20465-4_26

Cited by 17 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, along with their impossiblity result, Canetti and Fischlin also show that a  resource can be constructed if we assume a common reference string (CRS) shared between the players and computationally bounded players [16]. In the quantum case, Unruh showed in [20] that if the adversary has bounded quantum memory, bit commitment that is composable in certain restricted settings is possible 7 . In [21] Unruh also shows that everlasting quantum bit commitment is achievable, if we assume signature cards as trusted setup.…”

Section: Previous Resultsmentioning

confidence: 99%

“…Our framework can also be applied to situations where agents exchange a superposition of different numbers of messages in a superposition of orders in time, and provides an operational formalism for studying indefinite causal structures. We note that the model of computation used in the UC framework [20] does not support Minkowski space-time, so UC cannot be used to analyze relativistic protocols.…”

Section: Overview and Scope Of Our Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Composable security in relativistic quantum cryptography

2019

View full text Add to dashboard Cite

Relativistic protocols have been proposed to overcome certain impossibility results in classical and quantum cryptography. In such a setting, one takes the location of honest players into account, and uses the signalling limit given by the speed of light to constraint the abilities of dishonest agents. However, composing such protocols with each other to construct new cryptographic resources is known to be insecure in some cases. To make general statements about such constructions, a composable framework for modelling cryptographic security in Minkowski space is required. Here, we introduce a framework for performing such a modular security analysis of classical and quantum cryptographic schemes in Minkowski space. As an application, we show that (1) fair and unbiased coin flipping can be constructed from a simple resource called channel with delay; (2) biased coin flipping, bit commitment and channel with delay through any classical, quantum or post-quantum relativistic protocols are all impossible without further setup assumptions; (3) it is impossible to securely increase the delay of a channel, given several short-delay channels as ingredients. Results (1) and (3) imply in particular the non-composability of existing relativistic bit commitment and coin flipping protocols.

show abstract

Section: Previous Resultsmentioning

confidence: 99%

Section: Overview and Scope Of Our Resultsmentioning

confidence: 99%

Composable security in relativistic quantum cryptography

2019

View full text Add to dashboard Cite

show abstract

“…This question was answered in the positive in a number of works, including: Fehr and Schaffner [111], Wehner and Wullschleger [230] (for sequential composition) and Unruh [217] (for bounded concurrent composition).…”

Section: Beyond Limited Quantum Storagementioning

confidence: 99%

Quantum cryptography beyond quantum key distribution

Broadbent

Schaffner

2015

Des. Codes Cryptogr.

187

112

View full text Add to dashboard Cite

Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two-and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries-including the impossibility of quantum bit commitment, the difficulty of quantum rewinding and the definition of quantum security models for classical primitives. In this review article, aimed primarily at cryptographers unfamiliar with the quantum world, we survey the area of theoretical quantum cryptography, with an emphasis on the constructions and limitations beyond the realm of QKD.

show abstract

“…9,10,37 More recently, Dupuis et al 38,39 constructed two-party quantum protocols for evaluating arbitrary unitary operations, which they proved secure under reasonable computational assumptions in a simulation-based de¯nition similar to what we propose in this work. There was also a line of work on the bounded quantum storage model 11,[40][41][42] developed tools for reasoning about speci¯c types of composition of two-party protocols, under assumptions on the size of the adversary's quantum storage. Many tools have been developed in recent years on modeling and analyzing composable security for protocols of device-independent quantum key-exchange and randomness expansion.…”

Section: Analyses Of Quantum Protocolsmentioning

confidence: 99%

Classical cryptographic protocols in a quantum world

Hallgren

Smith

Song

2015

Int. J. Quantum Inform.

View full text Add to dashboard Cite

Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: What classical protocols remain secure against quantum attackers?Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it su±ces that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.

show abstract

Concurrent Composition in the Bounded Quantum Storage Model

Cited by 17 publications

References 13 publications

Composable security in relativistic quantum cryptography

Composable security in relativistic quantum cryptography

Quantum cryptography beyond quantum key distribution

Classical cryptographic protocols in a quantum world

Contact Info

Product

Resources

About