{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:26:38Z","timestamp":1760707598938},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540306849"},{"type":"electronic","value":"9783540322672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593447_33","type":"book-chapter","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T06:37:16Z","timestamp":1132036636000},"page":"605-623","source":"Crossref","is-referenced-by-count":44,"title":["Server-Aided Verification: Theory and Practice"],"prefix":"10.1007","author":[{"given":"Marc","family":"Girault","sequence":"first","affiliation":[]},{"given":"David","family":"Lefranc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In: Nyberg, (ed.) [21], pp. 236\u2013250","DOI":"10.1007\/BFb0054130"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles. In: Cachin, Camenisch (eds.) [5], pp. 382\u2013400","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Cachin, Camenisch (eds.) [5], pp. 382\u2013400","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast Exponentiation with Precomputation (Extended abstract). In: Rueppel, (ed.) [27], pp. 200\u2013207","DOI":"10.1007\/3-540-47555-9_18"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","year":"2004","unstructured":"Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol.\u00a03027. Springer, Heidelberg (2004)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/3-540-46416-6_42","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"M. Girault","year":"1991","unstructured":"Girault, M.: Self-Certified Public Keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 490\u2013497. Springer, Heidelberg (1991)"},{"key":"33_CR8","unstructured":"Girault, M., Paill\u00e8s, J.C.: On-line\/Off-line RSA-like. In: International Workshop on Coding and Cryptography 2003 (2003)"},{"key":"33_CR9","unstructured":"Girault, M., Poupard, G., Stern, J.: Some Modes of Use of the GPS Identification Scheme. In: 3rd Nessie Conference. Springer, Heidelberg (2002)"},{"key":"33_CR10","unstructured":"Girault, M., Quisquater, J.J.: GQ + GPS = new ideas + new protocols. In: Eurocrypt 2002 - Rump Session (2002)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Goldasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. In: 19 th Annual ACM Symposium on the Theory of Computing, pp. 210\u2013217 (1985)","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A Digital Signature Scheme Secure against Adaptive Chosen-Message Attacks. SIAM Journal on Computing\u00a017(2), 281\u2013308 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"L.C. Guillou","year":"1988","unstructured":"Guillou, L.C., Quisquater, J.J.: A Practical Zero-knowledge Protocol Fitted to Security Microprocessor Minimizing both Transmission and Memory. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 123\u2013128. Springer, Heidelberg (1988)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to Securely Outsource Cryptographic Computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 264\u2013282. Springer, Heidelberg (2005)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-49264-X_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.H. Lim","year":"1995","unstructured":"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.\u00a0921, pp. 64\u201378. Springer, Heidelberg (1995)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/0-387-34799-2_35","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"T. Matsumoto","year":"1990","unstructured":"Matsumoto, T., Kato, K., Imai, H.: Speeding up Secret Computations with Insecure Auxiliary Devices. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 497\u2013506. Springer, Heidelberg (1990)"},{"issue":"2","key":"33_CR17","first-page":"481","volume":"E85A","author":"S. Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A New Traitor Tracing. IEICE Trans.\u00a0E85A(2), 481\u2013484 (2002)","journal-title":"IEICE Trans."},{"key":"33_CR18","unstructured":"M\u2019Raihi, D., Naccache, D.: Couponing Scheme Reduces Computational Power Requirements for DSS Signatures. In: CardTech, pp. 99\u2013104 (1994)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-45682-1_2","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: On the Insecurity of a Server-Aided RSA Protocol. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 21\u201335. Springer, Heidelberg (2001)"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-49649-1_29","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"P.Q. Nguy\u00ean","year":"1998","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The B\u00e9guin-Quisquater Server-Aided RSA Protocol from Crypto \u201995 is not Secure. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 372\u2013379. Springer, Heidelberg (1998)"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","year":"1998","unstructured":"Nyberg, K. (ed.): EUROCRYPT 1998. LNCS, vol.\u00a01403. Springer, Heidelberg (1998)"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: Attacks on Protocols for Server-Aided RSA Computation. In: Rueppel, (ed.) [27], pp. 153\u2013162","DOI":"10.1007\/3-540-47555-9_13"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Heidelberg (1996)"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Poupard, G., Stern, J.: Security Analysis of a Practical \u201don the fly\u201d Authentication and Signature Generation. In: Nyberg, (ed.) [21], pp. 422\u2013436","DOI":"10.1007\/BFb0054143"},{"key":"33_CR25","unstructured":"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)"},{"issue":"2","key":"33_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communication of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communication of the ACM"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","year":"1993","unstructured":"Rueppel, R.A. (ed.): EUROCRYPT 1992. LNCS, vol.\u00a0658. Springer, Heidelberg (1993)"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"issue":"3","key":"33_CR29","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient Signature Generation by Smart Cards. Journal of Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"33_CR30","unstructured":"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)"},{"key":"33_CR31","unstructured":"De Soete, M., Quisquater, J.J.: Speeding Up Smart Card RSA Computations with Insecure Coprocessors. In: Smart Card 2000, pp. 191\u2013198 (1989)"},{"key":"33_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-540-24632-9_20","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"F. Zhang","year":"2004","unstructured":"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.\u00a02947, pp. 277\u2013290. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593447_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:44Z","timestamp":1605643364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593447_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540306849","9783540322672"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11593447_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}