V-fairness (t, n) secret sharing scheme

IEE Proceedings: Computers and Digital Techniques

Volumn 144, Issue 4, 1997, Pages 245-248

  Laih, C S ^a   Lee, Y C ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBABILITY; THRESHOLD LOGIC;

SECRET SHARING SCHEMES;

SECURITY OF DATA;

EID: 0031186622     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:19971223     Document Type: Article

References (8)

1. SHAMIR, A.: 'How to share a secret', Commun. ACM. 1979, 22, (11), pp. 612-613
2. BLAKLEY, G.R.: 'Safeguarding cryptographic keys'. Proceedings of National Computer Conference 1979, American Federation of Information Processing Societies, Montvale, NJ, 1979, Vol.48, pp. 313-317
3. LIN, H.Y., and HARN, L.: 'Fair reconstruction of a secret", Info. Process. Lett., 1995, 55, pp. 45-47
4. TOMPA, M., and WOLL, H.: 'How to share a secret with cheaters', J. Cryplol., 1988, 1, (2), pp. 133-138
5. BRICKLE, E.F., and STINSON, D.R.: The detection of cheaters in threshold schemes'. Advanced Cryptology, Proceedines of Crypto '88, (Sprineer-Verlas, I988), pp. 564-577
6. LAIH, C.S., LIN, M.D., and HWANG, T.: 'A new threshold scheme with detecting and exposing forged shadows'. Presented at the 1990 International Symposium on Information theory and its applications, Hawaii, USA, Nov. 1990, pp. 1053-1056
7. HE, J., and DAWSON, E.: 'How to fairly reconstruct a shared secret'. Cryptocraphy: Policy and Aleorithms Conference, Australia, 1995, ppT 381-390
8. RABIN, T., and BEN-OR, M.: 'Verifiable secret sharing and multiparty protocols with honest majority'. Proceedings of 21st ACM Symposium on the Theory of computing, 1989, pp. 73-85