AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

Breaking Mignotte’s Sequence based Secret Sharing Scheme Using SMT Solver


Affiliations
1 Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India
 

The secret sharing schemes are the important tools in cryptography that are used as building blocks in many secured protocols. It is a method used for distributing a secret among the participants in a manner that only the threshold number of participants together can recover the secret and the remaining set of participants cannot get any information about the secret. Secret sharing schemes are absolute for storing highly sensitive and important information. In a secret sharing scheme, a secret is divided into several shares. These shares are then distributed to the participants’ one each and thus only the threshold (t) number of participants can recover the secret. In this paper we have used Mignotte’s Sequence based Secret Sharing for distribution of shares to the participants. A (k, m) Mignotte's sequence is a sequence of pair wise co-prime positive integers. We have proposed a new method for reconstruction of secret even with t-1 shares using the SMT solver.

Keywords

Secret Sharing, Data Security, Mignotte’s Sequence, SMT Solver, Satisfiability.
User
Notifications
Font Size

  • Beimel. Secure Schemes For Secret Sharing And Key Distribution. Phd Thesis, Technion,1996.

  • Www.Cs.Bgu.Ac.Il/ Beimel/Pub.Html.

  • Cheng Gu, And Chin-Chen Chang,“ A Construction For Secret Sharing Scheme With General Access Structure” , Journal Of Information Hiding And Multimedia Signal Processing Ubiquitous International Volume 4, Number 1, January 2013 2013 Issn 2073-4212

  • Sonalipatil, Kapil Tajane, Janhavi Sirdeshpande, “An Explication Of Secret Sharing Schemes With General Access Structure” International Journal Of Advances In Engineering & Technology, Volume 6, Issue 2, Pp. 883-887, May 2013. Issn: 2231-1963

  • G. Blakley, “Safeguarding Cryptographic Keys,” In Proceedings Of The National Computer Conference (Afips 1979), Pp. 313–317, 1979.

  • A. Shamir. How To Share A Secret. Communications Of The Acm, 22:612-613, 1979.

  • L. De Moura And N. Bjørner. Efficient E-Matching For Smt Solvers. In Cade’07. Springer-Verlag, 2007.

  • L. De Moura And N. Bjørner. Model-Based Theory Combination. In Smt’07, 2007.


Abstract Views: 358

PDF Views: 144




  • Breaking Mignotte’s Sequence based Secret Sharing Scheme Using SMT Solver

Abstract Views: 358  |  PDF Views: 144

Authors

K. Vishnu Priyanka
Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India
M. Gowthami
Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India
O. Susmitha
Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India
G. Prathyusha
Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India
Naresh Babu Muppalaneni
Department of CSSE, Sree Vidyanikethan Engineering College (Autonomous), India

Abstract


The secret sharing schemes are the important tools in cryptography that are used as building blocks in many secured protocols. It is a method used for distributing a secret among the participants in a manner that only the threshold number of participants together can recover the secret and the remaining set of participants cannot get any information about the secret. Secret sharing schemes are absolute for storing highly sensitive and important information. In a secret sharing scheme, a secret is divided into several shares. These shares are then distributed to the participants’ one each and thus only the threshold (t) number of participants can recover the secret. In this paper we have used Mignotte’s Sequence based Secret Sharing for distribution of shares to the participants. A (k, m) Mignotte's sequence is a sequence of pair wise co-prime positive integers. We have proposed a new method for reconstruction of secret even with t-1 shares using the SMT solver.

Keywords


Secret Sharing, Data Security, Mignotte’s Sequence, SMT Solver, Satisfiability.

References