The use of mathematical linguistic methods in creating secret sharing threshold algorithms

Authors:
Marek R. Ogiela;Urszula Ogiela
Affiliations:
AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059 Kraków, Poland;AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059 Kraków, Poland
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 9
Cited 3

Lower bounds for robust secret sharing schemes

Information Processing Letters
How to share a secret

Communications of the ACM
Contemporary Cryptology: The Science of Information Integrity

Contemporary Cryptology: The Science of Information Integrity
Constructions and Bounds for Visual Cryptography

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Privacy-Preserving Data Mining Systems

Computer
Modern Computational Intelligence Methods for the Interpretation of Medical Images

Modern Computational Intelligence Methods for the Interpretation of Medical Images
General short computational secret sharing schemes

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Universally ideal secret-sharing schemes

IEEE Transactions on Information Theory

Linguistic protocols for secure information management and sharing

Computers & Mathematics with Applications
Cognitive informatics in image semantics description, identification and automatic pattern understanding

Neurocomputing
Cognitive systems and bio-inspired computing in homeland security

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

This publication discusses new opportunities for creating threshold schemes for secret sharing arising from the use of mathematical linguistic formalisms. Such methods are based on known threshold schemes of information splitting extended by adding an extra stage at which bit blocks of the shared information are coded using suitably defined context-free grammars. In practice, this will help with developing new algorithms, which besides allowing information sharing will also make it possible to obtain protocols for the confidential exchange of this information with or without involving a trusted instance. Such protocols will contribute to the development of modern cryptographic techniques and future computer science.