Abuse-Free Optimistic Contract Signing Using RSA for Multiuser Systems

Автор: Santosh Bharadwaj Rangavajjula, Tristan Claverie

Журнал: International Journal of Information Technology and Computer Science(IJITCS) @ijitcs

Статья в выпуске: 5 Vol. 9, 2017 года.

Бесплатный доступ

Multi-party contract signing (MPCS) is a way for signers to agree on a predetermined contract by exchanging their signature. This matter has become crucial with the growing number of communications. In this paper, we focus mainly on studying the state of the art protocols and more specifically the cryptography involved. We identify the major advances in MPCS, highlight a few gaps with the current protocols and propose an algorithm for contract signing to be abuse-free, optimistic for many signers in industrial standards.

Contract Signing, Abuse-free, optimistic, multi-user, RSA

Короткий адрес: https://sciup.org/15012642

IDR: 15012642

Текст научной статьи Abuse-Free Optimistic Contract Signing Using RSA for Multiuser Systems

Published Online May 2017 in MECS

  • B.    Background

We are interested in the notion of abuse-freeness as defined in [1]. A protocol is abuse-free if no group of signer can prove that he holds the power to complete or abort the contract signature. Garay et al. introduce a new cryptographic object called Private Contract Signature in [1] based on ElGa- mal cryptosystem [2] and use it to define a two- party contract signing and a three-party contract signing. These constructions are proven to be fair, optimistic and abuse-free. In [3] an optimistic protocol for exchanging fairly signatures was proposed by Asokan et al.. Mukhamedov et al. proposed another optimistic MPCS for any number of signers in [4] also base on private contract signatures. Wang proposed an abuse-free, optimistic two-party contract signing in [5] using RSA and trapdoor commitment schemes [6]. Kordy et al. proved an equivalence between a mathematical sequence and the fairness of an MPCS protocol in [7], it is based on private contract signature. The obtained protocol is abuse-free, optimistic, fair and efficient because it reaches the lower bounds in terms of bandwidth and message complexity determined by Garay et al. in [8]. In [9] Mauw et al. extend the work of Kordy et al. using a labeled DAG instead of a linear sequence, and achieving as well an optimistic abuse- free fair and efficient MPCS.

  • C.    Objectives

A common point to optimistic MPCS is that at some point, a commitment is exchanged before sending the signature. This paper focuses on finding an MPCS protocol which is abuse-free, optimistic and fair for any number of signers. A secondary objective is its efficiency, i.e. it has to be usable in practice without heavy computation and should stick to the RSA industry standard.

  • D.    Results

In this paper, we find an alternative to Private Contract Signatures [1] using the newly discovered Certificatebased verifiably encrypted RSA signature scheme defined in [10]. We then propose an variation of the MPCS defined in [7] using this new scheme.

  • II.    Related Work

We conducted a systematic review about optimistic abuse-free contract signing. Juan et el [1] used El Gamal on the Private Contract Signature object. Although the protocol [1] proposed is fair, optimistic and abuse-free, it is applicable for a maximum of 3 signers. Also, El Gamal is not today’s industry standard. Barbara et el. [7]

converted a sequence of signers to a protocol specification, which made protocols be handled equally by Trusted Third Party (TTP). Also, Barbara et el. [7] did not prove the abuse-free property. Juan et el. [8] proposed a protocol that works for more than three signers. The problem with article [8] is that it was proven unfair if there are more than four signers. Sjouke et el. proposed a protocol, but the abuse-free property was not established. Also, the author uses El Gamal, which is not today’s industry standard. In [11], the author used BLS instead of El Gamal encryption scheme and proposed a protocol which is fair, abuse-free and also optimistic. The shortcoming in article proposed by Gao et el. is that it is only applicable for two signers. Wang et el. [5], used trapdoor commitment scheme with RSA keys to propose the protocol with abuse-freeness, optimism and fairness but it is only applicable for two signers. Villar et el. [12] used partial signature scheme with a variant of Boneh-Boyen which is also fair, abuse- free and optimistic but applicable only for two signers. Juan et el.,Wang et el.,Gao et el.,Li et el., Chen et el., Villar et el., [1], [5], [8], [11], [13], [14], [12] have successfully proven existence of abuse- freeness and therefore we can say that contract signing protocols can be be abuse-free. Juan et el., Barbara et el., Sjouke et el.,Li et el.,Villar et el, [1], [8], [7], [9], [13], [12] in their articles used Private contract signature objects which have limitations either concerning with properties or number of signers, therefore Private Contract signature may not be a solution for us. From articles written by Juan et el. and Li et el., [8], [13] we can say that contract signing protocols can have properties like abuse-freeness, optimism, fairness and can also have multiple signers but if number of signers are greater than or equal to four in Juan et el.’s [8] article, the fairness property might be broken. Also in Li et el.’s article [13] El Gamal is used which is not an industry standard. From explanations given by Wang et el. and Villar et el. [5], [14] we can say that RSA is compatible with some contract signing mechanisms used today and that gives us confidence in our research. We mainly focused on the different cryptographic primitives used rather than the protocols or their efficiency. In table 1, we summarized the results of reviewed literature. We highlighted some gaps in the current protocols, and we will strive to address one in further research.

