Giovanni Di Crescenzo Yuval Ishai Rafail Ostrovsky  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/37.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: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A commitment protocol is a fundamental cryptographic primitive used as a basic building block throughout modern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many settings the implementation of this fundamental primitive requires a strong non-malleability property in order not to be susceptible to a certain class of attacks. In this paper, assuming that a common random string is available to all players, we show how to implement nonmalleable commitment without any interaction... (Update)
Cited by: More
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (Correct)
Efficient Mutual Data Authentication Using Manually.. - Laur, Asokan, Nyberg (2005) (Correct)
Group Signatures: Better Efficiency and New Theoretical Aspects - Camenisch, Groth (2005) (Correct)
Active bibliography (related documents): More All
1.3: Non-Interactive and Non-Malleable Commitment - Di Crescenzo, Ishai, Ostrovsky (1998) (Correct)
0.2: An Efficient Pseudo-Random Generator Provably as Secure as.. - Fischer, Stern (1996) (Correct)
0.2: Certifying Permutations: Non-Interactive Zero-Knowledge Based on.. - Bellare (1996) (Correct)
Similar documents based on text: More All
0.6: Universal Service-Providers for Database Private.. - Di Crescenzo, Ishai, .. (1998) (Correct)
0.5: Efficient and Non-Interactive Non-Malleable Commitment - Di Crescenzo, Katz.. (2001) (Correct)
0.4: Robust Non-Interactive Zero Knowledge - de Santis, di Crescenzo.. (2001) (Correct)
Related documents from co-citation: More All
3: Cambridge University Press (context) - Goldreich, Cryptography - 2001
3: Non-Interactive Zero-Knowledge and its Applications (context) - Blum, Feldman et al. - 1988
3: Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2001
BibTeX entry: (Update)
Giovanni Di Crescenzo, Yuval Ishai, and Rafail Ostrovsky. Non-interactive and nonmalleable commitment. In Proceedings of the 30th STOC, pages 141-150. ACM Press, 1998. http://citeseer.ist.psu.edu/article/dicrescenzo98noninteractive.html More
@inproceedings{ dicrescenzo98noninteractive,
author = "Giovanni Di Crescenzo and Yuval Ishai and Rafail Ostrovsky",
title = "Non-interactive and non-malleable commitment",
pages = "141--150",
year = "1998",
url = "citeseer.ist.psu.edu/article/dicrescenzo98noninteractive.html" }
Citations (may not include all citations):659 Random Oracles are Practical: A paradigm for Designing Effic.. - Bellare, Rogaway - 1993
531 The Knowledge Complexity of interactive Proof-Systems (context) - Goldwasser, Micali et al. - 1989
326 Non-Malleable Cryptography - Dolev, Dwork et al.
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
250 How to Play Any Mental Game (context) - Goldreich, Micali et al. - 1987
197 A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985
194 Proofs that Yield Nothing but their Validity or All Language.. (context) - Goldreich, Micali et al. - 1991
149 A Hard-Core Predicate for all OneWay Functions (context) - Goldreich, Levin
124 Bit Commitment using Pseudo-Randomness - Naor
114 Non-Interactive Zero-Knowledge Proofs of Knowledge and Chose.. (context) - Rackoff, Simon
84 Noninteractive Zero-Knowledge - Blum, De Santis et al. - 1991
79 One-way Function are Essential for Complexity-Based Cryptogr.. (context) - Impagliazzo, Luby
77 Non-Interactive ZeroKnowledge and its Applications (context) - Blum, Feldman et al.
39 Zero-Knowledge Proofs of Knowledge Without Interaction (context) - De Santis, Persiano
25 Does Parallel Repetition Lower the Error in Computationally .. (context) - Bellare, Impagliazzo et al.
12 Adaptive Zero-Knowledge and Computational Equivocation (context) - Beaver
7 Achieving Independence Efficiently and Securely - Gennaro
5 Public-Key Cryptosystems Secure against Chosen Ciphertext At.. (context) - Naor, Yung
4 PseudoRandom Generation from any One-way Function (context) - Hastad, Impagliazzo et al.
2 Perfect Zero-Knowledge Arguments can be based under General .. (context) - Naor, Ostrovsky et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (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