Security of Linguistic Threshold Schemes in Multimedia Systems
作者： Marek R. Ogiela , Urszula Ogiela
DOI: 10.1007/978-3-642-02937-0_2
关键词: Grammar 、 Rule-based machine translation 、 Computer science 、 Arbiter 、 Theoretical computer science 、 LALR parser 、 Visual cryptography 、 Trusted third party 、 Secret sharing 、 Production (computer science)
摘要: This publication will present a new approach how to extend well-known algorithms of secret sharing, towards another stage information encoding with the use grammar formalism. Such an algorithm would be based on appropriate sequential LALR grammars allowing shared bit sequences, and more generally blocks several bits, changed into representations, namely sequences production numbers introduced grammar. can executed by trusted third party or arbiter generating shadows secret. methods form additional improving security data.
springer.com
sci-hub.st 参考文章(16)
Philippe Béguin, Antonella Cresti, General short computational secret sharing schemes theory and application of cryptographic techniques. pp. 194- 208 ,(1995) , 10.1007/3-540-49264-X_16
Giuseppe Ateniese, Carlo Blundo, Alfrede Santis, Douglas R. Stinson, Constructions and Bounds for Visual Cryptography international colloquium on automata languages and programming. pp. 416- 428 ,(1996) , 10.1007/3-540-61440-0_147
Matthew Hennessy, Robin Milner, On Observing Nondeterminism and Concurrency international colloquium on automata, languages and programming. pp. 299- 309 ,(1980) , 10.1007/3-540-10003-2_79
G. R. Blakley, One time Pads are Key Safegaurding Schemes, not Cryptosystems. Fast Key Safeguarding Schemes (Threshold Schemes) Exist. ieee symposium on security and privacy. pp. 108- 108 ,(1980) , 10.1109/SP.1980.10016
Wen-Ai Jackson, Keith M. Martin, Christine M. O'Keefe, Ideal secret sharing schemes with multiple secrets Journal of Cryptology. ,vol. 9, pp. 233- 250 ,(1996) , 10.1007/BF00189262
Carlo Blundo, Alfredo De Santis, Lower bounds for robust secret sharing schemes Information Processing Letters. ,vol. 63, pp. 317- 321 ,(1997) , 10.1016/S0020-0190(97)00135-X
Wu Tzong-Chen, He Wei-Hua, Refereed paper: A geometric approach for sharing secrets Computers & Security. ,vol. 14, pp. 135- 145 ,(1995) , 10.1016/0167-4048(95)97047-E
C. Asmuth, J. Bloom, A modular approach to key safeguarding IEEE Transactions on Information Theory. ,vol. 29, pp. 208- 210 ,(1983) , 10.1109/TIT.1983.1056651
Adi Shamir, How to share a secret Communications of the ACM. ,vol. 22, pp. 612- 613 ,(1979) , 10.1145/359168.359176
A. Beimel, B. Chor, Universally ideal secret-sharing schemes IEEE Transactions on Information Theory. ,vol. 40, pp. 786- 794 ,(1994) , 10.1109/18.335890