Shadow generation protocol in linguistic threshold schemes

Communications in Computer and Information Science

Volumn 58, Issue , 2009, Pages 35-42

  Ogiela, Marek R ^a   Ogiela, Urszula ^a  

^a AGH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Poland)

Author keywords

Information management; Secret sharing; Threshold schemes

Indexed keywords

INFORMATION STRUCTURES; INPUT STRING; LINEAR CHARACTERISTICS; MANAGE INFORMATION; SECRET SHARING; SECRET SHARING ALGORITHM; SECRET-SPLITTING; SHARED SECRETS; THRESHOLD SCHEMES; USE CONTEXT;

ALGORITHMS; INFORMATION MANAGEMENT; LINGUISTICS; SECURITY OF DATA;

INFORMATION DISSEMINATION;

EID: 73349136579     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-10847-1_5     Document Type: Conference Paper

References (16)

1. Asmuth, C.A., Bloom, J.: A modular approach to key safeguarding. IEEE Transactions on Information Theory 29, 208-210 (1983)
2. Ateniese, G., Blundo, C., De Santis, A., Stinson, D.R.: Constructions and bounds for visual cryptography. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.1099, pp. 416-428. Springer, Heidelberg (1996)
3. Beguin, P., Cresti, A.: General short computational secret sharing schemes. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.921, pp. 194-208. Springer, Heidelberg (1995)
4. Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Transactions on Information Theory 40, 786-794 (1994)
5. Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the National Computer Conference, pp. 313-317 (1979)
6. Blakley, B., Blakley, G.R., Chan, A.H., Massey, J.: Threshold schemes with disenrollment. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.740, pp. 540-548. Springer, Heidelberg (1993)
7. Blundo, C., De Santis, A.: Lower bounds for robust secret sharing schemes. Inform. Process. Lett. 63, 317-321 (1997)
8. Charnes, C., Pieprzyk, J.: Generalised cumulative arrays and their application to secret sharing schemes. Australian Computer Science Communications 17, 61-65 (1995)
9. Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.435, pp. 307-315. Springer, Heidelberg (1990)
10. van Dijk, M.: On the information rate of perfect secret sharing schemes. Designs, Codes and Cryptography 6, 143-169 (1995)
11. Hang, N., Zhao, W.: Privacy-preserving data mining Systems. Computer 40(4), 52-58 (2007)
12. Jackson, W.-A., Martin, K.M., O'Keefe, C.M.: Ideal secret sharing schemes with multiple secrets. Journal of Cryptology 9, 233-250 (1996)
13. Ogiela, M.R., Ogiela, U.: Linguistic Extension for Secret Sharing (m, n)-threshold Schemes. In: SecTech 2008 - 2008 International Conference on Security Technology, Hainan Island, Sanya, China, December 13-15, pp. 125-128 (2008), ISBN: 978-0-7695- 3486-2, doi:10.1109/SecTech.2008.15
14. Shamir, A.: How to Share a Secret. Communications of the ACM, 612-613 (1979)
15. Simmons, G.J.: An Introduction to Shared Secret and/or Shared Control Schemes and Their Application in Contemporary Cryptology. In: The Science of Information Integrity, pp. 441-497. IEEE Press, Los Alamitos (1992)
16. Tang, S.: Simple Secret Sharing and Threshold RSA Signature Schemes. Journal of Information and Computational Science 1, 259-262 (2004)