Skip to main content

A simple protocol for secure circuit evaluation

Extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 88 (STACS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 294))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

10. References

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Shafi Goldwasser and Silvio Micali. “Probabilistic encryption,” JCSS, 28, 1984, 270–299.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. Oded Goldreich and Ronen Vainish. “How to Solve any Protocol Problem — An Efficiency Improvement,” to appear in Proceedings of CRYPTO '87.

    Google Scholar 

  10. Andrew C. Yao. “Protocols for Secure Computations,” Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, 23, 1982, 160–164.

    Google Scholar 

  11. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Robert Cori Martin Wirsing

Rights and permissions

Reprints 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

Publish with us

Policies and ethics