Advertisement

A simple protocol for secure circuit evaluation

Extended abstract
  • Martín Abadi
  • Joan Feigenbaum
Contributed Papers Distributed Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)

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.

Unable to display preview. Download preview PDF.

10. References

  1. [AFK]
    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. [BC1]
    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. [BC2]
    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. [CDvdG]
    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. [GHY]
    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. [GM]
    Shafi Goldwasser and Silvio Micali. “Probabilistic encryption,” JCSS, 28, 1984, 270–299.Google Scholar
  7. [GMW86]
    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. [GMW87]
    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. [GV]
    Oded Goldreich and Ronen Vainish. “How to Solve any Protocol Problem — An Efficiency Improvement,” to appear in Proceedings of CRYPTO '87.Google Scholar
  10. [Y82]
    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. [Y86]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Martín Abadi
    • 1
  • Joan Feigenbaum
    • 2
  1. 1.DEC Systems Research CenterPalo Alto
  2. 2.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations