VERIFIABLE SECRET SHARING SCHEME BASED ON INTEGER REPRESENTATION

Qassim Al Mahmoud
Additional contact information
Qassim Al Mahmoud: University of Bucharest, Romania

Journal of Information Systems & Operations Management, 2013, vol. 7, issue 2, 350-359

Abstract: In Shamir’s scheme that the security based on the numbers of the field of a prime number P which the coefficients' polynomial reduced to modulo P (takes a value from some field , where P is a large prime number). Thus, the adversary must know only the free coefficient of the polynomial in order to break the scheme. Our scheme which based on representation integer using the so-called expansion we can see any integer can build such polynomial so that the polynomial has degree of k, k being the length digits for that integer . Where the coefficients of that polynomial are taken from the set of , we will introduce a small participation improving Shamir’s scheme to share the secret S that will be seen constructed from the whole of the coefficients in the polynomial used, which is based on the representation integer. Then apply Pederson’s VSS scheme in order to improve our scheme to be Verifiable Secret Sharing Scheme Based on Integer Representation.

Keywords: Shamir scheme; information dispersal; integer representation; verifiable secret sharing (VSS) (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.rebe.rau.ro/RePEc/rau/jisomg/WI13/JISOM-WI13-A18.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rau:jisomg:v:7:y:2013:i:2:p:350-359

Access Statistics for this article

More articles in Journal of Information Systems & Operations Management from Romanian-American University Contact information at EDIRC.
Bibliographic data for series maintained by Alex Tabusca ().