Formalizing the Relationship Between Commitment and
Basic Cryptographic Primitives


S. Sree Vivek
1+, S. Sharmila Deva Selvi2, Pallavi Chandrasekar3, and C. Pandu Rangan4

 

1Pfizer Device R&D, Chennai, India

ssree.vivek@pfizer.com

2Microsoft Research, Bangalore, India

a-ssdeva@microsoft.com, sharmioshin@gmail.com

3Morgan Stanley, Bangalore, India

ccpallavi@gmail.com

4IIT Madras, Chennai, India

prangan@cse.iitm.ac.in

Abstract

Signcryption is a cryptographic primitive which offers the functionality of both digital signature and encryption with lower combined computational cost. On the other hand, commitment scheme allows an entity to commit to a value, where the entity reveals the committed value later during a decommit phase. In this paper, we explore the connection between commitment schemes, public key encryption, digital signatures and signcryption. We establish formal relationship between commitment and the other primitives. Our main result is that we show signcryption can be used as a commitment scheme with appropriate security notions. We show that if the underlying signcryption scheme is IND-CCA2 secure, then the hiding property of the commitment scheme is satisfied. Similarly, we show that if the underlying signcryption scheme is unforgeable, then the relaxed biding property of the commitment scheme is satisfied. Moreover, we prove that if the underlying signcryption scheme is NM-CCA2, then the commitment scheme is non-malleable. 

Keywords: Commitment schemes, Signcryption, Encryption, Digital signature, Chosen-ciphertext attack, Generic construction, Non-Malleable Commitment.

+: Corresponding author: S. Sree Vivek
No 51, Beach Home Avenue, II Street, Besant Nagar, Chennai-600090, Tel: +919894619816,
Web: http://sreevivek.page.tl

 

Journal of Internet Services and Information Security (JISIS), 6(4): 35-53, November 2016 [pdf]