Cynthia Dwork, Moni Naor, Omer Reingold, Larry Stockmeyer  Home/Search
Context Related
| ibm.com/cs/people/stock/magic.ps 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/cs/people/stock/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that three apparently unrelated fundamental problems in distributed computing, cryptography, and complexity theory, are essentially the same problem. These three problems and brief descriptions of them follow. (1) The selective decommitment problem. An adversary is given commitments to a collection of messages, and the adversary can ask for some subset of the commitments to be opened. The question is whether seeing the decommitments to these open plaintexts allows the adversary to ... (Update)
Context of citations to this paper: More
...are carried out together. A good rst example for the limitations of the basic de nitions is the selective decommitment problem [dnrs99], that demonstrates our inability to prove some very minimal composition properties of the basic de nitions. Indeed, the basic de...
.... Halevi [CGH98] CS proofs were defined and constructed by Kilian [Kil92] Kil95] and Micali [Mic94] Dwork, Naor, Reingold and Stockmeyer [DNRS99] have explored some connections between the existence of non black box 3 round zero knowledge arguments and other problems in...
Cited by: More
Covert Two-Party Computation - Luis Von Ahn (Correct)
Lower Bounds for Non-Black-Box Zero Knowledge - Barak, Lindell, Vadhan (2004) (Correct)
Immunizing Encryption Schemes from Decryption Errors - Dwork, Naor, Reingold (2004) (Correct)
Similar documents (at the sentence level):
36.7%: Magic Functions - Dwork, Naor, Reingold, Stockmeyer (1999) (Correct)
Active bibliography (related documents): More All
0.3: Designated Verifier Proofs and Their Applications - Jakobsson, Sako, Impagliazzo (1996) (Correct)
0.3: The UCSD Active Web - Pasquale (1997) (Correct)
0.2: A Relationship between One-Wayness and Correlation Intractability - Hada, Tanaka (1999) (Correct)
Similar documents based on text: More All
0.6: Pseudo-Random Functions and Factoring - Naor, Reingold (2000) (Correct)
0.4: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
0.3: 2-Round Zero Knowledge and Proof Auditors - Dwork, Stockmeyer (2004) (Correct)
Related documents from co-citation: More All
3: A pseudorandom generator from any one-way function - Hastad, Impagliazzo et al. - 1999
3: The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1985
3: The random oracle methodology (context) - Canetti, Goldreich et al. - 1998
BibTeX entry: (Update)
C. Dwork, M. Naor, O. Reingold, and L. Stockmeyer. Magic functions. In 40th Annual Symposium on Foundations of Computer Science, pages 523-534. IEEE, 1999. http://citeseer.ist.psu.edu/article/dwork00magic.html More
@inproceedings{ dwork99magic,
author = "Cynthia Dwork and Moni Naor and Omer Reingold and Larry J. Stockmeyer",
title = "Magic Functions",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "523-534",
year = "1999",
url = "citeseer.ist.psu.edu/article/dwork00magic.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Micali et al. - 1989
411 How to prove yourself: Practical solutions to identification.. - Fiat, Shamir - 1987
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
278 Probabilistic encryption (context) - Goldwasser, Micali - 1984
206 Zero knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
194 Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
167 The random oracle methodology (context) - Canetti, Goldreich et al. - 1998
124 Bit commitment using pseudorandomness - Naor - 1991
111 the composition of zero knowledge proof systems - Goldreich, Krawczyk - 1996
94 Concurrent zero-knowledge - Dwork, Naor et al. - 1998
69 Adaptively secure multiparty computation - Canetti, Feige et al. - 1996
67 Definitions and properties of zero-knowledge proof systems - Goldreich, Oren - 1993
66 Structural Complexity (context) - Balcazar, Diaz et al. - 1988
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
51 the concurrent composition of zero-knowledge proofs (context) - Richardson, Kilian - 1999
42 Hard-core distributions for somewhat hard problems - Impagliazzo - 1995
41 Lower bounds for zero knowledge on the internet - Kilian, Petrank et al. - 1998
38 Witness indistinguishability and witness hiding protocols (context) - Feige, Shamir - 1990
32 the cunning power of cheating verifiers: some observations a.. (context) - Oren - 1987
29 Incoercible multiparty computation - Canetti, Gennaro - 1996
27 the existence of 3-round zero-knowledge protocols - Hada, Tanaka - 1998
25 Perfect zero-knowledge arguments for NP using any one-way pe.. - Naor, Ostrovsky et al. - 1998
22 Lecture Notes in Computer Science (context) - Canetti, Dwork et al. - 1997
15 personal communication (context) - Impagliazzo, Jakobsson
6 private communication (context) - Goldreich
4 A relationship between one-wayness and correlation intractab.. - Hada, Tanaka - 1999
4 Distributed provers with application to undeniable signature.. (context) - Pederson
3 Does parallel repetition reduce the error in computationally.. (context) - Bellare, Impagliazzo et al. - 1997
3 personal communication (context) - Chaum, Impagliazzo
2 The correlation intractability of ideal families (context) - Bellare, Goldreich et al. - 1998
Documents on the same site (http://www.almaden.ibm.com/cs/people/stock/): More
An Age-Threshold Algorithm for Garbage Collection in.. - Menon, Stockmeyer (1998) (Correct)
Compactly Encoding Unstructured Inputs with.. - Ajtai, Burns.. (2000) (Correct)
Declustered Disk Array Architectures with Optimal and.. - Alvarez, Burkhard, al. (1998) (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