Quantum one-time programs

Integrating the Data Encryption Standard into computer networks

Miles E. Smid · 1981

Earlier work this paper cites.

A single quantum cannot be cloned

William K. Wootters and Wojciech H. Zurek · 1982

Earlier work this paper cites.

Conjugate coding

Stephen Wiesner · 1983

Earlier work this paper cites.

Quantum cryptography: Public key distribution and coin tossing

Charles H. Bennett and Gilles Brassard · 1984

Earlier work this paper cites.

Programmable quantum gate arrays

Michael A. Nielsen and Isaac L. Chuang · 1997

Earlier work this paper cites.

Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations

Daniel Gottesman and Issac Chuang · 1999

Earlier work this paper cites.

On universal and fault-tolerant quantum computing

P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani Roychowdhury, and Farrokh Vatan · 2000

Earlier work this paper cites.

Simple proof of security of the BB84 quantum key distribution protocol

Peter Shor and John Preskill · 2000

Earlier work this paper cites.

On the (im)possibility of obfuscating programs

Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, and Ke Yang · 2001

Earlier work this paper cites.

Universally composable security: a new paradigm for cryptographic protocols

Ran Canetti · 2001

Earlier work this paper cites.

A model for asynchronous reactive systems and its application to secure message transmission

Birgit Pfitzmann and Michael Waidner · 2001

Cited alongside, same era.

Authentication of quantum messages

Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, and Alain Tapp · 2002

Cited alongside, same era.

General security definition and composability for quantum & classical protocols

Michael Ben Or and Dominic Mayers · 2004

Cited alongside, same era.

Simulatable security for quantum protocols

Dominique Unruh · 2004

Cited alongside, same era.

Secure multiparty quantum computation with (only) a strict honest majority

Original

Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith · 2006

Cited alongside, same era.

The Solovay–Kitaev algorithm

Christopher Dawson and Michael Nielsen · 2006

Exact and approximate unitary 2-designs and their application to fidelity estimation

Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009

Later among the works it cites.

Interactive proofs for quantum computations

Original

Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010

Later among the works it cites.

Efficient universal quantum circuits

Original

Debajyoti Bera, Stephen Fenner, Frederic Green, and Steve Homer · 2010

Later among the works it cites.

Founding cryptography on tamper-proof hardware tokens

Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, and Akshay Wadia · 2010

Later among the works it cites.

Quantum coins

Original

Michele Mosca and Douglas Stebila · 2010

Later among the works it cites.