Abstract
We present a simple protocol for secure circuit evaluation. In its most basic formulation, the protocol enables two players C and D to cooperate in the computation of f(x) while D conceals her data x from C and C conceals his circuit for f from D.
Preview
Unable to display preview. Download preview PDF.
10. References
Martín Abadi, Joan Feigenbaum, and Joe Kilian. “On Hiding Information from an Oracle,” Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 19, 1987, 195–203.
Gilles Brassard and Claude Crépeau. “Nontransitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond,” Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 27, 1986, 188–195.
Gilles Brassard and Claude Crépeau. “Zero-knowledge Simulation of Boolean Circuits,” Advances in Cryptology — CRYPTO '86 Proceedings, Andrew Odlyzko (ed.), Springer-Verlag (pub.), 1987, 223–233.
David Chaum, Ivan Damgaard, and Jeroen van de Graaf. “Multiparty Computations Ensuring Secrecy of Each Party's Input and Correctness of the Output,” to appear in Proceedings of CRYPTO '87.
Zvi Galil, Stuart Haber, and Moti Yung. “Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model,” to appear in Proceedings of CRYPTO '87.
Shafi Goldwasser and Silvio Micali. “Probabilistic encryption,” JCSS, 28, 1984, 270–299.
Oded Goldreich, Silvio Micali, and Avi Wigderson. “Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design,” Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 27, 1986, 174–187.
Oded Goldreich, Silvio Micali, and Avi Wigderson. “How to Play ANY Mental Game,” Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 19, 1987, 218–229.
Oded Goldreich and Ronen Vainish. “How to Solve any Protocol Problem — An Efficiency Improvement,” to appear in Proceedings of CRYPTO '87.
Andrew C. Yao. “Protocols for Secure Computations,” Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 23, 1982, 160–164.
Andrew C. Yao. “How to Generate and Exchange Secrets,” Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 27, 1986, 162–167.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, M., Feigenbaum, J. (1988). A simple protocol for secure circuit evaluation. In: Cori, R., Wirsing, M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035850
Download citation
DOI: https://doi.org/10.1007/BFb0035850
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18834-6
Online ISBN: 978-3-540-48190-4
eBook Packages: Springer Book Archive