An efficient and secure fault-tolerant conference-key distribution scheme

IEEE Transactions on Consumer Electronics

Volumn 50, Issue 2, 2004, Pages 571-575

  Guo, Yuanbo ^a   Ma, Jianfeng ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA;

CONFERENCE KEY DISTRIBUTION; DIFFIE-HELLMAN DECISIONAL PROBLEM; RANDOM ORACLE MODEL; VERIFIABLE SECRET SHARING; ZERO KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 4043128259     PISSN: 00983063     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCE.2004.1309426     Document Type: Article

References (6)

1. T. Wen-Guey, "A secure fault-tolerant conference-key agreement protocol," IEEE Trans. Computers, vol. 51, no.4, pp. 373-379, Apr. 2002
2. M. Burmester and Y. Desmedt, A secure and efficient conference key distribution system, Lecture Notes in Computer Science, vol 950, pp. 427-437, 1994
3. P. Feldman, A Practical Scheme for Non-interactive Verifiable Secret Sharing, Proc. 28th IEEE Annual Symposium on Foundations of Computer Science, pp. 427-437, Oct. 1987
4. A. Shamir. How to Share a Secret. Communications of the ACM, vol. 22, no. 11, pp. 612-613, Nov. 1979.
5. D. Chaum and T. Pedersen, Wallet Databases with Observers, Lecture Notes in Computer Science, vol 740, pp. 89-105, 1992
6. D. Boneh. The decision Diffie-Hellman problem. Lecture Notes in Computer Science, vol 1423, pp. 48-63, 1998