Fetching the paper…
Reading the bibliography…
We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle part of the key if tampering is detected.
Communication theory of secrecy systems
Claude Shannon · 1949
Earlier work this paper cites.
New hash functions and their use in authentication and set equality
Mark N. Wegman and Larry Carter · 1981
Earlier work this paper cites.
Quantum cryptography II: How to re-use a one-time pad safely even if P=NP
Charles H. Bennett, Gilles Brassard, and Seth Breidbart · 1982
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.
Authentication theory/coding theory
Gustavus J. Simmons · 1985
Earlier work this paper cites.
A survey of information authentication
Gustavus J. Simmons · 1988
Earlier work this paper cites.
The combinatorics of authentication and secrecy codes
Douglas R. Stinson · 1990
Earlier work this paper cites.
Universal hashing and authentication codes
Douglas R. Stinson · 1994
Earlier work this paper cites.
Generalized privacy amplification
Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer · 1995
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2000
Earlier work this paper cites.
Simple proof of security of the BB84 quantum key distribution protocol
Peter W. Shor and John Preskill · 2000
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2001
Earlier work this paper cites.
Authentication of quantum messages
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith, and Alain Tapp · 2002
Earlier work this paper cites.
Uncloneable encryption
Daniel Gottesman · 2003
Earlier work this paper cites.
Unconditionally secure key distribution in higher dimensions by depolarization
Hoi Fung Chau · 2005
Earlier work this paper cites.
Efficient simulation of random quantum states and operators
Christoph Dankert · 2005
Earlier work this paper cites.
A quantum cipher with near optimal key-recycling
Ivan Damgård, Thomas Brochmann Pedersen, and Louis Salvail · 2005
Cited alongside, same era.
How to reuse a one-time pad and other notes on authentication, encryption, and protection of quantum information
Jonathan Oppenheim and Michał Horodecki · 2005
Cited alongside, same era.
Security of Quantum Key Distribution
Renato Renner · 2005
Cited alongside, same era.
Universally composable privacy amplification against quantum adversaries
Renato Renner and Robert König · 2005
Cited alongside, same era.
Secure multiparty quantum computation with (only) a strict honest majority
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, and Adam Smith · 2006
Cited alongside, same era.
Evenly distributed unitaries: on the structure of unitary designs
On a measure of distance for quantum strategies
Gus Gutoski · 2012
Later among the works it cites.
Constructive cryptography—a new paradigm for security definitions and proofs
Ueli Maurer · 2012
Later among the works it cites.
Anne Broadbent, Gus Gutoski, and Douglas Stebila · 2013
Later among the works it cites.
How to re-use a one-time pad safely and almost optimally even if P = NP
Ivan Damgård, Thomas Brochmann Pedersen, and Louis Salvail · 2014
Later among the works it cites.
Quantum theory with bold operator tensors
Lucien Hardy · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David Gross, Koenraad Audenaert, and Jens Eisert · 2007
Cited alongside, same era.
Toward a general theory of quantum games
Gus Gutoski and John Watrous · 2007
Cited alongside, same era.
Theoretical framework for quantum networks
Giulio Chiribella, Giacomo Mauro D’Ariano, and Paolo Perinotti · 2009
Cited alongside, same era.
Exact and approximate unitary 2-designs and their application to fidelity estimation
Christoph Dankert, Richard Cleve, Joseph Emerson, and Etera Livine · 2009
Cited alongside, same era.
The security of practical quantum key distribution
Valerio Scarani, Helle Bechmann-Pasquinucci, Nicolas J. Cerf, Miloslav Dušek, Norbert Lütkenhaus, and Momtchil Peev · 2009
Cited alongside, same era.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Cited alongside, same era.
Universally composable quantum multi-party computation
Dominique Unruh · 2010
Cited alongside, same era.
Christopher Portmann · 2014
Later among the works it cites.
Cryptographic security of quantum key distribution
Christopher Portmann and Renato Renner · 2014
Later among the works it cites.
The Clifford group forms a unitary 3-design
Zak Webb · 2015
Later among the works it cites.
Multiqubit Clifford groups are unitary 3-designs
Huangjun Zhu · 2015
Later among the works it cites.
Quantum non-malleability and authentication
Gorjan Alagic and Christian Majenz · 2016
Closest in time.
Efficient simulation for quantum message authentication
Anne Broadbent and Evelyn Wainewright · 2016
Closest in time.
New security notions and feasibility results for authentication of quantum data
Sumegha Garg, Henry Yuen, and Mark Zhandry · 2016
Closest in time.
From indifferentiability to constructive cryptography (and back)
Ueli Maurer and Renato Renner · 2016
Closest in time.
Quantum authentication and encryption with key recycling
Serge Fehr and Louis Salvail · 2017
Closest in time.
Causal boxes: Quantum information-processing systems closed under composition
Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Björn Tackmann · 2017
Closest in time.
Reformulating and reconstructing quantum theory
Lucien Hardy · 2066
Closest in time.