Efficient revocation and threshold pairing based cryptosystems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 163-171

  Libert, Benoît ^a   Quisquater, Jean Jacques ^a  

^a B 1348   (Belgium)

Author keywords

Bilinear maps; Public key cryptosystems; Revocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; COMPUTER CRIME; COMPUTER SIMULATION; DATA COMPRESSION; DATABASE SYSTEMS; FUNCTIONS; NETWORK PROTOCOLS; SECURITY OF DATA;

BILINEAR MAPS; PUBLIC KEY CRYPTOSYSTEMS; REVOCATION;

CRYPTOGRAPHY;

EID: 1142293103     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872059     Document Type: Conference Paper

References (29)

1. st ACM Conference on Computer and Communications Secrurity, pages 62-73. ACM Press, 1993.
2. A. Boldyreva. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme. In Proceedings of PKC'03, Lecture Notes in Computer Science. Springer, 2003.
3. rd Workshop on Information Security Application, 2002.
4. th USENIX Security Symposium, USENIX, 2001.
5. D. Boneh and M. Franklin. Identity Based Encryption From the Weil Pairing. In Advances in Cryptology - Proceedings of Crypto'01, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer, 2001.
6. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology Proceedings of Asiacrypt'01, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer, 2001.
7. J. Cha and J. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups. In Proceedings of PKC'03, Lecture Notes in Computer Science. Springer, 2003.
8. C.-K. Chu, L. Liu, and W.-G. Tzeng. A Threshold GQ Signature Scheme, 2002. available at http://eprint.iacr.org/2003/016/.
9. X. Ding and G. Tsudik. Simple Identity-Based Cryptography with Mediated RSA. In Proceedings of CT-RSA '03, Lecture Notes in Computer Science. Springer, 2003.
10. P. Fouque and D. Pointcheval. Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks. In Advances in Cryptology - Proceedings of Asiacrypt'01, volume 2248 of Lecture Notes in Computer Science, pages 351-368. Springer, 2001.
11. E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. In Advances in Cryptology - Proceedings of CRYPTO'99, volume 1666 of Lecture Notes in Computer Science, pages 537-554, Springer, 1999.
12. E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP Is Secure under the RSA Assumption. In Advances in Cryptology - Proceedings of CRYPTO'01, volume 2139 of Lecture Notes in Computer Science, pages 260-274. Springer, 2001.
13. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Robust Threshold DSS Signatures. In Advances in Cryptology - Eurocrypt'96, volume 1070 of Lecture Notes in Computer Science, pages 354-371. Springer, 1996.
14. S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS 28(2): 270-299 (1984).
15. L. Guillou and J.-J. Quisquater. A "Paradoxical" Identity-Based Signature Scheme Resulting From Zero-Knowledge. In Advances in Cryptology Crypto'88, volume 0403 of Lecture Notes in Computer Science, pages 216-231. Springer, 1988.
16. F. Hess. Efficient identity based signature schemes based on pairings. In proceedings of SAC'02, Lecture Notes in Computer Science. Springer, 2002.
17. A. Joux and K. Nguyen. Separating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups, 2001. available at http://eprint.iacr.org/2001/003/.
18. J. Katz and M. Yung. Threshold Cryptosystems Based on Factoring. In Advances in Cryptology - proceedings of Asiacrypt 2002, Lecture Notes in Computer Science. Springer, 2002.
19. B. Lynn. Authenticated Identity-Based Encryption, 2002. available at http://eprint.iacr.org/2002/072/.
20. A. Menezes. Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1995.
21. nd STOC, pages 427-437. ACM Press, New York, 1990.
22. T. Okamoto and D. Pointcheval. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes. In Proc. of of PKC'01, volume 1992 of Lecture Notes in Computer Science. Springer, 2001.
23. C. Park and K. Kurosawa. New el gamal type threshold digital signature scheme. IEICE Trans., Vol.E79-A, No. 1 (1996) 86-93.
24. M. Rabin. Digital Signatures and Public Key Functions as Intractable as Factoring. Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
25. A. Shamir. Identity Based Cryptosystems and Signature Schemes. In Advances in Cryptology - Crypto' 84, volume 0196 of Lecture Notes in Computer Science. Springer, 1984.
26. V. Shoup. Practical threshold Signatures. In Advances in Cryptology - Eurocrypt'00, volume 1807 of Lecture Notes in Computer Science, pages 208-220. Springer, 2000.
27. V. Shoup and R. Gennaro. Securing Threshold Cryptosystems against Chosen Ciphertext Attack. In Advances in Cryptology - Eurocrypt'98, volume 1403 of Lecture Notes in Computer Science, pages 1-16. Springer, 1998.
28. N. Smart. An identity based authenticated key agreement protocol based on the weil pairing. Electronic Letters, 38(13): 630-632, 2002.
29. D. Stinson and R. Strobl. Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold scheme for Implicit Certificates. In proc. of ACISP'01, volume 2119 of Lecture Notes in Computer Science, pages 417-434. Springer, 2001.