Provably secure distributed schnorr signatures and a (T, n) threshold scheme for implicit certificates

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

Volumn 2119, Issue , 2001, Pages 417-434

  Stinson, Douglas R ^a,b   Strobl, Reto ^c  

^a Certicom Corp   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; SECURITY OF DATA;

CHOSEN MESSAGE ATTACKS; IMPLICIT CERTIFICATE; PROVABLY SECURE; SCHNORR SIGNATURE; SCHNORR SIGNATURE SCHEME; SIGNATURE SCHEME; THRESHOLD DIGITAL SIGNATURES; THRESHOLD SCHEMES;

AUTHENTICATION;

EID: 84958772823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47719-5_33     Document Type: Conference Paper

References (17)

1. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In First Annual ACM Conference on Computer and Communications Security, pages 62–73, 1993.
2. D. Brown. Implicitly certifying signatures securely. manuscript.
3. R. Gallant, D. Brown and S. Vanstone. Provably secure implicit certificate schemes. In Financial Cryptography’01, to appear.
4. Y. G. Desmedt. Threshold cryptography. European Trans. on Telecommunications, 5(4):449–457, 1994.
5. P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In 28th FOCS, pages 427–437, 1987.
6. S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity ofin teractive proofsy stems. SIAM J. on Computing, 18/1:186–308, 1989.
7. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Eurocrypt’99, pages 295–310, 1999.
8. S. K. Langford. Threshold DSS signatures without a trusted party. In Crypto’95, pages 397–409, 1995.
9. E. Okamoto, G. Davida, and M. Mambo. Some recent research aspects oft hreshold cryptography. In Workshop on Information Security Applications, 1997.
10. C. Park and K. Kurosawa. New elgamal type threshold digital signature scheme. IEICE Trans., E79-A:86–93, 1996.
11. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto’91, pages 129–140, 1991.
12. T. P. Pedersen. A threshold cryptosystem without a trusted party. In Eurocrypt’91, pages 522–526, 1991.
13. L. Pintsov and S. Vanstone. Postal revenue collection in the digital age. In Financial Cryptography’00, 2000.
14. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Eurocrypt’96, pages 387–399, 1996.
15. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161–174, 1991.
16. A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, 1979.
17. M. van Dijk. A linear construction ofsecret sharing schemes. Designs, Codes and Cryptography, 12:161–201, 1997.