Quantum cryptography beyond quantum key distribution

Broadbent, Anne; Schaffner, Christian

doi:10.1007/s10623-015-0157-4

Cited by 168 publications

(110 citation statements)

References 236 publications

(337 reference statements)

Supporting

Mentioning

109

Contrasting

Unclassified

Order By: Relevance

“…The relations in this game are defined by the matchings: given a matching, the correct answers are the ones which correctly identify the parity of the bits connected by an edge in the matching. For example, if (1,2) is an element of the matching, the measurement should output x 1 ⊕ x 2 . Formally, given a perfect matching M 1 , the set of answers is given by…”

Section: A Definitions and Previous Resultsmentioning

confidence: 99%

Quantum money with nearly optimal error tolerance

Amiri

Arrazola

2017

Phys. Rev. A

View full text Add to dashboard Cite

We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which we conjecture reaches 25% asymptotically as the dimension of the underlying hidden matching states is increased. Furthermore, we prove that 25% is the maximum tolerable noise for a wide class of quantum money schemes with classical verification, meaning our schemes are almost optimally noise tolerant. We use methods in semidefinite programming to prove security in a substantially different manner to previous proposals, leading to two main advantages: first, coin verification involves only a constant number of states (with respect to coin size), thereby allowing for smaller coins; second, the re-usability of coins within our scheme grows linearly with the size of the coin, which is known to be optimal. Lastly, we suggest methods by which the coins in our protocol could be implemented using weak coherent states and verified using existing experimental techniques, even in the presence of detector inefficiencies.

show abstract

Section: A Definitions and Previous Resultsmentioning

confidence: 99%

Quantum money with nearly optimal error tolerance

Amiri

Arrazola

2017

Phys. Rev. A

View full text Add to dashboard Cite

show abstract

“…ces progrès s'étendront sur une riche gamme d'applications au-delà de la distribution de clés, permettant d'utiliser l'avantage obtenu en exploitant des ressources quantiques pour des tâches complexes et variées [9]. Des travaux de recherche partout device independent).…”

Section: Les Défis De Performance Et De Sécurité Pratiqueunclassified

Progrés et défis pour la cryptographie quantique

Diamanti

2018

Photoniques

View full text Add to dashboard Cite

show abstract

“…Deriving new quantum cryptographic protocols for functionalities beyond the secure key exchange [26] is an active field of research (see a recent review for a summary [27]). In particular, our contributions are directly linked to the works on verifiable blind quantum computing (VUBQC) [4,5,10], secure two-party quantum computing [18,21] and quantum one-time program and quantum obfuscation [6,28].…”

Section: Related Workmentioning

confidence: 99%

Garbled Quantum Computation

Kashefi

Wallden

2017

Cryptography

View full text Add to dashboard Cite

Abstract:The universal blind quantum computation protocol (UBQC) enables an almost classical client to delegate a quantum computation to an untrusted quantum server (in the form of a garbled quantum circuit) while the security for the client is unconditional. In this contribution, we explore the possibility of extending the verifiable UBQC, to achieve further functionalities following the analogous research for classical circuits (Yao 1986). First, exploring the asymmetric nature of UBQC (the client preparing only single qubits, while the server runs the entire quantum computation), we present a "Yao"-type protocol for secure two-party quantum computation. Similar to the classical setting, our quantum Yao protocol is secure against a specious (quantum honest-but-curious) garbler, but in our case, against a (fully) malicious evaluator. Unlike the previous work on quantum two-party computation of Dupuis et al., 2010, we do not require any online-quantum communication between the garbler and the evaluator and, thus, no extra cryptographic primitive. This feature will allow us to construct a simple universal one-time compiler for any quantum computation using one-time memory, in a similar way to the classical work of Goldwasser et al., 2008, while more efficiently than the previous work of Broadbent et al., 2013.

show abstract

Quantum cryptography beyond quantum key distribution

Cited by 168 publications

References 236 publications

Quantum money with nearly optimal error tolerance

Quantum money with nearly optimal error tolerance

Progrés et défis pour la cryptographie quantique

Garbled Quantum Computation

Contact Info

Product

Resources

About