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

被引:35
作者
Ogiela, Marek R. [1 ]
Ogiela, Urszula [1 ]
机构
[1] AGH Univ Sci & Technol, PL-30059 Krakow, Poland
关键词
Mathematical foundations of cryptography; Secret sharing protocols; Strategic information management; Mathematical linguistics; Design of cryptographic algorithms;
D O I
10.1016/j.camwa.2010.02.028
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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, hi 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. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:267 / 271
页数:5
相关论文
共 16 条
[1]  
Ateniese G., 1996, LNCS, V1099, P416
[2]  
BEGUIN P, 1995, LECT NOTES COMPUTER, V921, P194
[3]   UNIVERSALLY IDEAL SECRET-SHARING SCHEMES [J].
BEIMEL, A ;
CHOR, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (03) :786-794
[4]  
Blakley G. R., 1980, Proceedings of the 1980 Symposium on Security and Privacy, P108
[5]  
Blakley G. R., 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK), P313, DOI 10.1109/MARK.1979.8817296
[6]   Lower bounds for robust secret sharing schemes [J].
Blundo, C ;
DeSantis, A .
INFORMATION PROCESSING LETTERS, 1997, 63 (06) :317-321
[7]  
Charnes C., 1995, Australian Computer Science Communications, V17, P61
[8]  
DESMEDT Y, 1990, LECT NOTES COMPUT SC, V435, P307
[9]  
HANG N, 2007, COMPUTER, V40, P52
[10]   Ideal secret sharing schemes with multiple secrets [J].
Jackson, WA ;
Martin, KM ;
OKeefe, CM .
JOURNAL OF CRYPTOLOGY, 1996, 9 (04) :233-250