A Novel (t,n) Secret Sharing Scheme Based upon Euler’s Theorem
Joint Authors
Source
Security and Communication Networks
Issue
Vol. 2019, Issue 2019 (31 Dec. 2019), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2019-04-01
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Information Technology and Computer Science
Abstract EN
The t,n secret sharing scheme is used to protect the privacy of information by distribution.
More specifically, a dealer splits a secret into n shares and distributes them privately to n participants, in such a way that any t or more participants can reconstruct the secret, but no group of fewer than t participants who cooperate can determine it.
Many schemes in literature are based on the polynomial interpolation or the Chinese remainder theorem.
In this paper, we propose a new solution to the system of congruences different from Chinese remainder theorem and propose a new scheme for t,n secret sharing; its secret reconstruction is based upon Euler’s theorem.
Furthermore, our generalized conclusion allows the dealer to refresh the shared secret without changing the original share of the participants.
American Psychological Association (APA)
Chen, Hefeng& Chang, Chin-Chen. 2019. A Novel (t,n) Secret Sharing Scheme Based upon Euler’s Theorem. Security and Communication Networks،Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1210306
Modern Language Association (MLA)
Chen, Hefeng& Chang, Chin-Chen. A Novel (t,n) Secret Sharing Scheme Based upon Euler’s Theorem. Security and Communication Networks No. 2019 (2019), pp.1-7.
https://search.emarefa.net/detail/BIM-1210306
American Medical Association (AMA)
Chen, Hefeng& Chang, Chin-Chen. A Novel (t,n) Secret Sharing Scheme Based upon Euler’s Theorem. Security and Communication Networks. 2019. Vol. 2019, no. 2019, pp.1-7.
https://search.emarefa.net/detail/BIM-1210306
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1210306