Danny Dolev, Cynthia Dwork, Moni Naor  Home/Search
Context Related
| wisdom.weizmann.ac.il/pub/...9527.ps.Z 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: fermivista.math....weizmann.ac.il (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. The same concept makes sense in the contexts of string commitment and zero-knowledge proofs of possession of knowledge. Non-malleable schemes for each of these three problems are presented. The schemes do not assume a trusted... (Update)
Cited by: More
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
Earlier versions of of this work appear in [9] and [1].. - Dhies An Encryption (Correct)
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (Correct)
Similar documents (at the sentence level):
60.7%: Non-Malleable Cryptography - Dolev, Dwork, Naor (1998) (Correct)
Active bibliography (related documents): More All
1.1: Public-key Cryptosystems Provably Secure against Chosen.. - Naor, Yung (1995) (Correct)
0.5: Public Key Cryptosystems with Partial Secrecy - Goldsmith, Klapper (1996) (Correct)
0.3: Concurrent Zero-Knowledge: Reducing the Need for Timing.. - Dwork, Sahai (1998) (Correct)
Similar documents based on text: More All
0.4: Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000) (Correct)
0.3: The Power of Choice in Scheduling Parallel Tasks - Ludwig, Tiwari (1993) (Correct)
0.2: SRS - A Framework for Developing Malleable and Migratable.. - Vadhiyar, Dongarra (2002) (Correct)
Related documents from co-citation: More All
50: Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack (context) - Rackoff, Simon - 1991
42: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
42: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciph.. - Cramer, Shoup - 1998
BibTeX entry: (Update)
O. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proceedings of the 23rd Symposium on Theory of Computing, ACM STOC, 1991. http://citeseer.ist.psu.edu/dolev91nonmalleable.html More
@inproceedings{ dolev91nonmalleable,
author = "Danny Dolev and Cynthia Dwork and Moni Naor",
title = "Non-malleable cryptography",
pages = "542--552",
year = "1991",
url = "citeseer.ist.psu.edu/dolev91nonmalleable.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signature and Public Key Cryp.. - Rivest, Shamir et al. - 1978
531 The Knowledge Complexity of Interactive ProofSystems (context) - Goldwasser, Micali et al. - 1989
339 Theory and Applications of Trapdoor functions (context) - Yao - 1982
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
208 Universal One-way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989
206 Zero Knowledge Proofs of Identity (context) - Feige, Fiat et al.
124 Bit Commitment Using Pseudo-Randomness - Naor - 1991
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1992
111 the Composition of Zero-knowledge Proof Systems - Goldreich, Krawczyk - 1989
99 One-way Function are Necessary and Sufficient for Signatures (context) - Rompel - 1990
95 Multiple Non-Interactive Zero-Knowledge Proofs Based on a Si.. (context) - Feige, Lapidot et al. - 1990
84 Non-Interactive Zero-Knowledge - Blum, De Santis et al. - 1991
63 An Efficient Probabilistic Public-key Encryption that Hides .. (context) - Blum, Goldwasser - 1985
56 Proofs that Yield Nothing But their Validity (context) - Goldreich, Micali et al. - 1991
36 Non-Interactive Zero-Knowledge Proof Systems (context) - Blum, Feldman et al. - 1988
31 How to Sign Given Any Trapdoor Function (context) - Bellare, Micali - 1988
25 Pseudo-randomness and applications (context) - Luby
24 A Hard Predicate for All One-way Functions (context) - Goldreich, Levin - 1989
20 An efficient non-interactive zero-knowledge proof system for.. - Kilian, Petrank
20 A Secure Digital Signature Scheme (context) - Goldwasser, Micali et al. - 1988
19 Achieving Independence in Logarithmic Number of Rounds (context) - Chor, Rabin - 1987
17 Special uses and abuses of the Fiat Shamir passport protocol.. (context) - Desmet, Goutier et al. - 1988
11 the complexity of bounded-interaction and non-interactive ze.. (context) - Kilian - 1994
5 Rabin Bits are 1=2 + 1=poly Secure (context) - Alexi, Chor et al. - 1988
5 Notions of Security of Public-Key Cryptosystems (context) - Micali, Rackoff et al. - 1988
4 Verifiable Secret Sharing in the Presence of Faults (context) - Chor, Goldwasser et al. - 1985
3 A Uniform Complexity Encryption and Zero-knowledge (context) - Goldreich - 1989
1 and M. Yung, Public-key Cryptosystems provably secure agains.. (context) - Naor - 1990
1 th ACM Symposium on the Theory of Computing (context) - De Santis, Persiano et al. - 1993
1 and A. Shamir, Witness Hiding and Witness Indistinguishabili.. (context) - Feige - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.wisdom.weizmann.ac.il.html): More
Local Majority Voting, Small Coalitions and Controlling Monopolies .. - Peleg (1996) (Correct)
On Constructing 1-1 One-Way Functions - Goldreich, Levin, Nisan (1995) (Correct)
Infinite Cyclic Impartial Games - Fraenkel, Rahat (2001) (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