{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T04:59:34Z","timestamp":1758862774981,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642279539"},{"type":"electronic","value":"9783642279546"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27954-6_3","type":"book-chapter","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T09:23:15Z","timestamp":1329902595000},"page":"35-50","source":"Crossref","is-referenced-by-count":10,"title":["Short Transitive Signatures for Directed Trees"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Camacho","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Hevia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Goldreich, O., Goldwasser, S.: Incremental Cryptography: The Case of Hashing and Signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 216\u2013233. Springer, Heidelberg (1994)"},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1109\/TIT.2005.847697","volume":"51","author":"M. Bellare","year":"2005","unstructured":"Bellare, M., Neven, G.: Transitive Signatures: New Schemes and Proofs. IEEE Transactions on Information Theory\u00a051(6), 2133\u20132151 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient Selective-ID Secure Identity-Based Encryption without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.: Homomorphic Signatures for Polynomial Functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 149\u2013168. Springer, Heidelberg (2011)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"D. Boneh","year":"2009","unstructured":"Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a Linear Subspace: Signature Schemes for Network Coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 68\u201387. Springer, Heidelberg (2009)"},{"key":"3_CR6","unstructured":"Camacho, P., Hevia, A.: Short Transitive Signatures for Directed Trees. Full version of this paper (2011), \n                    \n                      http:\/\/eprint.iacr.org\/2011\/438"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-00468-1_27","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Soriente, C.: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 481\u2013500. Springer, Heidelberg (2009)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Camenisch","year":"2002","unstructured":"Camenisch, J., Lysyanskaya, A.: Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 61\u201376. Springer, Heidelberg (2002)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining order in a linked list. In: STOC, pp. 122\u2013127. ACM Press (1982)","DOI":"10.1145\/800070.802184"},{"issue":"9","key":"3_CR10","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Communications of the ACM\u00a03(9), 490\u2013499 (1960)","journal-title":"Communications of the ACM"},{"issue":"2","key":"3_CR11","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 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR12","unstructured":"Hohenberger, S.: The Cryptographic Impact of Groups with Infeasible Inversion. S.M.\u00a0Thesis, MIT (May 2003)"},{"key":"3_CR13","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.X., Wagner, D.: Homomorphic Signature Schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 244\u2013262. Springer, Heidelberg (2002)"},{"key":"3_CR14","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, pp. 236\u2013243. Springer, Heidelberg (2002)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 152\u2013164. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2008.01.042","volume":"396","author":"G. Neven","year":"2008","unstructured":"Neven, G.: A simple transitive signature scheme for directed trees. Theoretical Computer Science\u00a0396(1-3), 277\u2013282 (2008)","journal-title":"Theoretical Computer Science"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-30598-9_5","volume-title":"Security in Communication Networks","author":"S.F. Shahandashti","year":"2005","unstructured":"Shahandashti, S.F., Salmasizadeh, M., Mohajeri, J.: A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 60\u201376. Springer, Heidelberg (2005)"},{"key":"3_CR18","unstructured":"Xu, J.: On Directed Transitive Signature (2009), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/209"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/11967668_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"X. Yi","year":"2006","unstructured":"Yi, X.: Directed Transitive Signature Scheme. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 129\u2013144. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27954-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T22:26:20Z","timestamp":1556403980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27954-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279539","9783642279546"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27954-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}