Table 1. Results overview

Список литературы Abuse-Free Optimistic Contract Signing Using RSA for Multiuser Systems

  • Juan A. Garay, Markus Jakobsson, and Philip D. MacKen- zie. Abuse-free optimistic contract signing. In Michael J. Wiener, editor, Advances in Cryptology - CRYPTO ’99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceed- ings, volume 1666 of Lecture Notes in Computer Science, pages 449–466. Springer, 1999.
  • Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469–472, 1985.
  • N. Asokan, Victor Shoup, and Michael Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):593–610, 2000.
  • Aybek Mukhamedov and Mark Ryan. Improved multi- party contract signing. In Sven Dietrich and Rachna Dhamija, editors, Financial Cryptography and Data Se- curity, 11th International Conference, FC 2007, and 1st International Workshop on Usable Security, USEC 2007, Scarborough, Trinidad and Tobago, February 12-16, 2007. Revised Selected Papers, volume 4886 of Lecture Notes in Computer Science, pages 179–191. Springer, 2007.
  • G. Wang. An abuse-free fair contract-signing protocol based on the rsa signature. IEEE Transactions on Infor- mation Forensics and Security, 5(1):158–168, 2010. cited By 24.
  • M. Fischlin. Trapdoor Commitment Schemes and Their Applications, 2001. cited By 22.
  • Barbara Kordy and Saša Radomirovi c´. Constructing opti- mistic multi-party contract signing protocols. In Stephen Chong, editor, 25th IEEE Computer Security Foundations Symposium, CSF 2012, Cambridge, MA, USA, June 25-27, 2012, pages 215–229. IEEE, 2012.
  • Juan A. Garay and Philip D. MacKenzie. Abuse-free multi-party contract signing. In Prasad Jayanti, editor, Distributed Computing, 13th International Symposium, Bratislava, Slavak Republic, September 27-29, 1999, Pro- ceedings, volume 1693 of Lecture Notes in Computer Science, pages 151–165. Springer, 1999.
  • Sjouke Mauw and Sasa Radomirovic. Generalizing multi- party contract signing. In Riccardo Focardi and Andrew C. Myers, editors, Principles of Security and Trust - 4th International Conference, POST 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings, volume 9036 of Lecture Notes in Computer Science, pages 156–175. Springer, 2015.
  • Z. Shao and Y. Gao. Certificate-based verifiably encrypted rsa signatures. Transactions on Emerging Telecommunica- tions Technologies, 26(2):276–289, 2015. cited By 0.
  • W. Gao, F. Li, and B. Xu. An abuse-free optimistic fair exchange protocol based on bls signature. volume 2, pages 278–282, 2008. cited By 3.
  • A.A. Al-Saggaf and L. Ghouti. Efficient abuse-free fair contract-signing protocol based on an ordinary crisp com- mitment scheme. IET Information Security, 9(1):50–58, 2015. cited By 0.
  • X. Li, Z. Wang, L. Chen, and Q. Wang. A multi-party contract signing protocol and its formal analysis in strand space model. volume 3, pages 556–559, 2009. cited By 0.
  • S. Heidarvand and J.L. Villar. A fair and abuse-free contract signing protocol from boneh-boyen signature. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6711 LNCS:125–140, 2011. cited By 1.
  • X. Chen, F. Zhang, H. Tian, Q. Wu, Y. Mu, J. Kim, and K. Kim. Three-round abuse-free optimistic contract signing with everlasting secrecy. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6052 LNCS:304–311, 2010. cited By 4.
  • Kyungkeun Lee, Joonghyo Oh, and Sangjae Moon. How to generate universally verifiable signatures in ad-hoc net- works, 2005.
Еще
Статья научная