Shai Halevi, Silvio Micali  Home/Search
Context Related
Links: ACM DBLP | mit.edu/pub/people/sh...comitmnt2.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: mit.edu/~shaih/mypapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present a very practical string-commitment scheme which is provably secure based solely on collision-free hashing. Our scheme enables a computationally bounded party to commit strings to an unbounded one, and is optimal (within a small constant factor) in terms of interaction, communication, and computation. Our result also proves that constant round statistical zero-knowledge arguments and constant-round computational zero-knowledge proofs for NP exist based on the existence of... (Update)
Cited by: More
Minimal Assumptions for Efficient Mercurial Commitments - Dodis (2005) (Correct)
Tolerant Combiners: Resilient Cryptographic Design - Herzberg (2002) (Correct)
Sufficient Conditions for Collision-Resistant Hashing - Ishai, Kushilevitz, Ostrovsky (Correct)
Similar documents (at the sentence level):
12.5%: Efficient Commitment Schemes with Bounded Sender and Unbounded.. - Halevi (1996) (Correct)
Active bibliography (related documents): More All
0.5: Computing with Quanta - Impacts of Quantum Theory on Computation - Hirvensalo (2000) (Correct)
0.1: Statistical Secrecy and Multi-Bit Commitments - Damgård, Pedersen, Pfitzmann (1996) (Correct)
0.1: RSA-Based Fail-Stop Signature Schemes (Extended Abstract) - Susilo, Safavi-Naini.. (1999) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Mutually Independent Commitment - Liskov, Lysyanskaya, Micali, Reyzin, .. (2001) (Correct)
0.2: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
0.1: A Sufficient Condition for Key-Privacy - Halevi (2005) (Correct)
Related documents from co-citation: More All
12: Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al. - 1988
11: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack - Goldwasser, Micali et al. - 1988
11: the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signa.. - Damgard, Pedersen et al. - 1994
BibTeX entry: (Update)
S. Halevi and S. Micali, "Practical and Provably-Secure Commitment Schemes from CollisionFree Hashing", in Advances in Cryptology - CRYPTO96, Lecture Notes in Computer Science 1109, Springer-Verlag, 1996, pp. 201-215. http://citeseer.ist.psu.edu/halevi96practical.html More
@article{ halevi96practical,
author = "Shai Halevi and Silvio Micali",
title = "Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing",
journal = "Lecture Notes in Computer Science",
volume = "1109",
pages = "201--??",
year = "1996",
url = "citeseer.ist.psu.edu/halevi96practical.html" }
Citations (may not include all citations):501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
208 Universal One-Way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989 ACM DBLP
159 Non-Interactive and Information-Theoretic Secure Verifiable .. (context) - Pedersen - 1992 ACM DBLP
124 Bit commitment using pseudo-randomness - Naor - 1990 ACM DBLP
63 How to Construct Constant-Round Zero-Knowledge Proofs System.. - Goldreich, Kahan - 1996
41 Direct minimum-knowledge computations (context) - Yung, Impagliazzo - 1988 ACM DBLP
41 Cryptographically Strong Undeniable Signatures - Chaum, van Heijst et al. - 1992
36 A Quantum Bit Commitment Scheme Provably Unbreakable by Both.. - Brassard, Crepeau et al. - 1993 ACM DBLP
32 Coin flipping by telephone (context) - Blum - 1982 DBLP
31 Practical and Provably Secure Release of a Secret and Exchan.. (context) - Damgard - 1994 ACM DBLP
30 the existence of statistically hiding bit commitment schemes.. - Damgard, Pedersen et al. - 1994
29 of Computer and System Science (context) - Carter, Wegman et al. - 1979
26 Perfect zero-knowledge arguments for NP can be based on gene.. - Naor, Ostrovsky et al. - 1993
14 Quantum bit commitment and coin tossing protocols - Brassard, Crepeau - 1991 ACM DBLP
8 A Remark on a Signature Scheme where Forgery can be Proved (context) - Bleumer, Pfitzmann et al. - 1990 DBLP
2 Brassard Quantum Cryptography: Public Key Distribution and C.. (context) - Bennett - 1984
2 Efficient commitment with bounded sender and unbounded recei.. (context) - Halevi - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~shaih/mypapers.html): More
Potential Function Analysis of Greedy Hot-Potato Routing .. - Ben-Dor, Halevi.. (1994) (Correct)
Zero-One Permanent is #P-Complete, A Simpler Proof - Ben-Dor, Halevi (1995) (Correct)
A Stronger Notion of Proofs of Knowledge - Shai Halevi (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