(Enter summary)
Abstract: : We present a simple protocol for two-player secure circuit evaluation. The protocol
enables 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. The protocol is based on the technique
of hiding information from an oracle [Abadi, Feigenbaum, Kilian, J. Comput. System
Sci. 39(1):21--50, August, 1989].
1. Introduction
This paper describes a protocol for two-player secure circuit evaluation. We think of
player C as a... (Update)
Context of citations to this paper: More
.... encryption This is the ability to compute with encrypted data such that the computations are also meaningful to the unencrypted data [Aba90]. It is difficult if not impossible to find crypto systems that have specific properties. Further, more, homomorphic encryption can be...
...to execute mobile code in an encrypted form on an untrusted host. However, most such protocols for so called secure computation [GMW87, AF90] require several rounds of interaction and are therefore not applicable in our context. Sander and Tschudin concluded that only...
Cited by: More
Homomorphic Cryptosystems and their - Dissertation Zur Erlangung (2006)
(Correct)
Implementing Secure Distributed Computing with Mobile.. - Neven, Van Hoeymissen, .. (2000)
(Correct)
Efficient Private Bidding and Auctions with an Oblivious Third.. - Cachin (1999)
(Correct)
Active bibliography (related documents): More All
0.7: On Hiding Information from an Oracle - Abadi, Feigenbaum, Kilian (1989)
(Correct)
0.5: A Sanctuary for Mobile Agents - Yee (1997)
(Correct)
0.1: Complexity and Security of Distributed Protocols - Franklin (1993)
(Correct)
Similar documents based on text: More All
0.2: On the Power of Two-Local Random Reductions - Fortnow, Szegedy (1992)
(Correct)
0.2: Lower Bounds on Random-Self-Reducibility (Extended Abstract) - Feigenbaum, al. (1990)
(Correct)
0.2: On Coherence, Random-Self-Reducibility, and.. - Feigenbaum, Fortnow.. (1998)
(Correct)
Related documents from co-citation: More All
10: A randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
9: How to Generate and Exchange Secrets (context) - Yao
9: Multiparty computations ensuring privacy of each party's input and correctness o.. (context) - Chaum, Damgaard et al. - 1988
BibTeX entry: (Update)
M. Abadi and J. Feigenbaum. Secure circuit evaluation: a protocol based on hiding information from an oracle. J. of Cryptology, 3(2):1--12, 1990. http://citeseer.ist.psu.edu/abadi90secure.html More
@article{ abadi90secure,
author = "Mart{\'\i}n Abadi and Joan Feigenbaum",
title = "Secure Circuit Evaluation: {A} Protocol Based on Hiding Information from an Oracle",
journal = "Journal of Cryptology",
volume = "2",
number = "1",
pages = "1--12",
year = "1990",
url = "citeseer.ist.psu.edu/abadi90secure.html" }
Citations (may not include all citations):
531
The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
339
Theory and Applications of Trapdoor Functions (context) - Yao - 1982
287
Multiparty Unconditionally Secure Protocols (context) - Chaum, Cr'epeau et al. - 1988
278
Probabilistic Encryption (context) - Goldwasser, Micali - 1984
250
How to Play ANY Mental Game (context) - Goldreich, Micali et al. - 1987
219
Completeness Theorems for Non-Cryptographic Fault-Tolerant D.. (context) - Ben-Or, Goldwasser et al. - 1988
196
Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al. - 1988
185
How to Generate and Exchange Secrets (context) - Yao - 1986
167
Protocols for Secure Computations (context) - Yao - 1982
100
Founding Cryptography on Oblivious Transfer (context) - Kilian - 1988
34
Cryptographic Computation: Secure Fault-Tolerant Protocols a.. (context) - Galil, Haber et al. - 1988
27
Zero-knowledge Simulation of Boolean Circuits
- Brassard, Cr'epeau - 1987
15
Minimum-Knowledge Interactive Proofs for Decision Problems (context) - Galil, Haber et al. - 1989
10
Multi-Party Cryptographic Computation: Techniques and Applic.. (context) - Haber - 1988
7
Multiparty Computations Ensuring Secrecy of Each Party's Inp.. (context) - Chaum, Damgard et al. - 1988
2
A Simple Protocol for Secure Circuit Evaluation (context) - Abadi, Feigenbaum - 1988
2
On Hiding Information from an Oracle (context) - Abadi, Feigenbaum et al. - 1989
1
Instance Hiding in Multioracle Queries (context) - Beaver, Feigenbaum - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995)
(Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991)
(Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC