Short threshold signature schemes without random oracles

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

Volumn 3797 LNCS, Issue , 2005, Pages 297-310

  Wang, Hong ^a   Zhang, Yuqing ^a   Feng, Dengguo ^a  

^a GRADUATE SCHOOL   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PRIVACY; COMPUTER SCIENCE; DATA PRIVACY; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

RANDOM ORACLES; SHORT THRESHOLD SIGNATURE; THRESHOLD CONSTRUCTION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33646831834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11596219_24     Document Type: Conference Paper

References (21)

1. M. Abe. Robust distributed multiplication without interaction. In Advances in Cryptology - CRYPTO'99, LNCS 1666, Springer-Verlag, pp. 130-147 (1999).
2. M. Abe, R. Cramer and S. Fehr. Non-interactive distributed-verifier proofs and proving relations among commitments. In Advances in Cryptology - ASIACRYPT 2002, LNCS 2501, Springer-Verlag, pp. 206-223 (2002).
3. M. Abe and S. Fehr. Adaptively secure Feldman VSS and applications to universally-composable threshold cryptography. In Advances in Cryptology CRYPTO 2004, LNCS 3152, Springer-Verlag, pp. 317-334 (2004).
4. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 201-209 (1989).
5. G.R. Blakley. Safeguarding cryptographic keys. In Proc. of AFIPS'79, pp. 313-317 (1979).
6. D. Boneh and X. Boyen. Short signatures without random oracles. In Advances in Cryptology - EUROCRYPT 2004, LNCS 3027, Springer-Verlag, pp. 56-73 (2004).
7. D. Boneh, X. Boyen and H. Shacham. Short group signatures. In Advances in Cryptology - CRYPTO 2004, LNCS 3152, Springer-Verlag, pp. 41-55 (2004).
8. R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Adaptive security for threshold cryptosystems. In Advances in Cryptology - CRYPTO'99, LNCS 1666, Springer-Verlag, pp. 98-115 (1999).
9. R. Canetti, O. Goldreich and S. Halevi. The random oracle methodology, revisited. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), pp. 209-218 (1998).
10. S.G. Choi. Traceable signatures based on bilinear pairings. Available at http://theory.snu.ac.kr/~sgchoi/sts.pdf (2004).
11. R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. ACM TISSEC, Vol. 3, No. 3, pp. 161-185 (2000).
12. R. Gennaro, S. Halevi and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Advances in Cryptology - EUROCRYPT'99, LNCS 1592, Springer-Verlag, pp. 123-139 (1999).
13. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology - EUROCRYPT'99, LNCS 1592, Springer-Verlag, pp. 295-310 (1999).
14. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Robust threshold DSS signatures. Information and Computation, Vol. 164, No. 1, pp. 54-84 (2001).
15. S. Goldwasser, S. Micali and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM J. Computing, Vol. 18, No. 1, pp. 186-208 (1989).
16. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, Vol. 17, No. 2, pp. 281-308 (1988).
17. T. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology - EUROCRYPT'91, LNCS 547, Springer-Verlag, pp. 522-526 (1991).
18. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - CRYPTO'91, LNCS 576, Springer-Verlag, pp. 129-140 (1991).
19. C. Peikert. On error correction in the exponent. Available at http://eprint.iacr.org/2005/105/ (2005).
20. A. Shamir. How to share a secret. Communications of the ACM, Vol. 22, No. 11, pp. 612-613 (1979).
21. L.R. Welch and E.R. Berlekamp. Error correction of algebraic block codes. U. S. Patent 4 633 470 (1983).