A signcryption scheme based on integer factorization

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

Volumn 1975, Issue , 2000, Pages 308-322

  Steinfeld, Ron ^a   Zheng, Yuliang ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FACTORIZATION; SECURITY OF DATA;

COMMUNICATION OVERHEADS; CRYPTOGRAPHIC PRIMITIVES; INTEGER FACTORIZATION; INTEGER FACTORIZATION PROBLEM; PUBLIC KEYS; RANDOM ORACLE MODEL; SIGNCRYPTION; SIGNCRYPTION SCHEMES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84944242785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44456-4_23     Document Type: Conference Paper

References (15)

1. M. Bellare, A. Boldyreva, and S. Micali. Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. In EUROCRYPT 2000, volume 1807 of LNCS, pages 259-274, Berlin, 2000. Springer-Verlag.
2. D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In CRYPTO'97, volume 1294 of LNCS, pages 425-439, Berlin, 1997. Springer-Verlag.
3. S. Cavallar et al. Factorization of a 512-Bit RSA Modulus. In EUROCRYPT 2000, volume 1807 of LNCS, pages 1-18, Berlin, 2000. Springer-Verlag.
4. U. Feige and A. Shamir. Witness Indistinguishable and Witness Hiding Protocols. In Proc. 22-nd STOC, pages 416-426. ACM, 1990.
5. FIPS 186-2, Digital Signature Standard. Federal Information Processing Standards Publication 186-2, 2000. Available from http://csrc.nist.gov/.
6. M. Girault. Self-Certified Public Keys. In EUROCRYPT '91, volume 547 of LNCS, pages 490-497, Berlin, 1992. Springer-Verlag.
7. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure against Adaptively Chosen Message Attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
8. A. Lenstra and E. Verheul. Selecting Cryptographic Key Sizes. In PKC2000, volume 1751 of LNCS, pages 446-465, Berlin, 2000. Springer-Verlag.
9. D. Pointcheval. The Composite Discrete Logarithm and Secure Authentication. In PKC2000, volume 1751 of LNCS, pages 113-128, Berlin, 2000. Springer-Verlag.
10. D. Pointcheval and J. Stern. Security Arguments for Digital Signatures and Blind Signatures. J. of Cryptology, 1999. Available from http://www.di.ens.fr/_pointche.
11. G. Poupard and J. Stern. Security Analysis of a Practical "on the fly" Authentication and Signature Generation. In EUROCRYPT'98, volume 1403 of LNCS, pages 422-436, Berlin, 1998. Springer-Verlag.
12. G. Poupard and J. Stern. Short Proofs of Knowledge for Factoring. In PKC 2000, volume 1751 of LNCS, pages 147-166, Berlin, 2000. Springer-Verlag.
13. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In CRYPTO'89, volume 435 of LNCS, pages 239-251, Berlin, 1990. Springer-Verlag.
14. SEC2. Recommended Elliptic Curve Domain Parameters, September 2000. Standards for Efficient Cryptography Group. Available from http://www.secg.org/.
15. Y. Zheng. Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption). In CRYPTO'97, volume 1294 of LNCS, pages 165-179, Berlin, 1997. Springer-Verlag.