Composing Quantum Protocols in a Classical Environment

Fehr, Serge; Schaffner, Christian

doi:10.1007/978-3-642-00457-5_21

Cited by 37 publications

(84 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Fehr and Schaffner showed in [24] that similar results also hold in the quantum setting. They presented security conditions for quantum protocols where the honest players have classical input and output, and showed that any quantum protocol that satisfies these conditions can be used as a sub-protocol in a classical protocol.…”

Section: Related Workmentioning

confidence: 64%

Statistical Security Conditions for Two-Party Secure Function Evaluation

Crépeau

Wullschleger

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. To simplify proofs in information-theoretic security, the standard security definition of two-party secure function evaluation based on the real/ideal model paradigm is often replaced by an informationtheoretic security definition. At EUROCRYPT 2006, we showed that most of these definitions had some weaknesses, and presented new information-theoretic conditions that were equivalent to a simulation-based definition in the real/ideal model. However, there we only considered the perfect case, where the protocol is not allowed to make any error, which has only limited applications.We generalize these results to the statistical case, where the protocol is allowed to make errors with a small probability. Our results are based on a new measure of information that we call the statistical information, which may be of independent interest.

show abstract

Section: Related Workmentioning

confidence: 64%

Statistical Security Conditions for Two-Party Secure Function Evaluation

Crépeau

Wullschleger

Lecture Notes in Computer Science

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.

Self Cite

170

109

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

“…The notion of conditional independence has been introduced in [10] (a classical version was independently proposed in [6]) and used as a convenient tool in subsequent papers [17,4]. In this paper we will use the following property of conditional independence whose proof is given in Appendix A.…”

Section: Conditional Independencementioning

confidence: 99%

Secure identification and QKD in the bounded-quantum-storage model

Damgård

Fehr

Salvail

et al. 2014

Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w as possible-the adversary can exclude at most one possible password for each execution. We propose a solution in the bounded-quantum-storage model, where U and S may exchange qubits, and a dishonest party is assumed to have limited quantum memory. No other restriction is posed upon the adversary. An improved version of the proposed identification scheme is also secure against a man-in-the-middle attack, but requires U and S to additionally share a high-entropy key k. However, security is still guaranteed if one party loses k to the attacker but notices the loss. In both versions, the honest participants need no quantum memory, and noise and imperfect quantum sources can be tolerated. The schemes compose sequentially, and w and k can securely be re-used. A small modification to the identification scheme results in a quantum-keydistribution (QKD) scheme, secure in the bounded-quantum-storage model, with the same re-usability properties of the keys, and without assuming authenticated channels. This is in sharp contrast to known QKD schemes (with unbounded adversary) without authenticated channels, where authentication keys must be updated, and unsuccessful executions can cause the parties to run out of keys.

show abstract

Composing Quantum Protocols in a Classical Environment

Cited by 37 publications

References 23 publications

Statistical Security Conditions for Two-Party Secure Function Evaluation

Statistical Security Conditions for Two-Party Secure Function Evaluation

Quantum cryptography beyond quantum key distribution

Secure identification and QKD in the bounded-quantum-storage model

Contact Info

Product

Resources

About