Server-aided verification: Theory and practice

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

Volumn 3788 LNCS, Issue , 2005, Pages 605-623

  Girault, Marc ^a   Lefranc, David ^a  

^a ORANGE LABS   (France)

Author keywords

Bilinear map; Digital signature; Discrete logarithm; Identification protocol; Interactive proof; Non repudiation; Pairing; Zero knowledge

Indexed keywords

COMPUTATION THEORY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; IDENTIFICATION (CONTROL SYSTEMS); MATHEMATICAL MODELS; NETWORK PROTOCOLS; REAL TIME SYSTEMS;

BILINEAR MAP; DISCRETE LOGARITHMS; IDENTIFICATION PROTOCOLS; INTERACTIVE PROOF; NON-REPUDIATION; PAIRING; ZERO-KNOWLEDGE;

SERVERS;

EID: 33646773954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11593447_33     Document Type: Conference Paper

References (32)

1. M. Bellare, J. A. Garay, and T. Rabin. Fast Batch Verification for Modular Exponentiation and Digital Signatures. In Nyberg [21], pages 236-250.
2. D. Boneh and X. Boyen. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. In Cachin and Camenisch [5], pages 382-400.
3. D. Boneh and X. Boyen. Short Signatures without Random Oracles. In Cachin and Camenisch [5], pages 382-400.
4. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast Exponentiation with Precomputation (Extended abstract). In Rueppel [27], pages 200-207.
5. C. Cachin and J. Camenisch, editors. Advances in Cryptology - Eurocrypt '04, volume 3027 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
6. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In A. M. Odlyzko, editor, Advances in Cryptology - Crypto '86, volume 263 of Lecture Notes in Computer Science, pages 186-194, 1986.
7. M. Girault. Self-Certified Public Keys. In D. W. Davies, editor, Advances in Cryptology - Eurocrypt '91, volume 547 of Lecture Notes in Computer Science, pages 490-497. Springer-Verlag, 1991.
8. M. Girault and J. C. Paillès. On-line/Off-line RSA-like. In International Workshop on Coding and Cryptography 2003, 2003.
9. M. Girault, G. Poupard, and J. Stern. Some Modes of Use of the GPS Identification Scheme. In 3rd Nessie Conference. Springer-Verlag, 2002.
10. M. Girault and J. J. Quisquater. GQ + GPS = new ideas + new protocols. Eurocrypt '02 - Rump Session, 2002.
11. th Annual ACM Symposium on the Theory of Computing, pages 210-217, 1985.
12. S. Goldwasser, S. Micali, and R. L. Rivest. A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17(2):281-308, 1988.
13. L. C. Guillou and J. J. Quisquater. A Practical Zero-knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. In C. G. Günther, editor, Advances in Cryptology - Eurocrypt '88, volume 330 of Lecture Notes in Computer Science, pages 123-128. Springer-Verlag, 1988.
14. S. Hohenberger and A. Lysyanskaya. How to Securely Outsource Cryptographic Computations. In Joe Kilian, editor, Theory of Cryptography, Second Theory of Cryptography Conference, volume 3378 of Lecture Notes in Computer Science, pages 264-282. Springer-Verlag, 2005.
15. C. H. Lim and P. J. Lee. Server (prover/signer)-Aided Verification of Identity Proofs and Signatures. In L. C. Guillou and J. J. Quisquater, editors, Advances in Cryptology - Eurocrypt '95, volume 921 of Lecture Notes in Computer Science, pages 64-78. Springer-Verlag, 1995.
16. T. Matsumoto, K. Kato, and H. Imai. Speeding up Secret Computations with Insecure Auxiliary Devices. In S. Goldwasser, editor, Advances in Cryptology - Crypto '88, volume 403 of Lecture Notes in Computer Science, pages 497-506. Springer-Verlag, 1988.
17. S. Mitsunari, R. Sakai, and M. Kasahara. A New Traitor Tracing. IEICE Trans., E85A(2):481-484, 2002.
18. D. M'Raihi and D. Naccache. Couponing Scheme Reduces Computational Power Requirements for DSS Signatures. In CardTech, pages 99-104, 1994.
19. P. Q. Nguyen and I. E. Shparlinski. On the Insecurity of a Server-Aided RSA Protocol. In C. Boyd, editor, Advances in Cryptology - Asiacrypt '01, volume 2248 of Lecture Notes in Computer Science, pages 21-35. Springer-Verlag, 2001.
20. P. Q. Nguyen and J. Stern. The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure. In K. Ohta and D. Pei, editors, Advances in Cryptology - Asiacrypt '98, volume 1514 of Lecture Notes in Computer Science, pages 372-379. Springer-Verlag, 1998.
21. K. Nyberg, editor. Advances in Cryptology - Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
22. B. Pfitzmann and M. Waidner. Attacks on Protocols for Server-Aided RSA Computation. In Rueppel [27], pages 153-162.
23. D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In U. M. Maurer, editor, Advances in Cryptology - Eurocrypt '96, volume 1070 of Lecture Notes in Computer Science, pages 387-398. Springer-Verlag, 1996.
24. G. Poupard and J. Stern. Security Analysis of a Practical "on the fly" Authentication and Signature Generation. In Nyberg [21], pages 422-436.
25. M. O. Rabin. Digitalized Signatures and Public-Key Functions as Intractable as Factorization. Technical Report MIT/LCS/TR-212, Massachusetts Institute of Technology - Laboratory for Computer Science, January 1979.
26. R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communication of the ACM, 21(2):120-126, 1978.
27. R. A. Rueppel, editor. Advances in Cryptology - Eurocrypt '92, volume 658 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
28. C. P. Schnorr. Efficient Identification and Signatures for Smart Cards. In G. Brassard, editor, Advances in Cryptology - Crypto '89, volume 435 of Lecture Notes in Computer Science, pages 239-252. Springer-Verlag, 1990.
29. C. P. Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161-174, 1991.
30. J. Shao, R. Lu, and Z. Cao. A New Efficient Identification Scheme Based on the Strong Diffie-Hellman Assumption. In International Symposium on Future Software Technology, 2004.
31. M. De Soete and J. J. Quisquater. Speeding Up Smart Card RSA Computations with Insecure Coprocessors. In Smart Card 2000, pages 191-198, 1989.
32. F. Zhang, R. Safavi-Naini, and W. Susilo. An Efficient Signature Scheme from Bilinear Pairing and its Applications. In F. Bao, R. H. Deng, and J. Zhou, editors, Public Key Cryptography, volume 2947 of Lecture Notes in Computer Science, pages 277-290. Springer-Verlag, 2004.