{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:29Z","timestamp":1764996869110},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2009,10,16]],"date-time":"2009-10-16T00:00:00Z","timestamp":1255651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10623-009-9334-7","type":"journal-article","created":{"date-parts":[[2009,10,15]],"date-time":"2009-10-15T02:00:05Z","timestamp":1255572005000},"page":"141-167","source":"Crossref","is-referenced-by-count":35,"title":["Comparing two pairing-based aggregate signature schemes"],"prefix":"10.1007","volume":"55","author":[{"given":"Sanjit","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Darrel","family":"Hankerson","sequence":"additional","affiliation":[]},{"given":"Edward","family":"Knapp","sequence":"additional","affiliation":[]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,16]]},"reference":[{"key":"9334_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto P., Galbraith S., \u00d3 h\u00c9igeartaigh C., Scott M.: Efficient pairing computation on supersingular abelian varieties. Des. Codes Cryptogr. 42, 239\u2013271 (2007)","journal-title":"Des. Codes Cryptogr."},{"key":"9334_CR2","doi-asserted-by":"crossref","unstructured":"Barreto P., Naehrig M.: Pairing-friendly elliptic curves of prime order. In: Selected Areas in Cryptography\u2014SAC 2005. Lecture Notes in Computer Science, vol. 3897, pp. 319\u2013331 (2006).","DOI":"10.1007\/11693383_22"},{"key":"9334_CR3","doi-asserted-by":"crossref","unstructured":"Bellare M., Namprempre C., Neven G.: Unrestricted aggregate signatures. In: Automata, Languages and Programming\u2014ICALP 2007. Lecture Notes in Computer Science, vol. 4596, pp. 411\u2013422 (2007).","DOI":"10.1007\/978-3-540-73420-8_37"},{"key":"9334_CR4","unstructured":"Bethencourt J., Boneh D., Waters B.: Cryptographic methods for storing ballots on a voting machine. The 14th Annual Network and Distributed System Security Symposium\u2014NDSS (2007)."},{"key":"9334_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Lipton R.: Algorithms for black-box fields and their application to cryptography. In: Advances in Cryptology\u2014CRYPTO \u201996. Lecture Notes in Computer Science, vol. 1109, pp. 283\u2013297 (1996).","DOI":"10.1007\/3-540-68697-5_22"},{"key":"9334_CR6","unstructured":"Boneh D., Gentry C., Lynn B., Shacham H.: Aggregate and verifiably encrypted signatures from bilinear maps. Advances in Cryptology\u2014EUROCRYPT 2003. Lecture Notes in Computer Science, vol. 2656, pp. 416\u2013432 (2003)."},{"key":"9334_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X., Shacham H.: Short group signatures. In: Advances in Cryptology\u2014CRYPTO 2004. Lecture Notes in Computer Science. vol. 3152, pp. 41\u201355 (2004).","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9334_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D., Lynn B., Shacham H.: Short signatures from the Weil pairing. In: Advances in Cryptology\u2014ASIACRYPT 2001. Lecture Notes in Computer Science, vol. 2248, pp. 514\u2013532 (2001). Full version: J. Cryptol. 17, 297\u2013319 (2004).","DOI":"10.1007\/s00145-004-0314-9"},{"key":"9334_CR9","doi-asserted-by":"crossref","unstructured":"Catalano D., Ruffo G., Schifanella R.: A P2P market place based on aggregate signatures. In: Parallel and Distributed Processing and Applications\u2014ISPA 2005 Workshops. Lecture Notes in Computer Science, vol. 3759, pp. 54\u201363 (2005).","DOI":"10.1007\/11576259_7"},{"key":"9334_CR10","unstructured":"Chatterjee S., Sarkar P.: Trading time for space: towards an efficient IBE scheme with short(er) public parameters in the standard model. In: Information Security and Cryptology\u2014ICISC 2005. Lecture Notes in Computer Science, vol. 3935, pp. 424\u2013440 (2006)."},{"key":"9334_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10207-006-0011-9","volume":"6","author":"L. Chen","year":"2007","unstructured":"Chen L., Cheng Z., Smart N.: Identity-based key agreement protocols from pairings. Int. J. Inf. Secur. 6, 213\u2013241 (2007)","journal-title":"Int. J. Inf. Secur."},{"key":"9334_CR12","doi-asserted-by":"crossref","unstructured":"Chung J., Hasan A.: Asymmetric squaring formulae. In: 18th IEEE Symposium on Computer Arithmetic (ARITH \u201907), pp. 113\u2013122.","DOI":"10.1109\/ARITH.2007.11"},{"key":"9334_CR13","unstructured":"den Boer B.: Diffie-Hellman is as strong as discrete log for certain primes. In: Advances in Cryptology\u2014CRYPTO \u201988. Lecture Notes in Computer Science, vol. 403, pp. 530\u2013539 (1996)."},{"key":"9334_CR14","doi-asserted-by":"crossref","unstructured":"Devegili A., Scott M., Dahab R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Pairing-Based Cryptography\u2014Pairing 2007. Lecture Notes in Computer Science, vol. 4575, pp. 197\u2013207 (2007).","DOI":"10.1007\/978-3-540-73489-5_10"},{"key":"9334_CR15","unstructured":"Galbraith S.: Pairings, Chapter IX of In: Blake I., Seroussi G., Smart N. (eds) Advances in Elliptic Curve Cryptography 2, Cambridge University Press (2005)."},{"key":"9334_CR16","doi-asserted-by":"crossref","unstructured":"Galbraith S., Scott M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Pairing-Based Cryptography\u2014Pairing 2008. Lecture Notes in Computer Science, vol. 5209, pp. 211\u2013224 (2008).","DOI":"10.1007\/978-3-540-85538-5_15"},{"key":"9334_CR17","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S. Galbraith","year":"2008","unstructured":"Galbraith S., Paterson K., Smart N.: Pairings for cryptographers. Discr. Appl. Math. 156, 3113\u20133121 (2008)","journal-title":"Discr. Appl. Math."},{"key":"9334_CR18","doi-asserted-by":"crossref","unstructured":"Gallant R., Lambert R., Vanstone S.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Advances in Cryptology\u2014CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 190\u2013200 (2001).","DOI":"10.1007\/3-540-44647-8_11"},{"key":"9334_CR19","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0406010","volume":"6","author":"D. Gordon","year":"1993","unstructured":"Gordon D.: Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discr. Math. 6, 124\u2013138 (1993)","journal-title":"SIAM J. Discr. Math."},{"key":"9334_CR20","doi-asserted-by":"crossref","unstructured":"Granger R., Page D., Stam M.: A comparison of CEILIDH and XTR. In: Algorithmic Number Theory: 6th International Symposium, ANTS-VI. Lecture Notes in Computer Science, vol. 3076, pp. 235\u2013249 (2004).","DOI":"10.1007\/978-3-540-24847-7_17"},{"key":"9334_CR21","unstructured":"Granger R., Smart N.: On computing products of pairings. Cryptology ePrint Archive Report 2006\/172 (2006). http:\/\/eprint.iacr.org\/2006\/172 ."},{"key":"9334_CR22","unstructured":"Hankerson D., Menezes A., Vanstone S.: Guide to Elliptic Curve Cryptography. Springer (2004)."},{"key":"9334_CR23","unstructured":"Hankerson D., Menezes A., Scott M.: Software implementation of pairings. In: Joye M., Neven G. (eds) Identity-Based Cryptography. IOS Press (2008)."},{"key":"9334_CR24","doi-asserted-by":"crossref","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess F., Smart N., Vercauteren F.: The eta pairing revisited. IEEE Trans. Inform. Theory 52, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9334_CR25","unstructured":"Kang B., Park J.: On the relationship between squared pairings and plain pairings. Cryptology ePrint Archive Report 2005\/112 (2005). http:\/\/eprint.iacr.org\/2005\/112 ."},{"key":"9334_CR26","doi-asserted-by":"crossref","unstructured":"Katz J., Wang N.: Efficiency improvements for signature schemes with tight security reductions. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 155\u2013164 (2003).","DOI":"10.1145\/948109.948132"},{"key":"9334_CR27","doi-asserted-by":"crossref","unstructured":"Joux A.: A one round protocol for tripartite Diffie-Hellman. In: Algorithmic Number Theory: 4th International Symposium, ANTS-IV. Lecture Notes in Computer Science, vol. 1838, pp. 385\u2013393 (2000).","DOI":"10.1007\/10722028_23"},{"key":"9334_CR28","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee E., Lee H.-S., Park C.-M.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. Inform. Theory 55, 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9334_CR29","doi-asserted-by":"crossref","unstructured":"Lu S., Ostrovsky R., Sahai A., Shacham H., Waters B.: Sequential aggregate signatures and multisignatures without random oracles. In: Advances in Cryptology\u2014EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 465\u2013485 (2006).","DOI":"10.1007\/11761679_28"},{"key":"9334_CR30","doi-asserted-by":"crossref","unstructured":"Maurer U.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Advances in Cryptology\u2014CRYPTO \u201994. Lecture Notes in Computer Science, vol. 839, pp. 271\u2013281 (1994).","DOI":"10.1007\/3-540-48658-5_26"},{"key":"9334_CR31","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1112\/S1461157000001042","volume":"7","author":"A. Muzereau","year":"2004","unstructured":"Muzereau A., Smart N., Vercauteren N.: The equivalence between the DHP and DLP for elliptic curves used in practical applications. LMS J. Comput. Math. 7, 50\u201372 (2004)","journal-title":"LMS J. Comput. Math."},{"key":"9334_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1049\/iet-ifs:20055097","volume":"1","author":"D. Naccache","year":"2007","unstructured":"Naccache D.: Secure and practical identity-based encryption. IET Inform. Secur. 1, 59\u201364 (2007)","journal-title":"IET Inform. Secur."},{"key":"9334_CR33","unstructured":"Nogami Y., Akane M., Sakemi Y., Kato H., Morikawa Y.: Integer variable \u03c7-based ate pairing. In: Pairing-Based Cryptography\u2014 Pairing 2008. Lecture Notes in Computer Science, vol. 5209, pp. 178\u2013191 (2008)."},{"key":"9334_CR34","first-page":"918","volume":"32","author":"J. Pollard","year":"1978","unstructured":"Pollard J.: Monte Carlo methods for index computation mod p. Math. Comput. 32, 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"9334_CR35","first-page":"409","volume":"345","author":"O. Schirokauer","year":"1993","unstructured":"Schirokauer O.: Discrete logarithms and local units. Phil. Trans. R. Soc. Phys. Eng. Sci. 345, 409\u2013423 (1993)","journal-title":"Phil. Trans. R. Soc. Phys. Eng. Sci."},{"key":"9334_CR36","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1090\/S0025-5718-99-01137-0","volume":"69","author":"O. Schirokauer","year":"2000","unstructured":"Schirokauer O.: Using number fields to compute logarithms in finite fields. Math. Comput. 69, 1267\u20131283 (2000)","journal-title":"Math. Comput."},{"key":"9334_CR37","unstructured":"Schirokauer O.: The number field sieve for integers of low hamming weight. Math. Comput. (to appear)."},{"key":"9334_CR38","doi-asserted-by":"crossref","unstructured":"Scott M.: Computing the Tate pairing. In: Topics in Cryptology\u2014CT-RSA 2005. Lecture Notes in Computer Science, vol. 3376, pp. 293\u2013304 (2005).","DOI":"10.1007\/978-3-540-30574-3_20"},{"key":"9334_CR39","unstructured":"Scott M.: Implementing cryptographic pairings. In: Pairing-Based Cryptography\u2014Pairing 2007. Lecture Notes in Computer Science, vol. 4575, pp. 177\u2013196 (2007)."},{"key":"9334_CR40","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/j.dam.2006.07.004","volume":"155","author":"N. Smart","year":"2007","unstructured":"Smart N., Vercauteren F.: On computable isomorphisms in efficient asymmetric pairing-based systems. Discr. Appl. Math. 155, 538\u2013547 (2007)","journal-title":"Discr. Appl. Math."},{"key":"9334_CR41","doi-asserted-by":"crossref","unstructured":"Waters B.: Efficient identity-based encryption without random oracles. In: Advances in Cryptology\u2014EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494, pp. 114\u2013127 (2005).","DOI":"10.1007\/11426639_7"},{"key":"9334_CR42","doi-asserted-by":"crossref","unstructured":"Zhao M., Smith S., Nicol D.: Aggregated path authentication for efficient BGP security. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 128\u2013138 (2005).","DOI":"10.1145\/1102120.1102139"},{"issue":"6","key":"9334_CR43","first-page":"42","volume":"19","author":"M. Zhao","year":"2005","unstructured":"Zhao M., Smith S., Nicol D.: The performance impact of BGP security. IEEE Secur. 19(6), 42\u201348 (2005)","journal-title":"IEEE Secur."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9334-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9334-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9334-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:27Z","timestamp":1559246307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9334-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,16]]},"references-count":43,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9334"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9334-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,16]]}}}