Danny Dolev, Cynthia Dwork, Moni Naor  Home/Search
Context Related
Links: ACM | wisdom.weizmann.ac.il/~naor...nmc.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 Problem Downloading? From: wisdom.weizmann.ac.il/~na...onpub (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, in the context of encryption 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... (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):
36.3%: Non-Malleable Cryptography - Dolev, Dwork, Naor (1991) (Correct)
Active bibliography (related documents): More All
1.2: Public-key Cryptosystems Provably Secure against Chosen.. - Naor, Yung (1995) (Correct)
1.0: Concurrent Zero-Knowledge: Reducing the Need for Timing.. - Dwork, Sahai (1998) (Correct)
0.5: Zaps and Their Applications - Dwork, Naor (2000) (Correct)
Similar documents based on text: More All
0.3: Non-Interactive and Non-Malleable Commitment - Di Crescenzo, Ishai, Ostrovsky (1998) (Correct)
0.3: The Power of Choice in Scheduling Parallel Tasks - Ludwig, Tiwari (1993) (Correct)
0.3: On Memory-Bound Functions for Fighting Spam - Dwork, Goldberg, Naor (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/article/dolev98nonmalleable.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/article/dolev98nonmalleable.html" }
Citations (may not include all citations):1529 A Method for Obtaining Digital Signature and Public Key Cryp.. - Rivest, Shamir et al. - 1978
659 Random Oracles are Practical: A Paradigm for Designing Effic.. - Bellare, Rogaway - 1993 DBLP
531 The Knowledge Complexity of Interactive ProofSystems (context) - Goldwasser, Micali et al. - 1989
419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
339 Theory and Applications of Trapdoor functions (context) - Yao - 1982
302 A Logic of Authentication - Burrows, Abadi et al. - 1990 ACM DBLP
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984 ACM DBLP
260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998 ACM DBLP
208 Universal One-way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989 ACM DBLP
206 Zero Knowledge Proofs of Identity (context) - Feige, Fiat et al. ACM DBLP
167 Pseudo-random generation from one-way functions (context) - Impagliazzo, Levin et al. - 1989
130 Provably Secure Session Key Distribution: The Three Party Ca.. - Bellare, Rogaway - 1995 DBLP
124 Bit Commitment Using Pseudo-Randomness - Naor - 1991 ACM DBLP
119 Chosen Ciphertext Attacks Against Protocols Based on the RSA.. - Bleichenbacher - 1998
118 Optimal Asymmetric Encryption -- How to Encrypt with RSA (context) - Bellare, Rogaway - 1994
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1992 ACM DBLP
111 the Composition of Zero-knowledge Proof Systems - Goldreich, Krawczyk - 1996
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 ACM
73 A Lower Bound for the Time to Assure Interactive Consistency - Fischer, Lynch - 1982 DBLP
67 Definitions and Properties of Zero-Knowledge Proof Systems - Goldreich, Oren - 1993
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
55 Number-Theoretic Constructions of Efficient Pseudo-Random Fu.. - Naor, Reingold - 1982 ACM DBLP
42 Towards Realizing Random Oracles: Hash Functions that Hide a.. - Canetti - 1997 DBLP
39 Algorithms for Black-Box fields and their application to cry.. (context) - Boneh, Lipton - 1996
36 Non-Interactive Zero-Knowledge Proof Systems (context) - Blum, Feldman et al. - 1988 ACM DBLP
32 New generation of secure and practical RSA-based signatures .. - Cramer, Damgard - 1996
32 Synthesizers and their application to the parallel construct.. - Naor, Reingold - 1995 ACM DBLP
31 How to Sign Given Any Trapdoor Function (context) - Bellare, Micali - 1992 ACM DBLP
29 Towards the equivalence of breaking the Diffie-Hellman proto.. - Maurer - 1994 ACM DBLP
25 Does Parallel Repetition Lower the Error in Computationally .. (context) - Bellare, Impagliazzo et al. - 1997
25 Pseudo-randomness and applications (context) - Luby - 1996
24 A Hard Predicate for All One-way Functions (context) - Goldreich, Levin - 1989
22 From Unpredictability to Indistinguishability: A Simple Cons.. - Naor, Reingold - 1998
21 Why and How to Establish a Private Code on a Public Network (context) - Goldwasser, Micali et al. - 1982
20 A Formal Treatment of Remotely Keyed Encryption - Blaze, Feigenbaum et al. - 1998 ACM DBLP
20 A Secure Digital Signature Scheme (context) - Goldwasser, Micali et al. - 1988
20 An efficient non-interactive zero-knowledge proof system for.. - Kilian, Petrank - 1998 DBLP
19 Achieving Independence in Logarithmic Number of Rounds (context) - Chor, Rabin - 1987 ACM DBLP
17 Access Control and Signatures via Quorum Secret Sharing Proc - Naor, Wool - 1996
17 Special uses and abuses of the Fiat Shamir passport protocol.. (context) - Desmet, Goutier et al. - 1988
16 Electronic publication: http://www (context) - Goldreich, Foundations - 1995
11 the complexity of bounded-interaction and non-interactive ze.. (context) - Kilian - 1994
11 Method for message authentication from non-malleable crypto .. (context) - Dwork, Naor - 1996
8 A practical Public Key Cryptosystem Provable Secure against .. (context) - Cramer, Shoup - 1998
7 Cryptoprotocols: Subscription to a Public Key (context) - Yung - 1985
6 Non-Interactive and Non-Malleable Commitment - Di Crescenzo, Ishai et al. - 1998
6 and A. Shamir, Witness Hiding and Witness Indistinguishabili.. (context) - Feige - 1990
6 ith Worst-Case/Average-Case Equivalence Proc. 29th Annual AC.. (context) - Ajtai, Dwork et al. - 1997
5 Notions of Security of Public-Key Cryptosystems (context) - Micali, Rackoff et al. - 1988
5 of the 24th IEEE Symposium on the Foundation of Computer Sci.. (context) - Rabin, Generals - 1983
5 One-way functions are essential to computational based crypt.. (context) - Impagliazzo, Luby - 1989
5 Rabin Bits are 1=2 + 1=poly Secure (context) - Alexi, Chor et al. - 1988
4 Verifiable Secret Sharing in the Presence of Faults (context) - Chor, Goldwasser et al. - 1985
4 and M. Yung, Public-key Cryptosystems provably secure agains.. (context) - Naor - 1990
4 Interactive Public-key Cryptosystems (context) - Galil, Haber et al. - 1986
3 A Uniform Complexity Encryption of Zero-knowledge (context) - Goldreich - 1989
3 th Annual ACM Symposium on the Theory of Computing (context) - Dwork, Naor et al. - 1998
3 th Annual ACM Symposium on the Theory of Computing (context) - Canetti, Goldreich et al. - 1998
3 Lecture Notes in Computer Science No (context) - Bellare, Rogaway et al. - 1994
3 Perfectly One-way Probabilistic Hashing (context) - Canetti, Miccianco et al. - 1998
2 Lower Bounds for Zero Knowledge on teh Internet (context) - Kilian, Petrank et al. - 1998
1 of the 33th IEEE Symposium on the Foundation of Computer Sci.. (context) - De Santis, Persiano et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~naor/onpub.html): More
Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996) (Correct)
Certificate Revocation and Certificate Update - Naor, Nissim (1998) (Correct)
Verification of a human in the loop or Identification via the.. - Naor (1996) (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