Abstract
We introduce the server-aided verification (SAV) concept, which consists in speeding up the verification step of an authentication/signature scheme, by delegating a substantial part of computations to a powerful (but possibly untrusted) server. After giving some motivations for designing SAV protocols, we provide a simple but realistic model, which captures most situations one can meet in practice (note that this model is much more general than the one recently proposed by Hohenberger and Lysyanskaya, who require the server to be made of two softwares which do not communicate with each other [14]). Then, we analyze and prove in this model the security of two existing SAV protocols, namely the Lim-Lee [15] modification of Schnorr scheme [28] and the Girault-Quisquater variant [10] of GPS scheme [7,24]. Finally, we propose a generic method for designing SAV versions of schemes based on bilinear maps, which can be applied to the Boneh-Boyen signature schemes [3], the Zhang-Safavi-Naini-Susilo [32] signature scheme and the Shao-Lu-Cao identification scheme [30].
Chapter PDF
Similar content being viewed by others
Keywords
References
Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, (ed.) [21], pp. 236–250
Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. In: Cachin, Camenisch (eds.) [5], pp. 382–400
Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Cachin, Camenisch (eds.) [5], pp. 382–400
Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast Exponentiation with Precomputation (Extended abstract). In: Rueppel, (ed.) [27], pp. 200–207
Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol. 3027. Springer, Heidelberg (2004)
Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)
Girault, M.: Self-Certified Public Keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)
Girault, M., Paillès, J.C.: On-line/Off-line RSA-like. In: International Workshop on Coding and Cryptography 2003 (2003)
Girault, M., Poupard, G., Stern, J.: Some Modes of Use of the GPS Identification Scheme. In: 3rd Nessie Conference. Springer, Heidelberg (2002)
Girault, M., Quisquater, J.J.: GQ + GPS = new ideas + new protocols. In: Eurocrypt 2002 - Rump Session (2002)
Goldasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. In: 19th Annual ACM Symposium on the Theory of Computing, pp. 210–217 (1985)
Goldwasser, S., Micali, S., Rivest, R.L.: A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM Journal on Computing 17(2), 281–308 (1988)
Guillou, L.C., Quisquater, J.J.: A Practical Zero-knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 123–128. Springer, Heidelberg (1988)
Hohenberger, S., Lysyanskaya, A.: How to Securely Outsource Cryptographic Computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264–282. Springer, Heidelberg (2005)
Lim, C.H., Lee, P.J.: Server (prover/signer)-Aided Verification of Identity Proofs and Signatures. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 64–78. Springer, Heidelberg (1995)
Matsumoto, T., Kato, K., Imai, H.: Speeding up Secret Computations with Insecure Auxiliary Devices. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 497–506. Springer, Heidelberg (1990)
Mitsunari, S., Sakai, R., Kasahara, M.: A New Traitor Tracing. IEICE Trans. E85A(2), 481–484 (2002)
M’Raihi, D., Naccache, D.: Couponing Scheme Reduces Computational Power Requirements for DSS Signatures. In: CardTech, pp. 99–104 (1994)
Nguyen, P.Q., Shparlinski, I.E.: On the Insecurity of a Server-Aided RSA Protocol. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 21–35. Springer, Heidelberg (2001)
Nguyên, P.Q., Stern, J.: The Béguin-Quisquater Server-Aided RSA Protocol from Crypto ’95 is not Secure. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 372–379. Springer, Heidelberg (1998)
Nyberg, K. (ed.): EUROCRYPT 1998. LNCS, vol. 1403. Springer, Heidelberg (1998)
Pfitzmann, B., Waidner, M.: Attacks on Protocols for Server-Aided RSA Computation. In: Rueppel, (ed.) [27], pp. 153–162
Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)
Poupard, G., Stern, J.: Security Analysis of a Practical ”on the fly” Authentication and Signature Generation. In: Nyberg, (ed.) [21], pp. 422–436
Rabin, M.O.: 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)
Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communication of the ACM 21(2), 120–126 (1978)
Rueppel, R.A. (ed.): EUROCRYPT 1992. LNCS, vol. 658. Springer, Heidelberg (1993)
Schnorr, C.P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)
Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology 4(3), 161–174 (1991)
Shao, J., Lu, R., Cao, Z.: A New Efficient Identification Scheme Based on the Strong Diffie-Hellman Assumption. In: International Symposium on Future Software Technology (2004)
De Soete, M., Quisquater, J.J.: Speeding Up Smart Card RSA Computations with Insecure Coprocessors. In: Smart Card 2000, pp. 191–198 (1989)
Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairing and its Applications. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 277–290. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girault, M., Lefranc, D. (2005). Server-Aided Verification: Theory and Practice. In: Roy, B. (eds) Advances in Cryptology - ASIACRYPT 2005. ASIACRYPT 2005. Lecture Notes in Computer Science, vol 3788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593447_33
Download citation
DOI: https://doi.org/10.1007/11593447_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30684-9
Online ISBN: 978-3-540-32267-2
eBook Packages: Computer ScienceComputer Science (R0)