{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:06:39Z","timestamp":1781193999315,"version":"3.54.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,20]],"date-time":"2011-10-20T00:00:00Z","timestamp":1319068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00145-011-9108-z","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T06:37:14Z","timestamp":1319006234000},"page":"723-747","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Batch Verification of Short Signatures"],"prefix":"10.1007","volume":"25","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susan","family":"Hohenberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael \u00d8stergaard","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,10,20]]},"reference":[{"key":"9108_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-46035-7_6","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201902","author":"J.H. An","year":"2002","unstructured":"J.H. An, Y. Dodis, T. Rabin, On the security of joint signature and encryption, in Advances in Cryptology\u2014EUROCRYPT\u201902, ed. by L.R. Knudsen. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 83\u2013107"},{"key":"9108_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/FOCS.2004.71","volume-title":"45th Symposium on Foundations of Computer Science (FOCS)","author":"B. Barak","year":"2004","unstructured":"B. Barak, R. Canetti, J.B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in 45th Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Washington, 2004), pp. 186\u2013195"},{"key":"9108_CR3","volume-title":"MobiSys","author":"K. Barr","year":"2003","unstructured":"K. Barr, K. Asanovi\u0107, Energy aware lossless data compression, in MobiSys (USENIX, Berkeley, 2003)"},{"key":"9108_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201998","author":"M. Bellare","year":"1998","unstructured":"M. Bellare, J.A. Garay, T. Rabin, Fast batch verification for modular exponentiation and digital signatures, in Advances in Cryptology\u2014EUROCRYPT\u201998, ed. by K. Nyberg. Lecture Notes in Computer Science, vol. 1403 (Springer, Berlin, 1998), pp. 236\u2013250"},{"key":"9108_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201904","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, X. Boyen. Efficient selective-ID secure identity-based encryption without random oracles, in Advances in Cryptology\u2014EUROCRYPT\u201904, ed. by C. Cachin, J. Camenisch. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 223\u2013238"},{"key":"9108_CR6","series-title":"Lecture Notes in Computer Science","first-page":"382","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201904","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, X. Boyen. Short signatures without random oracles, in Advances in Cryptology\u2014EUROCRYPT\u201904, ed. by C. Cachin, J. Camenisch. Lecture Notes in Computer Science, vol. 3027 (Springer, Berlin, 2004), pp. 382\u2013400"},{"key":"9108_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology\u2014CRYPTO\u201901","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, M.K. Franklin, Identity-based encryption from the Weil pairing, in Advances in Cryptology\u2014CRYPTO\u201901, ed. by J. Kilian. Lecture Notes in Computer Science, vol. 2139 (Springer, Berlin, 2001), pp. 213\u2013229"},{"key":"9108_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201903","author":"D. Boneh","year":"2003","unstructured":"D. Boneh, C. Gentry, B. Lynn, H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, in Advances in Cryptology\u2014EUROCRYPT\u201903, ed. by E. Biham. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 416\u2013432"},{"issue":"4","key":"9108_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing. J. Cryptol.\n                  17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"9108_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-44448-3_5","volume-title":"Advances in Cryptology\u2014ASIACRYPT\u201900","author":"C. Boyd","year":"2000","unstructured":"C. Boyd, C. Pavlovski, Attacking and repairing batch verification schemes, in Advances in Cryptology\u2014ASIACRYPT\u201900, ed. by T. Okamoto. Lecture Notes in Computer Science, vol. 1976 (Springer, Berlin, 2000), pp. 58\u201371"},{"key":"9108_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/11761679_26","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201906","author":"X. Boyen","year":"2006","unstructured":"X. Boyen, B. Waters, Compact group signatures without random oracles, in Advances in Cryptology\u2014EUROCRYPT\u201906, ed. by S. Vaudenay. Lecture Notes in Computer Science, vol. 4004 (Springer, Berlin, 2006), pp. 427\u2013444"},{"key":"9108_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-72540-4_14","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201907","author":"J. Camenisch","year":"2007","unstructured":"J. Camenisch, S. Hohenberger, M.\u00d8. Pedersen, Batch verification of short signatures, in Advances in Cryptology\u2014EUROCRYPT\u201907, ed. by M. Naor. Lecture Notes in Computer Science, vol. 4515 (Springer, Berlin, 2007), pp. 246\u2013263"},{"key":"9108_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology\u2014CRYPTO\u201904","author":"J. Camenisch","year":"2004","unstructured":"J. Camenisch, A. Lysyanskaya, Signature schemes and anonymous credentials from bilinear maps, in Advances in Cryptology\u2014CRYPTO\u201904, ed. by M.K. Franklin. Lecture Notes in Computer Science, vol. 3152 (Springer, Berlin, 2004), pp. 56\u201372"},{"key":"9108_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201903","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in Advances in Cryptology\u2014EUROCRYPT\u201903, ed. by E. Biham. Lecture Notes in Computer Science, vol. 2656 (Springer, Berlin, 2003), pp. 255\u2013271"},{"issue":"2","key":"9108_CR15","first-page":"138","volume":"3","author":"T. Cao","year":"2006","unstructured":"T. Cao, D. Lin, R. Xue, Security analysis of some batch verifying signatures from pairings. Int. J. Netw. Secur.\n                  3(2), 138\u2013143 (2006)","journal-title":"Int. J. Netw. Secur."},{"key":"9108_CR16","unstructured":"Car 2 Car, Communication consortium. \n                    http:\/\/car-to-car.org"},{"key":"9108_CR17","series-title":"Lecture Notes in Computer Science","first-page":"18","volume-title":"6th Public Key Cryptography (PKC)","author":"J.C. Cha","year":"2003","unstructured":"J.C. Cha, J.H. Cheon, An identity-based signature from gap Diffie\u2013Hellman groups, in 6th Public Key Cryptography (PKC), ed. by Y. Desmedt. Lecture Notes in Computer Science, vol. 2567 (Springer, Berlin, 2003), pp. 18\u201330"},{"key":"9108_CR18","series-title":"Lecture Notes in Computer Science","first-page":"424","volume-title":"8th Information Security and Cryptology (ICISC)","author":"S. Chatterjee","year":"2005","unstructured":"S. Chatterjee, P. Sarkar, Trading time for space: Towards an efficient IBE scheme with short(er) public parameters in the standard model, in 8th Information Security and Cryptology (ICISC), ed. by D. Won, S. Kim. Lecture Notes in Computer Science, vol. 3935 (Springer, Berlin, 2005), pp. 424\u2013440"},{"key":"9108_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/11935230_10","volume-title":"Advances in Cryptology\u2014ASIACRYPT\u201906","author":"S. Chatterjee","year":"2006","unstructured":"S. Chatterjee, P. Sarkar, HIBE with short public parameters without random oracle, in Advances in Cryptology\u2014ASIACRYPT\u201906, ed. by X. Lai. Lecture Notes in Computer Science, vol. 4284 (Springer, Berlin, 2006), pp. 145\u2013160"},{"key":"9108_CR20","unstructured":"L. Chen, Z. Cheng, N.P. Smart, Identity-based key agreement protocols from pairings, 2006. Cryptology ePrint Archive: Report 2006\/199"},{"key":"9108_CR21","unstructured":"J.H. Cheon, Y. Kim, H.J. Yoon, A new ID-based signature with batch verification, 2004. Cryptology ePrint Archive: Report 2004\/131"},{"issue":"12","key":"9108_CR22","doi-asserted-by":"publisher","first-page":"1536","DOI":"10.1109\/TC.2006.207","volume":"55","author":"J.H. Cheon","year":"2006","unstructured":"J.H. Cheon, D.H. Lee, Use of sparse and\/or complex exponents in batch verification of exponentiations. IEEE Trans. Comput.\n                  55(12), 1536\u20131542 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"9108_CR23","volume-title":"1st International Conference on Scalable Information Systems (InfoScale)","author":"S. Cui","year":"2006","unstructured":"S. Cui, P. Duan, C.W. Chan, An efficient identity-based signature scheme with batch verifications, in 1st International Conference on Scalable Information Systems (InfoScale), ed. by A. Chowdhury, F. Lau, F.Z. Wang (ACM Press, New York, 2006)"},{"key":"9108_CR24","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory\n                  22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9108_CR25","volume-title":"CT-RSA","author":"A.L. Ferrara","year":"2009","unstructured":"A.L. Ferrara, M. Green, S. Hohenberger, M.\u00d8. Pedersen, Practical short signature batch verification, in CT-RSA (2009). Cryptology ePrint Archive: Report 2008\/015"},{"key":"9108_CR26","series-title":"Lecture Notes in Computer Science","first-page":"175","volume-title":"Advances in Cryptology\u2014CRYPTO\u201989","author":"A. Fiat","year":"1989","unstructured":"A. Fiat, Batch RSA, in Advances in Cryptology\u2014CRYPTO\u201989, ed. by G. Brassard. Lecture Notes in Computer Science, vol. 435 (Springer, Berlin, 1989), pp. 175\u2013185"},{"key":"9108_CR27","unstructured":"S.D. Galbraith, K.G. Paterson, N.P. Smart, Pairings for cryptographers, 2006. Cryptology ePrint Archive: Report 2006\/165"},{"key":"9108_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-540-28628-8_11","volume-title":"Advances in Cryptology\u2014CRYPTO\u201904","author":"C. Gentry","year":"2004","unstructured":"C. Gentry, How to compress Rabin ciphertexts and signatures (and more), in Advances in Cryptology\u2014CRYPTO\u201904, ed. by M.K. Franklin. Lecture Notes in Computer Science, vol. 3152 (Springer, Berlin, 2004), pp. 179\u2013200"},{"key":"9108_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/11745853_17","volume-title":"9th Public Key Cryptography (PKC)","author":"C. Gentry","year":"2006","unstructured":"C. Gentry, Z. Ramzan, Identity-based aggregate signatures, in 9th Public Key Cryptography (PKC), ed. by M. Yung. Lecture Notes in Computer Science, vol. 3958 (Springer, Berlin, 2006), pp. 257\u2013273"},{"key":"9108_CR30","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, R.L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput.\n                  17(2) (1988)","DOI":"10.1137\/0217017"},{"key":"9108_CR31","unstructured":"R. Granger, N.P. Smart, On computing products of pairings, 2006. Cryptology ePrint Archive: Report 2006\/172"},{"issue":"9","key":"9108_CR32","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1049\/el:19980620","volume":"34","author":"L. Harn","year":"1998","unstructured":"L. Harn, Batch verifying multiple DSA digital signatures. Electron. Lett.\n                  34(9), 870\u2013871 (1998)","journal-title":"Electron. Lett."},{"issue":"12","key":"9108_CR33","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1049\/el:19980833","volume":"34","author":"L. Harn","year":"1998","unstructured":"L. Harn, Batch verifying multiple RSA digital signatures. Electron. Lett.\n                  34(12), 1219\u20131220 (1998)","journal-title":"Electron. Lett."},{"key":"9108_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-45439-X_6","volume-title":"4th Information Security","author":"F. Hoshino","year":"2001","unstructured":"F. Hoshino, M. Abe, T. Kobayashi, Lenient\/strict batch verification in several groups, in 4th Information Security, ed. by G.I. Davida, Y. Frankel. Lecture Notes in Computer Science, vol. 2200 (Springer, Berlin, 2001), pp. 81\u201394"},{"key":"9108_CR35","series-title":"Lecture Notes in Computer Science","first-page":"233","volume-title":"3rd Information and Communications Security (ICICS)","author":"M.-S. Hwang","year":"2001","unstructured":"M.-S. Hwang, C.-C. Lee, Y.-L. Tang, Two simple batch verifying multiple digital signatures, in 3rd Information and Communications Security (ICICS), ed. by S. Qing, T. Okamoto, J. Zhou. Lecture Notes in Computer Science, vol. 2229 (Springer, Berlin, 2001), pp. 233\u2013237"},{"issue":"1","key":"9108_CR36","first-page":"15","volume":"11","author":"M.-S. Hwang","year":"2000","unstructured":"M.-S. Hwang, I.-C. Lin, K.-F. Hwang, Cryptanalysis of the batch verifying multiple RSA digital signatures. Informatica\n                  11(1), 15\u201319 (2000)","journal-title":"Informatica"},{"key":"9108_CR37","unstructured":"IEEE. 5.9 GHz Dedicated Short Range Communications. \n                    http:\/\/grouper.ieee.org\/groups\/scc32\/dsrc"},{"key":"9108_CR38","doi-asserted-by":"crossref","unstructured":"N. Koblitz, A. Menezes, Pairing-based cryptography at high security levels, 2005. Cryptology ePrint Archive: Report 2005\/076","DOI":"10.1007\/11586821_2"},{"issue":"7","key":"9108_CR39","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/12.392857","volume":"44","author":"C.-S. Laih","year":"1995","unstructured":"C.-S. Laih, S.-M. Yen, Improved digital signature suitable for batch verification. IEEE Trans. Comput.\n                  44(7), 957\u2013959 (1995)","journal-title":"IEEE Trans. Comput."},{"key":"9108_CR40","volume-title":"IEEE Workshop on Embedded Networked Sensors (EmNetS-II)","author":"O. Landsiedel","year":"2005","unstructured":"O. Landsiedel, K. Wehrle, S. G\u00f6tz, Accurate prediction of power consumption in sensor networks, in IEEE Workshop on Embedded Networked Sensors (EmNetS-II) (2005)"},{"key":"9108_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-540-77272-9_3","volume-title":"Cryptography and Coding, 11th IMA International Conference","author":"L. Law","year":"2007","unstructured":"L. Law, B.J. Matt, Finding invalid signatures in pairing-based batches, in Cryptography and Coding, 11th IMA International Conference, ed. by S.D. Galbraith. Lecture Notes in Computer Science, vol. 4887 (Springer, Berlin, 2007), pp. 34\u201353"},{"issue":"1","key":"9108_CR42","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1093\/ietfec\/e89-a.1.74","volume":"E89-A","author":"S. Lee","year":"2006","unstructured":"S. Lee, S. Cho, J. Choi, Y. Cho, Efficient identification of bad signatures in RSA-type batch signature. IEICE Trans. Fundam. Electron. Commun. Comput. Sci.\n                  E89-A(1), 74\u201380 (2006)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"19","key":"9108_CR43","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1049\/el:19941112","volume":"30","author":"C. Lim","year":"1994","unstructured":"C. Lim, P. Lee, Security of interactive DSA batch verification. Electron. Lett.\n                  30(19), 1592\u20131593 (1994)","journal-title":"Electron. Lett."},{"key":"9108_CR44","unstructured":"C.H. Lim, Efficient multi-exponentation and application to batch verification of digital signatures, 2000. \n                    http:\/\/dasan.sejong.ac.kr\/chlim\/english_pub.html"},{"key":"9108_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-46513-8_14","volume-title":"6th Selected Areas in Cryptography (SAC)","author":"A. Lysyanskaya","year":"1999","unstructured":"A. Lysyanskaya, R.L. Rivest, A. Sahai, S. Wolf, Pseudonym systems, in 6th Selected Areas in Cryptography (SAC), ed. by C. Adams, H. Heys. Lecture Notes in Computer Science, vol. 1758 (Springer, Berlin, 1999), pp. 184\u2013199"},{"key":"9108_CR46","first-page":"80","volume-title":"23rd ACM Symposium on Theory of Computing (STOC)","author":"A. Menezes","year":"1991","unstructured":"A. Menezes, S. Vanstone, T. Okamoto, Reducing elliptic curve logarithms to logarithms in a finite field, in 23rd ACM Symposium on Theory of Computing (STOC) (1991), pp. 80\u201389"},{"key":"9108_CR47","unstructured":"D. Naccache, Secure and practical identity-based encryption, 2005. Cryptology ePrint Archive: Report 2005\/369"},{"key":"9108_CR48","series-title":"Lecture Notes in Computer Science","first-page":"77","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201994","author":"D. Naccache","year":"1994","unstructured":"D. Naccache, D. M\u2019Ra\u00efhi, S. Vaudenay, D. Raphaeli, Can DSA be improved? Complexity trade-offs with the digital signature standard, in Advances in Cryptology\u2014EUROCRYPT\u201994, ed. by A. De Santis. Lecture Notes in Computer Science, vol. 950 (Springer, Berlin, 1994), pp. 77\u201385"},{"key":"9108_CR49","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/JCS-2007-15103","volume":"15","author":"M. Raya","year":"2007","unstructured":"M. Raya, J.-P. Hubaux, Securing vehicular ad hoc networks. J. Comput. Secur.\n                  15, 39\u201368 (2007)","journal-title":"J. Comput. Secur."},{"key":"9108_CR50","unstructured":"SeVeCom, Security on the road. \n                    http:\/\/www.sevecom.org"},{"key":"9108_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/3-540-45353-9_3","volume-title":"Cryptographer\u2019s Track at RSA Conference \u201901","author":"H. Shacham","year":"2001","unstructured":"H. Shacham, D. Boneh, Improving SSL handshake performance via batching, in Cryptographer\u2019s Track at RSA Conference \u201901, ed. by D. Naccache. Lecture Notes in Computer Science, vol. 2020 (Springer, Berlin, 2001), pp. 28\u201343"},{"key":"9108_CR52","unstructured":"M. Stanek, Attacking LCCC batch verification of RSA signatures, 2006. Cryptology ePrint Archive: Report 2006\/111"},{"key":"9108_CR53","series-title":"Lecture Notes in Computer Science","first-page":"320","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201905","author":"B. Waters","year":"2005","unstructured":"B. Waters, Efficient identity-based encryption without random oracles, in Advances in Cryptology\u2014EUROCRYPT\u201905, ed. by R. Cramer. Lecture Notes in Computer Science, vol. 3494 (Springer, Berlin, 2005), pp. 320\u2013329"},{"key":"9108_CR54","series-title":"Lecture Notes in Computer Science","first-page":"233","volume-title":"7th Information Security and Cryptology (ICISC)","author":"H.J. Yoon","year":"2004","unstructured":"H.J. Yoon, J.H. Cheon, Y. Kim, Batch verifications with ID-based signatures, in 7th Information Security and Cryptology (ICISC), ed. by C. Park, S. Chee. Lecture Notes in Computer Science, vol. 3506 (Springer, Berlin, 2004), pp. 233\u2013248"},{"key":"9108_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/3-540-45067-X_27","volume-title":"8th Information Security and Privacy, Australasian Conference (ACISP)","author":"F. Zhang","year":"2003","unstructured":"F. Zhang, K. Kim, Efficient ID-based blind signature and proxy signature from bilinear pairings, in 8th Information Security and Privacy, Australasian Conference (ACISP), ed. by R. Safavi-Naini, J. Seberry. Lecture Notes in Computer Science, vol. 2727 (Springer, Berlin, 2003), pp. 312\u2013323"},{"key":"9108_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-24582-7_14","volume-title":"Progress in Cryptology\u2014INDOCRYPT\u201903","author":"F. Zhang","year":"2003","unstructured":"F. Zhang, R. Safavi-Naini, W. Susilo, Efficient verifiably encrypted signature and partially blind signature from bilinear pairings, in Progress in Cryptology\u2014INDOCRYPT\u201903, ed. by T. Johansson, S. Maitra. Lecture Notes in Computer Science, vol. 2904 (Springer, Berlin, 2003), pp. 191\u2013204"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9108-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-011-9108-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9108-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9108-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:06:26Z","timestamp":1586333186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-011-9108-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,20]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9108"],"URL":"https:\/\/doi.org\/10.1007\/s00145-011-9108-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,20]]},"assertion":[{"value":"1 August 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2011","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}