Collusion attack resistance and practice-oriented threshold changeable secret sharing schemes

Proceedings - International Conference on Advanced Information Networking and Applications, AINA

Volumn , Issue , 2010, Pages 745-752

  Zhang, Xiujie ^a   He, Mingxing ^a  

^a XIHUA UNIVERSITY   (China)

Author keywords

Collusion attack; Communication rate; Partial broadcast channel; Threshold changeable secret sharing scheme

Indexed keywords

COLLUSION ATTACK; COMMUNICATION RATE; LONG LIFE; ON-LINE SERVICE; PARTIAL BROADCAST; SECRET RECONSTRUCTION; SECRET SHARING; SECRET SHARING SCHEMES; SECURE CHANNELS; SECURITY ANALYSIS; SHARE DISTRIBUTION PHASE; SHARED SECRETS; THRESHOLD PARAMETERS; THRESHOLD SCHEMES; THRESHOLD SECRET SHARING;

INTERNET PROTOCOLS;

BROADCASTING;

EID: 77954323664     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2010.56     Document Type: Conference Paper

References (18)

1. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, pp. 612-613, 1979.
2. G. R. Blakley, "Safeguarding cryptographic keys," in proc. AFIPS 1979 Nat. Comput. Conf., vol. 48, pp. 313-317, 1979.
3. R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, in proceedings of the 10th annual ACM symposium on Principles of distributed computing, pp. 51-59,1991.
4. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive secret sharing or: How to cope with perpetual leakage, in proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, Springer Verlag, pp. 339-352, 1995.
5. K. Martin, J. Pieprzyk, R. Safavi-Naini, and H. Wang, Changing thresholds in the absence of secure channels, J. Australian Comput., vol. 31,pp. 34-43, 1999.
6. A. Maeda, A. Miyaji, and M. Tada, Efficient and unconditionally secure verifiable threshold changeable scheme, in proceedings of ACISP(2001), Springer-Verlag, Sydney: Australia, vol 2119 of LNCS, pp. 402-416, July 2001.
7. R. Safavi-Naini and H. Wang, Secret sharing schemes with partial broadcast channels, manuscript, Des. Codes Cryptography.,vol. 41,pp. 5-22, 2006.
8. H. Wang, Wang D. S, "On Secret Reconstruction in Secret Sharing Schemes," IEEE Trans, Inf. Theory, vol. 54, pp. 473-480,2008.
9. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in proceedings of FOCS(1985),pp. 383-395,1985.
10. M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology, pp. 133-138, 1988.
11. C. Tang, Z. Liu, and Y. He, Non-interactive and informationtheoretic secure publicly verifiable secret sharing, Cryptology ePrint Archive, Report 2004/201, 2004. http://eprint.iacr.org/.
12. R. Steinfeld, H. Wang, and J. Pieprzyk, "Lattice-based threshold changeability for standard Shamir secret-sharing schemes," In Advances in Cryptology-Asiacrypt'04, Lncs, vol. 3329,pp. 170-186,2004.
13. C. Tartary, and H. Wang, Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme,in Inscrypt, vol. 4318 of LNCS, Springer, pp. 103-117,2006.
14. T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley-interscience,1991.
15. R. Steinfeld, J. Pieprzyk, and H. Wang, "Lattice-based threshold changeability for standard CRT secret-sharing schemes," Finite Fields and Their Applications, vol. 2, pp. 653-680,2006.
16. C. Asmuth and J. Bloom, A modular approach to key safeguarding. IEEE Transactions on Information Theory, IT-29(2): 208-210, March 1983.
17. T. Lou and C. Tartary,Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes, in Cryptology and Network Security,Springer,Vol. 5339/2008, pp. 196-213, 2008.
18. K. Martin, J. Pieprzyk, R. Safavi-Naini, H. Wang, Bounds and techniques for efficient redistribution of secret shares to new access structures, The Computer Journal, vol. 42, pp. 638-649,1999.