Abstract
We present a simple protocol for two-playersecure circuit evaluation. The protocol enables players C and D to cooperate in the computation off(x) while D conceals her datax from C and C conceals his circuit forf from D. The protocol is based on the technique ofhiding information from an oracle [AFK].
Article PDF
Similar content being viewed by others
References
Martín Abadi and Joan Feigenbaum. A Simple Protocol for Secure Circuit Evaluation,STACS '88Proceedings, R. Cori and M. Wirsing (eds.), Springer-Verlag, New York, 1988, pp. 264–272.
Martín Abadi, Joan Feigenbaum, and Joe Kilian. On Hiding Information from an Oracle,J. Comput. System Sci.,39 (1989), 21–50.
Donald Beaver and Joan Feigenbaum. Hiding Instances in Multioracle Queries,STACS '90Proceedings, C. Choffrut and T. Lengauer (eds.), Springer-Verlag, New York, to appear.
Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation,Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 1–10.
Gilles Brassard, David Chaum, and Claude Crépeau. Minimum Disclosure Proofs of Knowledge,J. Comput. System Sci.,37 (1988), 156–189.
Gilles Brassard and Claude Crépeau. Zero-knowledge Simulation of Boolean Circuits,CRYPTO '86Proceedings, Andrew Odlyzko (ed.), Springer-Verlag, New York, 1987, pp. 223–233.
David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty Unconditionally Secure Protocols,Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 11–19.
David Chaum, Ivan Damgård, and Jeroen van de Graaf. Multiparty Computations Ensuring Secrecy of Each Party's Input and Correctness of the Output,CRYPTO '87Proceedings, Carl Pomerance (ed.), Springer-Verlag, New York, 1988, pp. 87–119.
Zvi Galil, Stuart Haber, and Moti Yung. Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model,CRYPTO '87Proceedings, Carl Pomerance (ed.), Springer-Verlag, New York, 1988, pp. 135–155.
Zvi Galil, Stuart Haber, and Moti Yung. Minimum-Knowledge Interactive Proofs for Decision Problems,SIAM J. Comput.,18 (1989), 711–739.
Oded Goldreich, Silvio Micali, and Avi Wigderson. How to Play ANY Mental GameProceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 218–229.
Shafi Goldwasser and Silvio Micali. Probabilistic Encryption,J. Comput. System Sci.,28 (1984), 270–299.
Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The Knowledge Complexity of Interactive Proof Systems,SIAM J. Comput.,18 (1989), 186–208.
Stuart Haber. Multi-Party Cryptographic Computation: Techniques and Applications, Ph.D. Thesis, Computer Science Department, Columbia University, 1988.
Joe Kilian. Founding Cryptography on Oblivious Transfer,Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 20–31.
Andrew C. Yao. Theory and Applications of Trapdoor Functions,Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 80–91.
Andrew C. Yao. Protocols for Secure Computations,Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 160–164.
Andrew C. Yao. How to Generate and Exchange Secrets,Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, 1986, pp. 162–167.
Author information
Authors and Affiliations
Additional information
An extended abstract of this paper appeared in theProceedings of the Fifth Annual Symposium on Theoretical Aspects of Computer Science [AF].
Rights and permissions
About this article
Cite this article
Abadi, M., Feigenbaum, J. Secure circuit evaluation. J. Cryptology 2, 1–12 (1990). https://doi.org/10.1007/BF02252866
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02252866