Fetching the paper…
Reading the bibliography…
The universal blind quantum computation protocol (UBQC) (Broadbent, Fitzsimons, Kashefi 2009) enables an almost classical client to delegate a quantum computation to an untrusted quantum server (in form of a garbled quantum computation) while the security for the client is unconditional.
How to generate and exchange secrets
Andrew Yao · 1986
Earlier work this paper cites.
Quantum cryptography
Charles Bennett, Gilles Brassard, and Artur Ekert · 1992
Earlier work this paper cites.
Unconditionally secure bit commitment
Adrian Kent · 1999
Earlier work this paper cites.
Oblivious transfer and polynomial evaluation
Moni Naor and Benny Pinkas · 1999
Earlier work this paper cites.
A one-way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
Earlier work this paper cites.
Multiparty entanglement in graph states
Marc Hein, Jens Eisert, and Hans J Briegel · 2004
Earlier work this paper cites.
Secure assisted quantum computation
A. Childs · 2005
Earlier work this paper cites.
Unified derivations of measurement-based schemes for quantum computation
Andrew M Childs, Debbie W Leung, and Michael A Nielsen · 2005
Earlier work this paper cites.
Blind quantum computation
P. Arrighi and L. Salvail · 2006
Earlier work this paper cites.
Determinism in the one-way model
Vincent Danos and Elham Kashefi · 2006
Earlier work this paper cites.
The measurement calculus
Vincent Danos, Elham Kashefi, and Prakash Panangaden · 2007
Earlier work this paper cites.
Generalized flow and determinism in measurement-based quantum computation
Daniel E Browne, Elham Kashefi, Mehdi Mhalla, and Simon Perdrix · 2007
Earlier work this paper cites.
One-time programs
Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum · 2008
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi · 2009
Cited alongside, same era.
Secure two-party quantum evaluation of unitaries against specious adversaries
Frédéric Dupuis, Jesper Buus Nielsen, and Louis Salvail · 2010
Cited alongside, same era.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, and Elad Eban · 2010
Cited alongside, same era.
Non-interactive verifiable computing: Outsourcing computation to untrusted workers
Rosario Gennaro, Craig Gentry, and Bryan Parno · 2010
Cited alongside, same era.
Abstract cryptography
Ueli Maurer and Renato Renner · 2011
Cited alongside, same era.
Unconditionally verifiable blind computation, 2012
Joseph F. Fitzsimons and Elham Kashefi · 2012
Composable security of delegated quantum computation
Vedran Dunjko, Joseph F. Fitzsimons, Christopher Portmann, and Renato Renner · 2014
Later among the works it cites.
Robustness and device independence of verifiable blind quantum computing
Alexandru Gheorghiu, Elham Kashefi, and Petros Wallden · 2015
Later among the works it cites.
On optimising quantum communication in verifiable quantum computing, 2015
Theodoros Kapourniotis, Vedran Dunjko, and Elham Kashefi · 2015
Later among the works it cites.
How to verify a quantum computation
Anne Broadbent · 2015
Later among the works it cites.
How to verify a quantum computation
Anne Broadbent · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Demonstration of blind quantum computing
S. Barz, E. Kashefi, A. Broadbent, J. F. Fitzsimons, A. Zeilinger, and P. Walther · 2012
Cited alongside, same era.
Actively secure two-party evaluation of any quantum operation
Frédéric Dupuis, Jesper Buus Nielsen, and Louis Salvail · 2012
Cited alongside, same era.
Quantum one-time programs
Anne Broadbent, Gus Gutoski, and Douglas Stebila · 2013
Cited alongside, same era.
Classical command of quantum systems
Ben W. Reichardt, Reichardt Falk Unger, and Umesh Vazirani · 2013
Cited alongside, same era.
Interactive proofs for bqp via self-tested graph states
McKague · 2013
Cited alongside, same era.
Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links
Naomi H Nickerson, Joseph F Fitzsimons, and Simon C Benjamin · 2014
Cited alongside, same era.
Masahito Hayashi and Tomoyuki Morimae · 2015
Later among the works it cites.
Blind quantum computing with two almost identical states
Vedran Dunjko and Elham Kashefi · 2016
Closest in time.
Quantum cryptography beyond quantum key distribution
Anne Broadbent and Christian Schaffner · 2016
Closest in time.
Gorjan Alagic and Bill Fefferman · 2016
Closest in time.
Quantum homomorphic encryption for polynomial-sized circuits
Yfke Dulek, Christian Schaffner, and Florian Speelman · 2016
Closest in time.
Blind multiparty quantum computing
Elham Kashefi and Anna Pappa · 2016
Closest in time.
Optimised resource construction for verifiable quantum computation
Elham Kashefi and Petros Wallden · 2017
Closest in time.
Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
Alexandru Gheorghiu, Petros Wallden, and Elham Kashefi · 2017
Closest in time.