Fetching the paper…
Reading the bibliography…
In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad.
New hash functions and their use in authentication and set equality
Mark N. Wegman and Larry Carter · 1981
Earlier work this paper cites.
Universal hashing and authentication codes
Douglas R. Stinson · 1994
Earlier work this paper cites.
LFSR-based hashing and authentication
Hugo Krawczyk · 1994
Earlier work this paper cites.
On families of hash functions via geometric codes and concatenation
Jürgen Bierbrauer, Thomas Johansson, Gregory Kabatianskii, and Ben Smeets · 1994
Earlier work this paper cites.
New hash functions for message authentication
Hugo Krawczyk · 1995
Earlier work this paper cites.
On the connections between universal hashing, combinatorial designs and error-correcting codes
Douglas R. Stinson · 1995
Earlier work this paper cites.
Universal hashing and multiple authentication
Mustafa Atici and Douglas R. Stinson · 1996
Earlier work this paper cites.
On fast and provably secure message authentication based on universal hashing
Victor Shoup · 1996
Earlier work this paper cites.
Bucket hashing and its application to fast message authentication
Phillip Rogaway · 1999
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2000
Earlier work this paper cites.
Composition and integrity preservation of secure reactive systems
Birgit Pfitzmann and Michael Waidner · 2000
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
Earlier work this paper cites.
Indistinguishability of random systems
Ueli Maurer · 2002
Cited alongside, same era.
Universally composable signature, certification, and authentication
Ran Canetti · 2003
Cited alongside, same era.
A general composition theorem for secure reactive systems
Michael Backes, Birgit Pfitzmann, and Michael Waidner · 2004
Cited alongside, same era.
The reactive simulatability (RSIM) framework for asynchronous systems
Michael Backes, Birgit Pfitzmann, and Michael Waidner · 2004
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.
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
Later among the works it cites.
Composability in quantum cryptography
Jörn Müller-Quade and Renato Renner · 2009
Later among the works it cites.
Theoretical framework for quantum networks
Giulio Chiribella, Giacomo Mauro D’Ariano, and Paolo Perinotti · 2009
Later among the works it cites.
Universally composable quantum multi-party computation
Dominique Unruh · 2010
Later among the works it cites.
Abstract cryptography
Ueli Maurer and Renato Renner · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The universal composable security of quantum key distribution
Michael Ben-Or, Michael Horodecki, Debbie Leung, Dominic Mayers, and Jonathan Oppenheim · 2005
Cited alongside, same era.
Stronger security bounds for wegman-carter-shoup authenticators
Daniel J. Bernstein · 2005
Cited alongside, same era.
Universally composable security with global setup
Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish · 2006
Cited alongside, same era.
Indistinguishability amplification
Ueli Maurer, Krzysztof Pietrzak, and Renato Renner · 2007
Cited alongside, same era.
Toward a general theory of quantum games
Gus Gutoski and John Watrous · 2007
Cited alongside, same era.
Security aspects of the authentication used in quantum cryptography
Jörgen Cederlöf and Jan-Åke Larsson · 2008
Cited alongside, same era.
The universal composable security of quantum message authentication with key recycling
Patrick Hayden, Debbie Leung, and Dominic Mayers · 2011
Later among the works it cites.
Security of authentication with a fixed key in quantum key distribution
Aysajan Abidin and Jan-Åke Larsson · 2011
Later among the works it cites.
Constructive cryptography—a new paradigm for security definitions and proofs
Ueli Maurer · 2012
Closest in time.
Authentication amplification by synchronization
Ueli Maurer · 2013
Closest in time.
Cryptographic security of quantum key distribution
Christopher Portmann and Renato Renner · 2014
Closest in time.
Nino Walenta, Andreas Burg, Dario Caselunghe, Jeremy Constantin, Nicolas Gisin, Olivier Guinnard, Raphael Houlmann, Pascal Junod, Boris Korzh, Natalia Kulesza, Matthieu Legré, Charles Ci Wen Lim, Tommaso Lunghi, Laurent Monat, Christopher Portmann, Mathilde Soucarros, Patrick Trinkler, Gregory Trolliet, Fabien Vannel, and Hugo Zbinden · 2014
Closest in time.
Composable security of delegated quantum computation
Vedran Dunjko, Joseph Fitzsimons, Christopher Portmann, and Renato Renner · 2014
Closest in time.