Fetching the paper…
Reading the bibliography…
The Universal Composability model (UC) by Canetti (FOCS 2001) allows for secure composition of arbitrary protocols.
Conjugate coding
Stephen Wiesner · 1970
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.
Founding cryptography on oblivious transfer
Joe Kilian · 1988
Earlier work this paper cites.
Practical quantum oblivious transfer
Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Marie-Hélène Skubiszewska · 1991
Earlier work this paper cites.
A quantum bit commitment scheme provably unbreakable by both parties
G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois · 1993
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W. Shor · 1994
Earlier work this paper cites.
Security of quantum protocols against coherent measurements
Andrew Chi-Chih Yao · 1995
Earlier work this paper cites.
Unconditionally Secure Quantum Bit Commitment is Impossible
D. Mayers · 1997
Earlier work this paper cites.
Towards a formal definition of security for quantum protocols
Jeroen van de Graaf · 1998
Earlier work this paper cites.
Unconditionally secure bit commitment
Adrian Kent · 1999
Earlier work this paper cites.
Security and composition of multi-party cryptographic protocols
Ran Canetti · 2000
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
Universally composable security: A new paradigm for cryptographic protocols
Ran Canetti · 2001
Cited alongside, same era.
Universally composable commitments
Ran Canetti and Marc Fischlin · 2001
Cited alongside, same era.
A model for asynchronous reactive systems and its application to secure message transmission
Birgit Pfitzmann and Michael Waidner · 2001
Cited alongside, same era.
A paradox of quantum universal composability
Dennis Hofheinz and Jörn Müller-Quade · 2003
Cited alongside, same era.
Comparing two notions of simulatability
Dennis Hofheinz and Dominique Unruh · 2005
Later among the works it cites.
Simulatable security and polynomially bounded concurrent composition
Dennis Hofheinz and Dominique Unruh · 2006
Later among the works it cites.
Protokollkomposition und Komplexität
Dominique Unruh · 2006
Later among the works it cites.
Zero-knowledge against quantum attacks
John Watrous · 2006
Later among the works it cites.
http://eprint.iacr.org/2006/422 , January 2007
Jörn Müller-Quade and Dominique Unruh · 2007
Later among the works it cites.
Long-term security and universal composability
Jörn Müller-Quade and Dominique Unruh · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
General composition and universal composability in secure multi-party computation
Yehuda Lindell · 2003
Cited alongside, same era.
General security definition and composability for quantum & classical protocols, September 2004
M. Ben-Or and D. Mayers · 2004
Cited alongside, same era.
Simulatable security for quantum protocols, September 2004
Dominique Unruh · 2004
Cited alongside, same era.
The universal composable security of quantum key distribution
Michael Ben-Or, Michal Horodecki, Debbie W. Leung, Dominic Mayers, and Jonathan Oppenheim · 2005
Cited alongside, same era.
Cryptography in the bounded quantum-storage model
Ivan Damgård, Serge Fehr, Louis Salvail, and Christian Schaffner · 2005
Cited alongside, same era.
Yuval Ishai, Manoj Prabhakaran, and Amit Sahai · 2008
Later among the works it cites.
Composable security in the bounded-quantum-storage model
Stephanie Wehner and Jörg Wullschleger · 2008
Later among the works it cites.
Improving the security of quantum protocols
Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner · 2009
Closest in time.
Improving the security of quantum protocols, 2009
Ivan Damgård, Serge Fehr, Carolin Lunemann, Louis Salvail, and Christian Schaffner · 2009
Closest in time.
Composing quantum protocols in a classical environment
Serge Fehr and Christian Schaffner · 2009
Closest in time.