A unified approach to secret sharing schemes with low distribution cost

Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an

Volumn 25, Issue 6, 2002, Pages 723-733

  Chien, Hung Yu ^a   Jan, Jinn Ke ^a   Tseng, Yuh Min ^b  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

^b NAN KAI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Cryptography; Secret sharing

Indexed keywords

BLOCK CODES; COST EFFECTIVENESS; DATA PROCESSING; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL SYSTEMS; SECURITY OF DATA;

SECRET HOLDER; SECRET SHARING;

CRYPTOGRAPHY;

EID: 0036853884     PISSN: 02533839     EISSN: 21587299     Source Type: Journal    
DOI: 10.1080/02533839.2002.9670746     Document Type: Article

References (43)

1. Ayanoglu, E., I, C.L., Citlin, R.D., and Mazo, J.E., “Diversity Coding:Using Error Control for Self-Healing in Communication Networks,”. Proceedings of Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. June5–7, San Francisco, CA. pp. 95–104.
2. Blakley, G.R., “Safeguarding Cryptographic Keys,”. Proceedings of the National Computer Conference. New York. Vol. 48, pp. 313–317. American Federation of Information Processing Societies.
3. Benaloh, J., and Leichter, J., 1990. “Generalized Secret Sharing and Monotone Functions,”. In Advances in Cryptology-EuroCrypt'90, 27–35. Springer-Verlag.
4. Bertilsson, M., and Ingemarsson, I., 1992. “A Construction of Practical Secret Sharing Schemes Using Linear Block Codes,”. In Advances in Cryptology-Auscrypt'92, 2–21. Springer-Verlag.
5. Chang, C.C., and Lee, H.C., 1993. “A New Generalized Group-oriented Cryptoscheme without Trusted Center,”. IEEE Journal on Selected Areas in Communications, 11 (5):725–729.
6. Chang, C.C., and Hwang, R. J., 1996. “Efficient Cheater Identification Method for Threshold Schemes,”. IEE Proceedings- Computers and Digital Techniques, 144 (1):23–27.
7. Chien, H.-Y., Jan, J.-K., and Tseng, Y.-M., 2000. “An Efficient Multi-secret Sharing Scheme,”. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A (12):2762–2765.
8. Chien, H.-Y., Jan, J.-K., and Tseng, Y.-M., “On the Generalized Threshold-Based Secret Sharing Schemes,”. 10th National Security Conference. HwaLan, Taiwan.
9. Denning, D.E.R., 1982. Cryptography and Data Security, Addison-Wesley.
10. Deng, R.H., Gong, L., Lazar, A.A., and Guo, W., “Authenticated Key Distribution and Secure Broadcast Using No Conventional Encryption:A Unified Approach Based on Block Codes,”. Proceedings of the IEEE GLOBE Telecommunication Conference 1995. pp. 1193–1197.
11. Elgamal, T., 1985. “A Public-Key Cryptosystem and A Signature Scheme Based on Discrete Logarithm,”. IEEE Transactions on Information Theory, 31:469–472.
12. Gong, L., “New Protocols for Third-Party-based Authentication and Secure Broadcast,”. Proceedings of 2nd ACM Conference on Computer and Communications Security. Fairfax, Virginia. pp. 176–183.
13. He, J., and Dawson, E., 1994. “Multistage Secret Sharing Based on One-Way Function,”. Electronics Letters, 30 (19):1591–1592.
14. Harn, L., 1995a. “Comment:Multistage Secret Sharing Based on One-Way Function,”. Electronics Letters, 31 (4):262
15. He, J., and Dawson, E., 1995. “Multi-Secret Sharing Scheme Based on One-Way Function,”. Electronics Letters, 31 (2):93–94.
16. Harn, L., 1995b. “Efficient Sharing (Broadcasting) of Multiple Secrets,”. IEE Proceedings-Computers and Digital Techniques, 142 (3):237–240.
17. Hwang, S.J., Chang, C.C., and Yang, W.P., 1996. “An Efficient Dynamic Threshold Scheme,”. IEICE Transactions on Information & Systems, E79-D (7):936–941.
18. Hwang, R.J., Lee, W.B., and Chang, C.C., 1999. “A Concept of Designing Cheater Identification Methods for Secret Sharing,”. The Journal of Systems and Software, 46:7–11.
19. Ito, Saito, and Nishizeki. 1987. “Secret Sharing Scheme Realizing General Access Structure,”. in Proceedings of the IEEE Global Telecommunications Conference,:99–102.
20. Jackson, W.A., Martin, K.M., and O'Keefe, C.M., 1994. “On Sharing Many Secrets,”. In Advances in Cryptology-Asiacrypt'94, 42–54. Springer-Verlag.
21. Karnin, Greene J.W., and Hellman, M.E., 1983. “On secret Sharing Systems,”. IEEE Transactions on Information Theory, IT-29:35–41.
22. Kothari, S.C., 1984. “Generalized Linear ThreshOld Schemes,”. In Advances in Cryptology-Crypto'84, LNCS 196, 231–241. Springer-Verlag.
23. Lin, S., and Costello, D.J., 1983. Jr. Error Control Coding:Fundamentals and Applications, Englewood Cliffs, NJ.:Prentice-Hall.
24. Lamport, L., 1981. “Password Authentication with Insecure Communication,”. Communications of the ACM, 24 (11):770–772.
25. Laih, C.S., Harn, L., Lee, J.Y., and Hwang, T.L., 1991. “Dynamic Threshold Scheme Based on the Definition of Cross-product in an N-dimensional Linear Space,”. In Advances in Cryptology-CRYPTO'89, Lecture Notes in Computer Science, No. 435 286–298. Springer-Verlag.
26. Lin, H.Y., and Harn, L., 1991. “A Generalized Secret Sharing Scheme with Cheater Detection,”. In Advances in Cryptology-AsiaCrypt'91, 83–87. Springer-Verlag.
27. Laih, C.S., and Harn, L., 1991. “Generalized Threshold Cryptosystems,”. In Advances in Cryptology-AsiaCrypt'91, 88–92. Springer-Verlag.
28. Morillo, P., Padro, C., Saez, G., and Villar, J.L., 1999. “Weighted Threshold Secret Sharing Schemes,”. Information Processing Letters 70 211–216.
29. NIST. 1992. “The Digital Signature Standard by NIST,”. Communications of the ACM, 35 (7):36–40.
30. Naor, M., and Yung, M., 1989. “Universal One-way Hash Functions and Their Cryptographic Applications,”. Proceedings of 21st Annual Symposium on Theory of Computing,:33–43.
31. Pinch, R.G.E., 1996. “Online Multiple Secret Sharing,”. Electronics Letters, 32 (12):1087–1088.
32. Shamir, A., 1979. “How to Share a Secret,”. Communications of the ACM, 22 (11):612–613.
33. Stinson, D.R., and Wei, R., 1999. “An application of Ramp Schemes to Broadcast Encryption,”. Information Processing Letters, 69:131–135.
34. Sun, H.M., and Shieh, S.P., 1998. “Secret Sharing in Graph-Based Prohibited Structures,”. Computers and Mathematics with Applications, 36 (7):131–140.
35. Sun, H.-M., and Shieh, S.-P., 1994. “On Dynamic Threshold Schemes,”. Information Processing Letters,:201–206.
36. Sun, H.M., 1999. “On-line Multiple Secret Sharing Based on a One-Way Function,”. Computer Communications, 22:745–748.
37. Tan, K.J., Zhu, H.W., and Gu, S.J., 1999. “Cheater Identification in (t n) Threshold Scheme,”. Computer Communications, 22:762–765.
38. Tsai, J.J., Hwang, T., and Wang, C.H., 1999. “New Generalized Group-Oriented Cryptosystem Based on Diffie-Hellman Scheme,”. Computer Communications, 22:727–729.
39. Tan, K.J., and Zhu, H.W., 1999. “General Secret Sharing Schemes,”. Computer Communications, 22:755–757.
40. Wu, T.C., and He, W.H., 1995. “A Geometric Approach for Sharing Secrets,”. Computers & Security, 14:135–145.
41. Wu, T.C., and Wu, T.S., 1995. “Cheating Detection and Cheater Identification in Secret Sharing Schemes,”. IEE Proceedings- Computers and Digital Techniques, 142:367–369.
42. Harn, L., Lin, H.Y., and Yang, S., 1994. “Thresh Old Cryptosystem with Multiple Secret Sharing Policies,”. IEE Proceedings- Computers and Digital Techniques, 141:142–144.
43. Lin, C.H., and Chang, C.C., 1994. “Method for Constructing a Group-Oriented Cipher System,”. Computer Communications, 17 (11):805–808.