Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions

  • Rafael Pass
  • Hoeteck Wee
Conference paper

DOI: 10.1007/978-3-642-13190-5_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6110)
Cite this paper as:
Pass R., Wee H. (2010) Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg

Abstract

We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a black-box proof of security. As far as we know, this is the first construction of a constant-round non-malleable protocol based on only one-wayness, or to admit a black-box proof of security under any standard-type assumption.

Keywords

commitment schemes non-malleability complexity leveraging 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Rafael Pass
    • 1
  • Hoeteck Wee
    • 2
  1. 1.Cornell University 
  2. 2.Queens College, CUNY 

Personalised recommendations