Christian Cachin, Jan Camenisch, Joe Kilian, Joy Müller  Home/Search
Context Related
| ibm.com/~cca/./papers/nonint.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/~cca/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper investigates one-round secure computation between two distrusting parties: Alice and Bob each have private inputs to a common function, but only Alice, acting as the receiver, is to learn the output; the protocol is limited to one message from Alice to Bob followed by one message from Bob to Alice. A model in which Bob may be computationally unbounded is investigated, which corresponds to information-theoretic security for Alice. It is shown that 1. for honest-but-curious behavior... (Update)
Cited by: More
Constant-Round Multiparty Computation Using a Black-Box.. - Damgård, Ishai (2005) (Correct)
Strong Conditional Oblivious Transfer and Computing on Intervals - Blake, Kolesnikov (2004) (Correct)
Implementing Secure Distributed Computing with Mobile.. - Neven, Van Hoeymissen, .. (2000) (Correct)
Similar documents (at the sentence level):
68.0%: One-Round Secure Computation and Secure Autonomous.. - Cachin.. (2000) (Correct)
Active bibliography (related documents): More All
0.3: Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996) (Correct)
0.3: Homomorphic Public-Key Cryptosystems and Encrypting.. - Grigoriev, Ponomarenko (2003) (Correct)
0.2: Result Verification and Trust-based Scheduling in.. - Zhao, Lo, Gauthier-Dickey (2005) (Correct)
Similar documents based on text: More All
0.5: Cryptographic Security for Mobile Code - Algesheimer, Cachin, Camenisch.. (2003) (Correct)
0.5: The All-or-Nothing Nature of Two-Party Secure Computation - Beimel, Malkin, Micali (1999) (Correct)
0.4: Modeling Complexity in Secure Distributed Computing - Cachin (2002) (Correct)
Related documents from co-citation: More All
11: Security and composition of multi-party cryptographic protocols - Canetti - 1998
10: Non-interactive CryptoComputing for NC - Sander, Young et al. - 1999
10: Secure multi-party computation - Goldreich - 1998
BibTeX entry: (Update)
C. Cachin, J. Camenisch, J. Kilian, and J. Muller, One-round secure computation and secure autonomous mobile agents, Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP) (U. Montanari, J. P. Rolim, and 13 E. Welzl, eds.), Lecture Notes in Computer Science, vol. 1853, Springer, July 2000, pp. 512-523. http://citeseer.ist.psu.edu/article/cachin00oneround.html More
@inproceedings{ cachin00oneround,
author = "Christian Cachin and Jan Camenisch and Joe Kilian and Joy Muller",
title = "One-Round Secure Computation and Secure Autonomous Mobile Agents",
booktitle = "Automata, Languages and Programming",
pages = "512-523",
year = "2000",
url = "citeseer.ist.psu.edu/article/cachin00oneround.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
219 Completeness theorems for noncryptographic fault-tolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
185 How to generate and exchange secrets (context) - Yao - 1986
179 Security and composition of multi-party cryptographic protoc.. - Canetti - 2000
168 Protecting mobile agents against malicious hosts - Sander, Tschudin - 1998
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
140 How to play any mental game or a completeness theorem for pr.. (context) - Goldreich, Micali et al. - 1987
120 Secure computation (context) - Micali, Rogaway - 1991
95 Multiple non-interactive zero-knowledge proofs based on a si.. (context) - Feige, Lapidot et al. - 1990
85 On hiding information from an oracle - Abadi, Feigenbaum et al. - 1989
78 Foundations of secure interactive computing (context) - Beaver - 1991
65 Number-theoretic constructions of ecient pseudorandom functi.. - Naor, Reingold - 1997
59 Non-interactive oblivious transfer and applications (context) - Bellare, Micali - 1990
55 Information theoretic reductions among disclosure problems (context) - Brassard, Cr et al. - 1986
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damg et al. - 1987
47 The round complexity of secure protocols - Beaver, Micali et al. - 1990
35 Non-interactive CryptoComputing for NC - Sander, Young et al. - 1999
34 Proofs of partial knowledge and simplied design of witness h.. - Cramer, Damg et al. - 1994
26 Publicly veriable secret sharing - Stadler - 1996
24 Fair games against an all-powerful adversary - Ostrovsky, Venkatesan et al. - 1993
20 Secure circuit evaluation: A protocol based on hiding inform.. - Abadi, Feigenbaum - 1990
16 The Round Complexity of Secure Protocols (context) - Rogaway - 1991
14 Non-interactive zero-knowledge proof systems and application.. (context) - Blum, Feldman et al. - 1988
7 of DIMACS Series in Discrete Mathematics and Theoretical Com.. (context) - Feigenbaum, Merritt et al. - 1991
7 in Foundations of Secure Computation (context) - Rivest, Adleman et al. - 1978
3 Theory of Cryptology Library (context) - Canetti, Goldreich et al. - 1999
1 Searching for elements in black box elds and applications (context) - Boneh, Lipton - 1996
1 knowledge proof of knowledge and chosen ciphertext attack (context) - Racko, Simon et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zurich.ibm.com/~cca/publications.html): More
Locating the Primary Attention Focus of the User - Rauterberg, Cachin (1993) (Correct)
Random Oracles in Constantinople: Practical Asynchronous.. - Cachin, Kursawe, Shoup (2000) (Correct)
Optimistic Fair Secure Computation (Extended Abstract) - Cachin, Camenisch (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