Commitment Schemes

• Papers
  • Homomorphic Commitment Schemes
    • An improved protocol for demonstrating possession of discrete logarithms (D. Chaum , JH Evertse and J. van de Graaf, Eurocrypt '87)
    • Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing (Torben Pryds Pedersen, Crypto 1991)
    • Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography (Rosario Gennaro and Michael O.~Rabin and Tal Rabin, PODC 1998)
    • Zero-Knowledge for Finite Field Arithmetic. Or: Can Zero-Knowledge be for Free? (Ronald Cramer, Ivan Damgård, 1998)
    • Paillier's Cryptosystem Revisited (Dario Catalano and Rosario Gennaro and Nick Howgrave-Graham and Phong Q. Nguyen , ACM CCS 2001)
    • Overview
      • Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
        (Masayuki Abe, Ronald Cramer, and Serge Fehr, ASIACRYPT 2002)
  • Integer commitment
    • Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations (Fujisaki, Okamoto, 1999)
    • An Integer Commitment Scheme based on Groups with Hidden Order (Ivan Damgard and Eiichiro Fujisaki, eprint 2001/064)
  • Trapdoor Commitment []
    • Sigma-protocol-based trapdoor commitment in auxiliary string model
      • Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
        (Ivan Damgård, Eurocrypt 2000)
    • Paillier's cryptosystem revisited (Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen, 2001)
    • Trapdoor Commitment Schemes and Their Applications (Marc Fischlin, PhD thesis, 2001)
  • Quantum bit-commitment
    • A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties (Gilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois, 1993)
    • The Trouble with Quantum Bit Commitment (Dominic Mayers, 1995)
    • What is going on with Quantum Bit Commitment? (C. Crépeau, inv. to Pragocrypt 1996)
    • Is Quantum Bit Commitment Really Possible? (Hoi-Kwong Lo, H.F. Chau, 1997)
    • Defeating classical bit commitments with a quantum computer (Gilles Brassard, Claude Crepeau, Dominic Mayers, Louis Salvail, 1998)
    • The Security of Quantum Bit Commitments Schemes (G. Brassard, C. Crépeau, D. Mayers and L. Salvail, invit. to MFC 1998)
    • Making An Empty Promise With A Quantum Computer (Or, A Brief Review on the Impossibility of Quantum Bit Commitment) (H. F. Chau and H.-K. Lo, 1999)
    • How to convert the flavor of a quantum bit commitment (C. Crépeau, F. Légaré and L. Salvail, Eurocrypt 2001)
  • Non-malleable commitment []
    • Non-Interactive and Non-Malleable Commitment (Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky, STOC 1998)
    • EfficientNon-malleable Commitment Schemes (M. Fischlin, R. Fischlin, Crypto 2000)
    • Efficient and Non-Interactive Non-Malleable Commitment (Giovanni Di Crescenzo and Jonathan Katz and Rafail Ostrovsky and Adam Smith, eprint 2001/032)
    • The Non-interactive Equivocable Non-malleable Commitment and its Applications (Chunming Tang Zhuojun Liu, 2002)
    • Non-interactive and Reusable Non-malleable Commitment Schemes (Ivan Damgård and Jens Groth, eprint 2003/080)
    • Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols (Rosario Gennaro, eprint 2003/214)
    • New and Improved Constructions of Non-Malleable Cryptographic Protocols (Rafael Pass and Alon Rosen, STOC 2005)
    • Concurrent Non-Malleable Commitments (Rafael Pass and Alon Rosen, FOCS 2005)
    • Concurrent Non-Malleable Commitments from One-way Functions (Huijia Lin, Rafael Pass and Muthuramakrishnan Venkitasubramaniam, TCC 2008)
  • Equivocal commitment []
    • Definition
      • Adaptive zero knowledge and computational equivocation
        (Donald Beaver, STOC 1996)
    • First scheme
      • Non-Interactive and Non-Malleable Commitment
        (Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky, STOC 1998)
    • First scheme in plain model
      • On Concurrent Zero-Knowledge with Pre-Processing
        (Giovanni Di Crescenzo, Rafail Ostrovsky, 1999)
    • Round-optimal secure two-party computation (Jonathan Katz, Rafail Ostrovsky, Crypto 2004)
    • Generic yet Practical ZK Arguments from any Public-Coin HVZK (Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Feng Dengguo, ECCC 2005/162)
  • All/Rest of the papers
    • Bit Commitment Using Pseudo-Randomness (Moni Naor, 1991)
    • 1996
      • Adaptive zero knowledge and computational equivocation
        (Donald Beaver, STOC 1996)
      • Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
        (Halevi, Micali 1996)
      • Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
        (Shai Halevi, 1996)
      • Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
        (Shai Halevi, Silvio Micali, 1996)
      • Statistical Secrecy and Multi-Bit Commitments
        (Ivan Damgård, Torben Pedersen, Birgit Pfitzmann, 1996)
    • 1997
      • On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures
        (Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann, JoC 1997)
    • 1998
      • Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
        (Paul Syverson, 1998)
      • Non-Interactive and Non-Malleable Commitment
        (Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky, STOC 1998)
      • Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
        (Paul Syverson, 1998)
    • 1999
      • Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver
        (Halevi, 1999)
      • A Fuzzy Commitment Scheme
        (Ari Juels, Martin Wattenberg, 1999)
      • Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer
        (Ronald L. Rivest)
      • On Concurrent Zero-Knowledge with Pre-Processing
        (Giovanni Di Crescenzo, Rafail Ostrovsky, 1999)
    • 2000
      • Efficient Non-malleable Commitment Schemes
        (M. Fischlin, R. Fischlin, Crypto 2000)
      • Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
        (Ivan Damgård, Eurocrypt 2000)
      • Constructions and Bounds for Unconditionally Secure Commitment Schemes
        (C. Blundo and B. Masucci and D.R. Stinson and R. Wei, 2000)
    • 2001
      • Efficient and Non-Interactive Non-Malleable Commitment
        (Giovanni Di Crescenzo and Jonathan Katz and Rafail Ostrovsky and Adam Smith, eprint 2001/032)
      • An Integer Commitment Scheme based on Groups with Hidden Order
        (Ivan Damgard and Eiichiro Fujisaki, eprint 2001/064)
      • Universally Composable Commitments
        (Ran Canetti and Marc Fischlin, CRYPTO 2001)
    • 2002
      • Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
        (Ivan B. Damgård and Jesper Buus Nielsen, Crypto 2002)
    • 2003
      • Non-interactive and Reusable Non-malleable Commitment Schemes
        (Ivan Damgård and Jens Groth, eprint 2003/080)
      • Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols
        (Rosario Gennaro, eprint 2003/214)
      • On Simulation-Sound Trapdoor Commitments
        (Philip MacKenzie and Ke Yang, eprint 2003/252)
    • 2004
      • Universally Composable Commitments Using Random Oracles
        (Dennis Hofheinz and Jörn Müller-Quade, TCC 2004)
    • 2005
      • Reducing complexity assumptions for statistically-hiding commitment
        (Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel, Eurocrypt, 2005)
      • New and Improved Constructions of Non-Malleable Cryptographic Protocols
        (Rafael Pass and Alon Rosen, STOC 2005)
      • Concurrent Non-Malleable Commitments
        (Rafael Pass and Alon Rosen, FOCS 2005)
      • Generic yet Practical ZK Arguments from any Public-Coin HVZK
        (Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Feng Dengguo, ECCC 2005/162)
    • 2008
      • An Equivalence between Zero Knowledge and Commitments
        (Shien Jin Ong and Salil Vadhan, TCC 2008)
      • Concurrent Non-Malleable Commitments from One-way Functions
        (Huijia Lin, Rafael Pass and Muthuramakrishnan Venkitasubramaniam, TCC 2008)

---

Cryptology Pointers by Helger Lipmaa
Got any suggestions or additional links? Mail to <lipmaa>research.cyber.ee
NB! If you find any broken links, please be kind and report them to me together with their current location!

(C) Helger Lipmaa 1997-2009.