Verifiable secret sharing for general access structures, with application to fully distributed proxy signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2742, Issue , 2003, Pages 286-302

  Herranz, Javier ^a   Sáez, Germán ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CRYPTOGRAPHIC SYSTEMS; DISTRIBUTED ENTITY; DISTRIBUTED PROXIES; GENERAL ACCESS STRUCTURE; SECRET SHARING SCHEMES; VERIFIABLE SECRET SHARING; VERIFIABLE SECRET SHARING SCHEME;

CRYPTOGRAPHY;

EID: 35248863570     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45126-6_21     Document Type: Article

References (21)

1. G.R. Blakley. Safeguarding cryptographic keys. Proceedings of the National Computer Conference, AFIPS'79, pp. 313-317 (1979).
2. E.F. Brickell. Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 9, pp. 105-113 (1989).
3. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. Proceedings of FOCS'87, IEEE Press, pp. 427-437 (1987).
4. P.A. Fouque and J. Stern. One round threshold discrete-log key generation without private channels. Proceedings of PKC'01, LNCS 1992, Springer-Verlag, pp. 190-206 (2001).
5. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Robust threshold DSS signatures. Advances in Cryptology-Eurocrypt'96, LNCS 1070, Springer-Verlag, pp. 354-371 (1996).
6. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. Advances in Cryptology-Eurocrypt'99, LNCS 1592, Springer-Verlag, pp. 295-310 (1999).
7. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. Proceedings of PODC'97, pp. 25-34 (1997).
8. M. Hwang, I. Lin and E.J. Lu. A secure nonrepudiable threshold proxy signature scheme with known signers. International Journal of Informatica, vol. 11, no. 2, pp. 1-8, (2000).
9. S. Kim, S. Park and D. Won. Proxy signatures, revisited. Proceedings of ICISC'97, pp. 223-232 (1997).
10. B. Lee, H. Kim and K. Kim. Strong proxy signature and its applications. Proceedings of SCIS'01, Vol. 2/2, pp. 603-608 (2001).
11. M. Mambo, K. Usuda and E. Okamoto. Proxy signatures: Delegation of the power to sign messages. IEICE Transactions Fundamentals, Vol. E79-A, No. 9, pp. 1338-1353 (1996).
12. T.P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. Advances in Cryptoplogy-Crypto'91, LNCS 576, Springer-Verlag, pp. 129-140 (1991).
13. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, Vol. 13, Num. 3, Springer-Verlag, pp. 361-396 (2000).
14. C.P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, Vol. 4, pp. 161-174 (1991).
15. B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its applications to electronic voting. Advances in Cryptology-Crypto'99, LNCS 1666, Springer-Verlag, pp. 148-164 (1999).
16. A. Shamir. How to share a secret. Communications of the ACM, No. 22, pp. 612-613 (1979).
17. Z. Shao. Proxy signature schemes based on factoring. Information Processing Letters, No. 85, pp. 137-143 (2003).
18. V. Shoup. Practical Threshold Signatures. Advances in Cryptology-Eurocrypt'00, LNCS 1807, Springer-Verlag, pp. 207-220 (2000).
19. G. J. Simmons, W. Jackson and K. Martin. The geometry of secret sharing schemes. Bulletin of the ICA 1, pp. 71-88 (1991).
20. D.R. Stinson and R. Strobl. Provably secure distributed Schnorr signatures and a (t, n) threshold scheme for implicit certificates. Proceedings ACISP'01, LNCS 2119, Springer-Verlag, pp. 417-434, (2001).
21. K. Zhang. Threshold proxy signature scheme. Proceedings of the 1997 Information Security Workshop, Japan, pp. 191-197 (1997).