14 citations · 24 across the 3 of their papers we have counts for
6 papers
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
Claude Crepeau, Daniel Gottesman, Adam Smith
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding a…
Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption
Andris Ambainis, Adam Smith
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s…
Secure Multi-party Quantum Computing
Claude Crepeau, Daniel Gottesman, Adam Smith
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computatio…
Extracting Quantum Entanglement (General Entanglement Purification Protocols)
Andris Ambainis, Ke Yang
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state which is ``reasonably close'' to perfect EPR pairs. The only…
Quantum secret sharing for general access structures
Adam D. Smith
We explore the conversion of classical secret-sharing schemes to quantum ones, and how this can be used to give efficient QSS schemes for general adversary structures. Our first re…
Multiparty computation unconditionally secure against Q^2 adversary structures
Adam Smith, Anton Stiglic
We present here a generalization of the work done by Rabin and Ben-Or. We give a protocol for multiparty computation which tolerates any Q^2 active adversary structure based on the…