The week's pick
Random Articles
Reseach Article
An Explication of Multifarious Secret Sharing Schemes
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 46 - Number 19 |
| Year of Publication: 2012 |
| Authors: Sonali Patil, Prashant Deshmukh |
10.5120/7047-9402
|
Sonali Patil, Prashant Deshmukh . An Explication of Multifarious Secret Sharing Schemes. International Journal of Computer Applications. 46, 19 ( May 2012), 5-10. DOI=10.5120/7047-9402
Abstract
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and functionality as per the need of an application. Secret Sharing has been an active research field for many years. Various secret sharing techniques have been developed to secure data, but there is a need to implement a secret sharing scheme with all augmented capabilities like general access structure, robustness against cheating shareholders, verifiability of the shares, proactive redistribution of shares etc. The intent of this paper is to explain the extended capabilities of secret sharing schemes and analyze the relation in application semantics and multifarious secret sharing schemes.
References
- D. R. Stinson, "Cryptography: Theory and Practice", CRC Press, Boca Raton 1995.
- Menezes, A. , P. Van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996, pp. 524-528
- E. D. Karnin, J. W. Greene, and M. E. Hellman, "On secret sharing systems," vol. IT-29, no. 1, pp. 35–41, Jan. 1983.
- P. Paillier, "On ideal non-perfect secret sharing schemes," in Security Protocols Workshop, 1997, pp. 207–216.
- Shamir, A. , "How to Share a Secret", Communications of the ACM, vol. 22, no. 11, 1979.
- G. Blakely, "Safeguarding cryptographic keys", presented at the Proceedings of the AFIPS 1979 National Computer Conference, vol. 48, Arlington, VA, June 1997, pp. 313–317.
- Chunming Tang, Zheng-an Yao, "A New (t, n)-Threshold Secret Sharing Scheme", International Conference on Advanced Computer Theory and Engineering, IEEE 2008 p. 920-924.
- Yung-Chen Chou, Chih-Hung Lin, Pao-Ching Li, Yu-Chiang Li, "A (2, 3) Threshold Secret Sharing Scheme Using Sudoku", Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IEEE 2010.
- Runhua Shi, Hong Zhong, "A Secret Sharing Scheme with the Changeable Threshold Value", International Symposium on Information Engineering and Electronic Commerce, IEEE 2009 p. 233-236.
- Chao-Wen Chan, Chin-Chen Chang, Zhi-Hui Wang, "Cheating Resistance for Secret Sharing", International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009 IEEE p. 840-846.
- Mitsuru Ito, Akira Saito, Takao Nishizeki, "Secret Sharing Scheme: Realizing General Access Structure", GLOBECOM IEEE 1987.
- K. Srinathan, N. Tharani Rajan, and C. Pandu Rangan, "Non-perfect secret sharing over general access structures," in INDOCRYPT, 2002, pp. 409–421.
- Benaloh, J. , and J. Leichter, Generalized secret sharing and monotone functions, CRYPTO '88, Springer Verlag, pp. 27-35.
- Pang, L. -J. , Li, H. -X. , Wang, Y. -M. , "A secure and efficient secret sharing scheme with general access structures", Lecture Notes in Computer Science v 4223 LNAI, Fuzzy Systems and Knowledge Discovery - Third International Conference, FSKD 2006, Proceeding 2006, p. 646-649.
- Sai-zhi Ye, Guo-xiang Yao, Quan-long Guan, "A multiple secret sharing scheme with general access structure, International Symposium on Intelligent Ubiquitous Computing and Education, 2009 IEEE.
- Stadler, M. , "Publicly verifiable secret sharing", Lecture notes in Computer Science, 1997, 190-199.
- P. Feldman, A practical scheme for non-interactive verifiable secret sharing. IEEE Symposium on Foundations of Computer Science, pages 427--437. IEEE, 1987
- Rabin, T. , and M. Ben-Or, Verifiable secret sharing and multiparty protocols with honestmajority, Proceedings of the 21st ACM Symposium on the Theory of Computing, 1989, pp. 73-85.
- T. P. Pedersan, "Non-Intractive and Information-Theoretic Secure Verifiable Secret Sharing", Lecture notes in Comuter Science, 1992, pp. 129-140 (Advances in Cryptology – CRYPTO' 91).
- C. Dwork, "On verification in Secret Sharing", Lecture notes in Comuter Science, 1992, pp. 114-128 (Advances in Cryptology – CRYPTO' 91).
- Tompa, M. , and Woll, H. "How to share a secret with cheaters", Journal of Cryptology, Vol. 1, No. 2, 1998, pp. 133-138.
- M. Stadler, "Publicly Verifiable Secret Sharing", Lecture notes in Computer Science, 1997, 190-199 (Advances in Crptology – EUROCRYPT'96).
- Jia Yu, Fanyu Kong, Rong Hao, Zhen Cheng, "A Publicly Verifiable Dynamic Sharing Protocol for Data Secure Storage", Ninth International Conference on Web-Age Information Management 2008 IEEE.
- Chin-Chen Chang, Chao-Wen Chan, "Detecting Dealer Cheating in Secret Sharing Systems", Proceedings of the Twenty-Fourth Annual International Computer Software & Applications Conference (COMPSAC'00), IEEE 2000.
- Yongquan CAI, Xiaofeng REN, "A Cheat-proof Rational Secret Sharing Scheme", Journal of Computational Information Systems, (2011) p. 88-96, January 2011.
- Bai, L. and Zou, X. (2009) 'A Proactive Secret Sharing Scheme in matrix projection method', Int. J. Security and Networks, Vol. 4, No. 4, pp. 201–209.
- Zhengjun Cao, Olivier Markowitch, "Two Optimum Secret Sharing Schemes Revisited", International Seminar on Future Information Technology and Management Engineering, 2008 IEEE, p. 157-160.
- Jia Yu, Fanyu Kong, Rong Hao, "Publicly Verifiable Secret Sharing with Enrollment Ability", ACIS, IEEE 2007.
Index Terms
Keywords