A STUDY ON THE EXISTING THRESHOLD CRYPTOGRAPHY TECHNIQUES
Main Article Content
Abstract
Threshold cryptography in simple words is the art of splitting a secret into many bits. The secret can be recreated only by possessing more than a threshold number of bits of the secret. The information is first encrypted and distributed among a cluster of fault tolerant computers. Encryption is done using a public key and the participating parties possess the corresponding private key. Thus for asymmetric key cryptography, threshold versions of encryptions can be built. In this paper we explore the various extensions and techniques of threshold cryptography.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
A. Shamir. How to share a secret. Commun. ACM, 22, pp. 612-613, November 1979.
B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults, FOCS85, pp. 383-395.
P. Feldman., A practical scheme for non-interactive variable secret sharing, 28th Annual Symposium on Foundations of Computer Science, pp. 427437. IEEE Computer Society, 1987.
T. P. Pedersen. A threshold cryptosystem without a trusted party. Advances in Cryptology EUROCRYPT '91, volume 547, pages 522-526. Springer-Verlag, 1991.
T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Advances in Cryptology CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129-140. Springer-Verlag, 1992.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure Applications of Pedersen‟s Distributed Key Generation Protocol. In CT-RSA, pages 373–390, 2003.
R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. Advances in Cryptology EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 295-310.Springer-Verlag, 1999.
R Canetti, R Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Adaptive Security for Threshold Cryptosystems. Advances in Cryptology-CRYPTO’99,pp 9-116
Y. Desmedt. Society and group oriented cryptography : a new concept. Advances in Cryptology, Proc. of Crypto '87), pp. 120-127. Springer-Verlag, 1988. Santa Barbara, California, U.S.A., August 16-20.
S Jarecki, A Lysyanskaya. Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures, Advances in Cryptology-EUROCRYPT 2000 pp 221-242
M Abe, S Fehr. Perfect NIZK with Adaptive Soundness. Cryptology ePrint Archive: Report 2006/423
M. Stadler. Publicly verifiable secret sharing. Advances in Cryptology-EUROCRYPT '96, pp. 190-199. Springer-Verlag, 1996.
E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly variable secret sharing and its applications. Advances in Cryptology EUROCRYPT '98, pp. 32-46. Springer-Verlag,1998.
S. Heidarvand and J. L. Villar. Public verifiability from pairings in secret sharing schemes. Selected Areas in Cryptography , SAC 2008, pp. 294-308. Springer, 2009.
Cong Zhang, Tsz Hon Yuen,HaoXiong, Sherman S. M. Chow, Siu Ming Yiu, Yi-Jun He, “Multi-Key Leakage-Resilient Threshold Cryptography†in ASIA CCS‟13 Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, pp. 61-70,2009
Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft, “Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting†in The Cryptographers‟ Track at the RSA Conference 2012, San Francisco, CA, USA, February 27 – March 2, 2012. Proceedings, pp 313-331, 2012
Nojoumian, Mehrdad, and Douglas R. Stinson. "On Dealer-free Dynamic Threshold Schemes."
Cho, Jin-Hee, Kevin S. Chan, Ing-Ray Chen, "Composite trust-based public key management in mobile ad hoc networks." in Proceedings of the 28th Annual ACM Symposium on Applied Computing, pp. 1949-1956.ACM, 2013.
H Dahshan and James Irvine, "On demand self-organized public key management for mobile ad hoc network,†in IEEE 69th Vehicular Technology Conference: VTC2009-Spring, 2009.
Ravleen Kaur, Pragya Kashmira, Kanak Meena, Dr. A.K.Mohapatra, "Survey on Different Techniques of Threshold Cryptography,†in IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) pp. 114-119