Fast server-aided RSA signatures secure against active attacks

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

Volumn 963, Issue , 1995, Pages 57-69

  Béguin, Philippe ^a   Quisquater, Jean Jacques ^b  

^a ÉCOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER;

ACTIVE ATTACK; CHIP CARDS; CO-PROCESSORS; COMPUTING POWER; CRYPTOPROTOCOLS; EFFICIENT PROTOCOLS; PASSIVE ATTACKS; RSA SIGNATURES;

CRYPTOGRAPHY;

EID: 84957639068     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44750-4_5     Document Type: Conference Paper

References (16)

1. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Addison-Wesley, Reading, Mass. (1974).
2. Anderson, R. J.: Attack on server-assisted authentication protocols. Electronic Letters (1992) p. 1473.
3. Béguin, P., Quisquater, J.-J.: Secure acceleration of DSS signatures using insecure server. In Proceedings of Asiacrypt '94 (To appear).
4. Brickell, E., Gordon, D. M., McCurley, K. S., Wilson, D.: Fast exponentiation with precomputation. In Advances in Cryptology - Proceedings of Eurocrypt '92 (1993) Lecture Notes in Computer Science vol. 658 Springer-Verlag pp. 200-207.
5. Burns, J., Mitchell, C. J.: Parameter selection for server-aided RSA computation schemes. IEEE Transactions on computers 43 (1994) pp. 163-174.
6. Kawamura, S., Shimbo, A.: Fast server-aided secret computation protocols for modular exponentiation. IEEE Journal on selected areas communications 11 (1993).
7. Lenstra, A. K., Lenstra, H. W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 241 (1982) pp. 515-534.
8. Lim, C. H., Lee, P. J.: More flexible exponentiation with precomputation. In Advances in Cryptology - Proceedings of Crypto '94 (1994) vol. Lecture Notes in Computer Science 839 Springer-Verlag pp. 95-107.
9. Lim, C. H., Lee, P. J.: Security and performance of server-aided rsa computation protocols. In this Proceedings.
10. Matsumoto, T., Imai, H., Laih, C.-S., Yen, S.-M.: On verifiable implicit asking protocols for RSA computation. In Advances in Cryptology - Proceedings of Auscrypt '92 (1993) Lecture Notes in Computer Science vol. 718 Springer-Verlag pp. 296-307.
11. Matsumoto, T., Kato, K., Imai, H.: Speeding up secret computation with insecure auxiliary devices. In Advances in Cryptology - Proceedings of Crypto '88 (1989) Lecture Notes in Computer Science vol. 403 Springer-Verlag pp. 497-506.
12. NIST: FIPS 186 for Digital Signature Standard (DSS).
13. Pfitzmann, B., Waidner, M.: Attacks on protocols for server-aided RSA computation. In Advances in Cryptology - Proceedings of Eurocrypt '92 (1993) Lecture Notes in Computer Science vol. 658 Springer-Verlag pp. 153-162.
14. Quisquater, J.-J., De Soete, M.: Speeding up smart card RSA computation with insecure coprocessors. In Proceedings of Smart Cards 2000 (1989) pp. 191-197.
15. Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21 (1978) pp. 120-126.
16. Yen, S.-M., Laih, C.-S.: More about the active attack on the server-aided secret computation protocol. Electronic Letters (1992) p. 2250.