{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:44:56Z","timestamp":1725896696311},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314476"},{"type":"electronic","value":"9783642314483"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31448-3_24","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T18:03:32Z","timestamp":1341425012000},"page":"322-335","source":"Crossref","is-referenced-by-count":0,"title":["A Generic Construction of Accountable Decryption and Its Applications"],"prefix":"10.1007","author":[{"given":"Xuhua","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuhua","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public Key Encryption with Keyword Search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-13190-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A. Lewko","year":"2010","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 62\u201391. Springer, Heidelberg (2010)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Katz","year":"2008","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 146\u2013162. Springer, Heidelberg (2008)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/35.312841","volume":"32","author":"B. Neuman","year":"1994","unstructured":"Neuman, B., Ts\u2019o, T.: Kerberos: an authentication service for computer networks. IEEE Communications Magazine\u00a032, 33\u201338 (1994)","journal-title":"IEEE Communications Magazine"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.L. Camenisch","year":"2003","unstructured":"Camenisch, J.L., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-16280-0_17","volume-title":"Provable Security","author":"S.S.D. Selvi","year":"2010","unstructured":"Selvi, S.S.D., Sree Vivek, S., Pandu Rangan, C.: Identity Based Public Verifiable Signcryption Scheme. In: Heng, S.-H., Kurosawa, K. (eds.) ProvSec 2010. LNCS, vol.\u00a06402, pp. 244\u2013260. Springer, Heidelberg (2010)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-31815-6_15","volume-title":"Information Security Applications","author":"S.S.M. Chow","year":"2005","unstructured":"Chow, S.S.M.: Verifiable Pairing and Its Applications. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 170\u2013187. Springer, Heidelberg (2005)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-24691-6_26","volume-title":"Information Security and Cryptology - ICISC 2003","author":"S.S.M. Chow","year":"2004","unstructured":"Chow, S.S.M., Yiu, S., Hui, L., Chow, K.: Efficient Forward and Provably Secure ID-Based Signcryption Scheme with Public Verifiability and Public Ciphertext Authenticity. In: Lim, J., Lee, D. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 352\u2013369. Springer, Heidelberg (2004)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-45146-4_23","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"X. Boyen","year":"2003","unstructured":"Boyen, X.: Multipurpose Identity-Based Signcryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 383\u2013399. Springer, Heidelberg (2003)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-36552-4_3","volume-title":"Information Security and Cryptology - ICISC 2002","author":"J. Shin","year":"2003","unstructured":"Shin, J., Lee, K., Shim, K.: New DSA-Verifiable Signcryption Schemes. In: Lee, P., Lim, C. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 35\u201347. Springer, Heidelberg (2003)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BFb0054014","volume-title":"Public Key Cryptography","author":"F. Bao","year":"1998","unstructured":"Bao, F., Deng, R.H.: A Signcryption Scheme with Signature Directly Verifiable by Public Key. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 55\u201359. Springer, Heidelberg (1998)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Barbosa, M., Farshim, P.: Delegatable homomorphic encryption with applications to fully secure outsourcing of computation. Cryptology ePrint Archive, Report 2011\/215 (2011)","DOI":"10.1007\/978-3-642-27954-6_19"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-03298-1_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. R\u00fcckert","year":"2009","unstructured":"R\u00fcckert, M., Schr\u00f6der, D.: Security of Verifiably Encrypted Signatures and a Construction without Random Oracles. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 17\u201334. Springer, Heidelberg (2009)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-10628-6_24","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"M. R\u00fcckert","year":"2009","unstructured":"R\u00fcckert, M.: Verifiably Encrypted Signatures from RSA without NIZKs. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 363\u2013377. Springer, Heidelberg (2009)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11761679_28","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S. Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential Aggregate Signatures and Multisignatures Without Random Oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 465\u2013485. Springer, Heidelberg (2006)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-13708-2_5","volume-title":"Applied Cryptography and Network Security","author":"M. R\u00fcckert","year":"2010","unstructured":"R\u00fcckert, M., Schneider, M., Schr\u00f6oder, D.: Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol.\u00a06123, pp. 69\u201386. Springer, Heidelberg (2010)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BFb0052234","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"Y. Zheng","year":"1997","unstructured":"Zheng, Y.: Digital Signcryption or How to Achieve Cost (Signature & Encryption) <\u2009< Cost(Signature) + Cost(Encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 165\u2013179. Springer, Heidelberg (1997)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-10628-6_22","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"T. Matsuda","year":"2009","unstructured":"Matsuda, T., Matsuura, K., Schuldt, J.C.N.: Efficient Constructions of Signcryption Schemes and Signcryption Composability. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 321\u2013342. Springer, Heidelberg (2009)"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR21","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press, New York (2000)"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31448-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:01:10Z","timestamp":1620115270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31448-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314476","9783642314483"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31448-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}