Abstract
This publication will present a new approach how to extend well-known algorithms of secret sharing, towards another stage of information encoding with the use of the grammar formalism. Such an algorithm would be based on the appropriate sequential LALR grammars allowing shared bit sequences, and more generally blocks of several bits, to be changed into new representations, namely sequences of production numbers of the introduced grammar. This stage can be executed by a trusted third party or arbiter generating shadows of the secret. Such methods would form an additional stage improving the security of shared data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asmuth, C.A., Bloom, J.: A modular approach to key safeguarding. IEEE Transactions on Information Theory 29, 208–210 (1983)
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)
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)
Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Transactions on Information Theory 40, 786–794 (1994)
Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of the National Computer Conference, pp. 313–317 (1979)
Blakley, G.R.: One-time pads are key safeguarding schemes, not cryptosystems: fast key safeguarding schemes (threshold schemes) exist. In: Proceedings of the 1980 Symposium on Security and Privacy, pp. 108–113. IEEE Press, Los Alamitos (1980)
Blundo, C., De Santis, A.: Lower bounds for robust secret sharing schemes. Inform. Process. Lett. 63, 317–321 (1997)
Charnes, C., Pieprzyk, J.: Generalised cumulative arrays and their application to secret sharing schemes. Australian Computer Science Communications 17, 61–65 (1995)
Desmedt, Y., Frankel, Y.: Threshold Cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307–315. Springer, Heidelberg (1990)
Hang, N., Zhao, W.: Privacy-preserving data mining Systems. Computer 40, 52–58 (2007)
Jackson, W.-A., Martin, K.M., O’Keefe, C.M.: Ideal secret sharing schemes with multiple secrets. Journal of Cryptology 9, 233–250 (1996)
Ogiela, M.R., Ogiela, U.: Linguistic Cryptographic Threshold Schemes. International Journal of Future Generation Communication and Networking 1(2), 33–40 (2009)
Shamir, A.: How to Share a Secret. Communications of the ACM, 612–613 (1979)
Simmons, G.J.: An Introduction to Shared Secret and/or Shared Control Schemes and Their Application in Contemporary Cryptology. The Science of Information Integrity, pp. 441–497. IEEE Press, Los Alamitos (1992)
Tang, S.: Simple Secret Sharing and Threshold RSA Signature Schemes. Journal of Information and Computational Science 1, 259–262 (2004)
Wu, T.-C., He, W.-H.: A geometric approach for sharing secrets. Computers and Security 14, 135–146 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ogiela, M.R., Ogiela, U. (2009). Security of Linguistic Threshold Schemes in Multimedia Systems . In: Damiani, E., Jeong, J., Howlett, R.J., Jain, L.C. (eds) New Directions in Intelligent Interactive Multimedia Systems and Services - 2. Studies in Computational Intelligence, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02937-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-02937-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02936-3
Online ISBN: 978-3-642-02937-0
eBook Packages: EngineeringEngineering (R0)