Fetching the paper…
Reading the bibliography…
The question of whether a fully classical client can delegate a quantum computation to an untrusted quantum server while fully maintaining privacy (blindness) is one of the big open questions in quantum cryptography.
Quantum cryptography: Public key distribution and coin tossing
Charles H. Bennett and Gilles Brassard · 1984
Earlier work this paper cites.
On hiding information from an oracle
M. Abadi, J. Feigenbaum, and J. Kilian · 1989
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
Christopher A. Fuchs and Jeroen van de Graaf · 1999
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Universally composable security: A new paradigm for cryptographic protocols
R. 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.
On quantum detection and the square-root measurement
Yonina C. Eldar and G. David Forney Jr · 2001
Earlier work this paper cites.
General security definition and composability for quantum & classical protocols
Michael Ben-Or and Dominic Mayers · 2004
Earlier work this paper cites.
A general composition theorem for secure reactive systems
Michael Backes, Birgit Pfitzmann, and Michael Waidner · 2004
Earlier work this paper cites.
Simulatable security for quantum protocols
Dominique Unruh · 2004
Earlier work this paper cites.
On the existence of physical transformations between sets of quantum states
A Chefles, R Jozsa, and AJ Winter · 2004
Earlier work this paper cites.
Secure assisted quantum computation
Andrew M. Childs · 2005
Earlier work this paper cites.
Blind quantum computation
Pablo Arrighi and Louis Salvail · 2006
Earlier work this paper cites.
The reactive simulatability (RSIM) framework for asynchronous systems
Michael Backes, Birgit Pfitzmann, and Michael Waidner · 2007
Cited alongside, same era.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 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.
Bqp and the polynomial hierarchy
Scott Aaronson · 2010
Cited alongside, same era.
Abstract cryptography
Ueli Maurer and Renato Renner · 2011
Cited alongside, same era.
Unconditionally verifiable blind computation
Ideal protocols on the non-ideal physical world
V Dunjko · 2012
Later among the works it cites.
Classical command of quantum systems
Ben W. Reichardt, Falk Unger, and Umesh Vazirani · 2013
Later among the works it cites.
Optimal blind quantum computation
Atul Mantri, Carlos A. Pérez-Delgado, and Joseph F. Fitzsimons · 2013
Later among the works it cites.
Efficient universal blind computation
Vittorio Giovannetti, Lorenzo Maccone, Tomoyuki Morimae, and Terry G. Rudolph · 2013
Later among the works it cites.
Quantum one-time programs
Anne Broadbent, Gus Gutoski, and Douglas Stebila · 2013
Later among the works it cites.
Experimental verification of quantum computation
Stefanie Barz, Joseph F. Fitzsimons, Elham Kashefi, and Philip Walther · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Joseph Fitzsimons and Elham Kashefi · 2012
Cited alongside, same era.
Universal blind quantum computing with weak coherent pulses
Vedran Dunjko, Elham Kashefi, and Anthony Leverrier · 2012
Cited alongside, same era.
Continuous-variable blind quantum computation
Tomoyuki Morimae · 2012
Cited alongside, same era.
Blind topological measurement-based quantum computation
Tomoyuki Morimae and Keisuke Fujii · 2012
Cited alongside, same era.
Demonstration of blind quantum computing
Stefanie Barz, Elham Kashefi, Anne Broadbent, Joseph F. Fitzsimons, Anton Zeilinger, and Philip Walther · 2012
Cited alongside, same era.
Constructive cryptography—a new paradigm for security definitions and proofs
Ueli Maurer · 2012
Cited alongside, same era.
Tomoyuki Morimae · 2014
Later among the works it cites.
Composable security of delegated quantum computation
Vedran Dunjko, Joseph Fitzsimons, Christopher Portmann, and Renato Renner · 2014
Later among the works it cites.
Quantum computing on encrypted data
K. Fisher, A. Broadbent, L. K. Shalm, Z. Yan, J. Lavoie, R. Prevedel, T. Jennewein, and K. J. Resch · 2014
Later among the works it cites.
Ground state blind quantum computation on AKLT state
Tomoyuki Morimae, Vedran Dunjko, and Elham Kashefi · 2015
Later among the works it cites.
Iterated gate teleportation and blind quantum computation
Carlos A. Pérez-Delgado and Joseph F. Fitzsimons · 2015
Later among the works it cites.
Causal boxes: Quantum information-processing systems closed under composition
Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Björn Tackmann · 2015
Later among the works it cites.