The Impossibility Of Secure Two-Party Classical Computation

@article{Colbeck2007TheIO,
  title={The Impossibility Of Secure Two-Party Classical Computation},
  author={Roger Colbeck},
  journal={CoRR},
  year={2007},
  volume={abs/0708.2843}
}
Consider two parties wishing to compute some joint function of their data (two millionaires might wish to know who is richer, for example). A secure computation of such a function is one for which the only information the first party gets on the input of the second is that implied by the outcome of the computation, and vice versa. In this work, we focus on unconditional security, whereby we seek to construct a protocol whereby the two mistrustful parties can communicate in order to achieve the… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
10 Extracted Citations
17 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 17 references

and M

  • M. Backes, B. Pfitzmann
  • Waidner, in TCC
  • 2004
Highly Influential
4 Excerpts

Quantum Detection and Estimation Theory

  • C. W. Helstrom
  • 1976
Highly Influential
4 Excerpts

Promising the impossible: Classical certification in a quantum world

  • A. Kent
  • e-print quant-ph/0409029
  • 2004
Highly Influential
3 Excerpts

Physical Review A 56

  • H.-K. Lo
  • 1154
  • 1997
Highly Influential
3 Excerpts

in Proceedings of the First Theory of Cryptography Conference (TCC04)

  • Y. Z. Ding, D. Harnik, A. Rosen, R. Shaltiel
  • edited by M. Naor
  • 2004
2 Excerpts

Finding optimal strategies for minimum-error quantum-state discrimination

  • M. Ježek, J. Řeháček, J. Fiurášek
  • e-print quant-ph/0201109
  • 2002
2 Excerpts

and A

  • C. Crépeau, D. Gottesman
  • Smith, in Proceedings of the 34th annual ACM…
  • 2002
2 Excerpts

Similar Papers

Loading similar papers…