{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:06:54Z","timestamp":1742958414775,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243014"},{"type":"electronic","value":"9783540305989"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30598-9_5","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T15:44:35Z","timestamp":1294847075000},"page":"60-76","source":"Crossref","is-referenced-by-count":11,"title":["A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs"],"prefix":"10.1007","author":[{"given":"Siamak Fayyaz","family":"Shahandashti","sequence":"first","affiliation":[]},{"given":"Mahmoud","family":"Salmasizadeh","sequence":"additional","affiliation":[]},{"given":"Javad","family":"Mohajeri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Barreto, P.: The Pairing-Based Crypto Lounge, Web Page, \n                      http:\/\/planeta.terra.com.br\/informatica\/paulobarreto\/pblounge.html"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-36178-2_25","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"M. Bellare","year":"2002","unstructured":"Bellare, M., Neven, G.: Transitive Signatures Based on Factoring and RSA. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 397\u2013414. Springer, Heidelberg (2002)"},{"key":"5_CR3","unstructured":"Bellare, M., Neven, G.: Transitive Signatures: New Schemes and Proofs. Cryptology ePrint Archive: Report 2004\/215 (Full version of [2]), \n                      http:\/\/eprint.iacr.org\/2004\/215\/\n                    , \n                      http:\/\/www.cse.ucsd.edu\/users\/mihir\/"},{"key":"5_CR4","volume-title":"The First Annual Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols. In: The First Annual Conference on Computer and Communications Security, ACM, New York (1993), \n                      http:\/\/www-cse.ucsd.edu\/users\/mihir"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures \u2013 How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996), Full Paper: \n                      http:\/\/www-cse.ucsd.edu\/users\/mihir"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2001); Extended Abstract in Crypto 2001. Full Paper: \n                      http:\/\/crypto.stanford.edu\/~dabo\/pubs.html","journal-title":"SIAM Journal of Computing Vol"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, p. 514. Springer, Heidelberg (2001), Revised Full Paper: \n                      http:\/\/crypto.stanford.edu\/~dabo\/pubs.html"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-36563-X_7","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Mironov, I., Shoup, V.: A Secure Signature Scheme from Bilinear Maps. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 98\u2013110. Springer, Heidelberg (2003), Full Paper: \n                      http:\/\/crypto.stanford.edu\/~dabo\/pubs.html"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.S. Coron","year":"2000","unstructured":"Coron, J.S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 229. Springer, Heidelberg (2000), \n                      http:\/\/www.gemplus.com\/smart\/r_d\/publications\/pdf\/Cor00fdh.pdf"},{"issue":"2","key":"5_CR10","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.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing\u00a017(2), 281\u2013308 (1988), \n                      http:\/\/theory.lcs.mit.edu\/~rivest\/publications.html","journal-title":"SIAM Journal of Computing"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36178-2_24","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A. Hevia","year":"2002","unstructured":"Hevia, A., Micciancio, D.: The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 379\u2013396. Springer, Heidelberg (2002), \n                      http:\/\/www.cs.ucsd.edu\/~ahevia\/publications\/hm02.pdf"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45760-7_17","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"R. Johnson","year":"2002","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic Signature Schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, p. 244. Springer, Heidelberg (2002), \n                      http:\/\/citeseer.nj.nec.com\/460118.html"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux, A., Nguyen, K.: Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups. Journal of Cryptology\u00a016(4), 239\u2013247 (2003); A previous version also available online: Separating Decision Diffie-Hellman from Diffie-Hellman in Cryptographic Protocols. Cryptology ePrint Archive. Report 2001\/003, \n                      http:\/\/eprint.iacr.org\/2001\/003","journal-title":"Journal of Cryptology"},{"key":"5_CR14","unstructured":"Lipmaa, H.: Pairing-based Cryptography, Web Page on Cryptology Pointers, \n                      http:\/\/www.tcs.hut.fi\/~helger\/crypto\/link\/public\/pairing\/"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-45760-7_16","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"S. Micali","year":"2002","unstructured":"Micali, S., Rivest, R.: Transitive Signature Schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, p. 236. Springer, Heidelberg (2002), \n                      http:\/\/citeseer.nj.nec.com\/micali02transitive.html"},{"key":"5_CR16","unstructured":"Molnar, D.: Homomorphic Signature Schemes. BA Thesis, Computer Science Dept. Harvard College. Cambridge. Massachusetts. Michael Rabin adv (2003), \n                      http:\/\/www.cs.berkeley.edu\/~dmolnar\/papers\/papers.html"},{"key":"5_CR17","unstructured":"Neven, G.: Provably secure identity-based identification schemes and transitive signatures. Ph.D. thesis. Katholieke Universiteit Leuven, Belgium (May 2004), \n                      http:\/\/www.cs.kuleuven.ac.be\/~gregory\/papers\/phd.html"},{"key":"5_CR18","unstructured":"Rivest, R.: Two New Signature Schemes. Slides from Talk Given at Cambridge University (2000), \n                      http:\/\/www.cl.cam.ac.uk\/Research\/Security\/seminars\/2000\/rivest-tss.pdf"},{"key":"5_CR19","unstructured":"Sujing, Z.: Transitive Signatures Based on Non-adaptive Standard Signatures. Cryptography ePrint Archive. Report 2004\/044, \n                      http:\/\/eprint.iacr.org"}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30598-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T21:34:28Z","timestamp":1676064868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30598-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243014","9783540305989"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30598-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}