Fetching the paper…
Reading the bibliography…
Quantum computing has seen tremendous progress in the past years.
Hoi-Kwong Lo and H. F. Chau. “Is quantum bit commitment really possible?”. Physical Review Letters, 78(17):3410–3413, 1997
1997
Earlier work this paper cites.
Dominic Mayers. “Unconditionally secure quantum bit commitment is impossible”. Physical Review Letters, 78(17):3414–3417, 1997
1997
Earlier work this paper cites.
Hoi-Kwong Lo. “Insecurity of quantum secure computations”. Physical Review A, 56(2):1154–1162, 1997
1997
Earlier work this paper cites.
Robert Raussendorf and Hans J. Briegel, “A One-Way Quantum Computer”. Phys. Rev. Lett. 86, 5188, 2001
2001
Earlier work this paper cites.
Michael Ben-Or, Claude Crépeau, Daniel Gottesman, Avinatan Hassidim, Adam Smith, “Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority”. In Proceedings of FOCS 2006, pp. 249-260, IEEE Press
2006
Earlier work this paper cites.
Vincent Danos and Elham Kashefi, “Determinism in the one-way model”. Phys. Rev. A 74, 052310, 2006
2006
Earlier work this paper cites.
Robert Koenig, Renato Renner, Andor Bariska, Ueli Maurer “Locking of accessible information and implications for the security of quantum cryptography”. Phys. Rev. Lett. 98, 140502 (2007)
2007
Earlier work this paper cites.
Yuval Ishai, Manoj Prabhakaran, and Amit Sahai, “Founding cryptography on oblivious transfer – efficiently”. In Proc. of CRYPTO 2008, Springer, pp. 572–591
2008
Cited alongside, same era.
Louis Salvail, Christian Schaffner, Miroslava Sotakova, “On the Power of Two-Party Quantum Cryptography”. In Proceedings of ASIACRYPT 2009, LNCS 5912, pages 70–87
2009
Cited alongside, same era.
Anne Broadbent, Joseph Fitzsimons, Elham Kashefi, “ Universal blind quantum computation”. In Proceedings of FOCS 2009, pp. 517-526
2009
Cited alongside, same era.
Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail, “Secure two-party quantum evaluation of unitaries against specious adversaries”. In Proceedings of CRYPTO 2010, LNCS 6223, pages 685–706
2010
Cited alongside, same era.
Dominique Unruh, “Universally Composable Quantum Multiparty Computation”, In Proc. of EUROCRYPT 2010, Springer, vol 6110, pp. 486–505
Frédéric Dupuis, Jesper Buus Nielsen and Louis Salvail, “Actively Secure Two-Party Evaluation of any Quantum Operation”. In Proc. of CRYPTO 2012, Springer Verlag, pp. 794–811
2012
Later among the works it cites.
Vedran Dunjko, Elham Kashefi, Anthony Leverrier, “Universal Blind Quantum Computing with Weak Coherent Pulses”. Phys. Rev. Lett. 108, 200502 (2012)
2012
Later among the works it cites.
Tomoyuki Morimae, Keisuke Fujii, “Blind quantum computation protocol in which Alice only makes measurements”. Phys. Rev. A 87, 050301(R) (2013)
2013
Later among the works it cites.
Anne Broadbent, Stacey Jeffery,“Quantum homomorphic encryption for circuits of low T-gate complexity”. In Proc. of CRYPTO 2015, Springer, pp. 609–629
2015
Later among the works it cites.
Elham Kashefi, Petros Wallden, “Garbled Quantum Computation”. arXiv:1606.06931 [quant-ph] (2016)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
Ueli Maurer and Renato Renner, “Abstract cryptography”. In Innovations in Computer Science, 2011, Tsinghua University Press
2011
Cited alongside, same era.
Cited in the paper.
Cited in the paper.
Vedran Dunjko, Joseph F. Fitzsimons, Christopher Portmann, Renato Renner, “Composable security of delegated quantum computation”. In Proceedings of ASIACRYPT2014, pp 406-425
Cited in the paper.
Ran Canetti, “Universally composable security: A new paradigm for cryptographic protocols”. In Proceedings of FOCS2001, pages 136–147
Cited in the paper.
2016
Closest in time.