Fetching the paper…
Reading the bibliography…
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the sole assumption that some number of them will follow the protocol honestly.
O. Goldreich, S. Micali and A. Wigderson, “How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority,” In
1987
Earlier work this paper cites.
M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness Theorems for Non Cryptographic Fault-Tolerent Distributed Computation,” In
1988
Earlier work this paper cites.
D. Chaum, C. Crépeau and I. Damgård, “Multiparty Unconditionally Secure protocols,” In
1988
Earlier work this paper cites.
T. Rabin and M. Ben-Or, “Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract),” In
1989
Earlier work this paper cites.
B. Awerbuch, B. Chor, S. Goldwasser and S. Micali, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,” In
1990
Earlier work this paper cites.
D. Dolev, C. Dwork, O. Waarts and M. Yung, “Perfectly Secure Message Transmission,” In
1990
Earlier work this paper cites.
T. Rabin, “Robust Sharing of Secrets when the Dealer is Honest or Cheating,”
1994
Earlier work this paper cites.
P. W. Shor, “Fault-tolerant quantum computation,” In
1996
Cited alongside, same era.
S. Goldwasser, “Multi-Party Computations: Past and Present,” in
1997
Cited alongside, same era.
R. Cleve, D. Gottesman, and H.K. Lo, “How to share a quantum secret,”
1999
Cited alongside, same era.
M. Nielsen and I. Chuang,
2000
Cited alongside, same era.
Ran Canetti, “Universally Composable Security: A New Paradigm for Cryptographic Protocols,” In
2001
Cited alongside, same era.
Howard Barnum, Claude Crépeau, Daniel Gottesman, Adam Smith and Alain Tapp, “Authentication of Quantum Messages,” In
2002
Cited alongside, same era.
S. Bravyi, and A. Kitaev , “Universal Quantum Computation Based on a Magic States Distillation,” quant-ph/0403025, 2004
2004
Later among the works it cites.
M. Ben-Or, and D. Mayers , “General Security Definition and Composability for Quantum and Classical Protocols,” quant-ph/0409062, 2004
2004
Later among the works it cites.
A. M. Childs, “Secure assisted quantum computation,”
2005
Later among the works it cites.
C. Crépeau, D. Gottesman and A. Smith, “Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes”, In
2005
Later among the works it cites.
R. Köenig and R. Renner , “A de Finetti Representation for Finite Symmetric Quantum States,” In
2005
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Crépeau, D. Gottesman and A. Smith, “Secure Multi-party Quantum Computing,” In
2002
Cited alongside, same era.
D. Aharonov and M. Ben-Or, “Fault tolerant quantum computation with constant error rate,” quant-ph/9906129. Preliminary version in
Cited in the paper.
R. Cleve, “Limits on the Security of Coin Flips when Half the Processors Are Faulty,” In
Cited in the paper.
P. Hayden, D. Leung, D. Mayers, “Universal Composability for Quantum Authentication,” unpublished
Cited in the paper.
2006
Later among the works it cites.
E. Kushilevitz, Y. Lindell and T. Rabin. “Information-Theoretically Secure Protocols and Security Under Composition,” In
2006
Later among the works it cites.