{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:43:34Z","timestamp":1725594214131},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224966"},{"type":"electronic","value":"9783642224973"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22497-3_24","type":"book-chapter","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T06:05:53Z","timestamp":1309759553000},"page":"371-388","source":"Crossref","is-referenced-by-count":2,"title":["A Single Key Pair is Adequate for the Zheng Signcryption"],"prefix":"10.1007","author":[{"given":"Jia","family":"Fan","sequence":"first","affiliation":[]},{"given":"Yuliang","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-46035-7_6","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J.H. An","year":"2002","unstructured":"An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 83\u2013107. Springer, Heidelberg (2002)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45664-3_6","volume-title":"Public Key Cryptography","author":"J. Baek","year":"2002","unstructured":"Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 80\u201398. Springer, Heidelberg (2002)"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00145-007-0211-0","volume":"20","author":"J. Baek","year":"2007","unstructured":"Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. J. Cryptology\u00a020(2), 203\u2013235 (2007)","journal-title":"J. Cryptology"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39927-8_28","volume-title":"Information and Communications Security","author":"F. Bao","year":"2003","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol.\u00a02836, pp. 301\u2013312. Springer, Heidelberg (2003)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the First ACM Conference on Computer and Communications Security, New York, pp. 62\u201373. The Association for Computing Machinery (November 1993)","DOI":"10.1145\/168588.168596"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2003","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing\u00a033, 167\u2013226 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: The gap-problems: A new class of problems for the security of cryptographic schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"key":"24_CR8","unstructured":"Shoup, V.: Sequences of games: A tool for taming complexity in security proofs (2004), \n                    \n                      http:\/\/eprint.iacr.org\/2004\/332"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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_CR10","first-page":"75","volume-title":"IFIP\/SEC 1998: Proceedings of the IFIP 14th International Information Security Conference","author":"Y. Zheng","year":"1998","unstructured":"Zheng, Y., Imai, H.: Efficient signcryption schemes on elliptic curves. In: IFIP\/SEC 1998: Proceedings of the IFIP 14th International Information Security Conference, New York, pp. 75\u201384. Chapman and Hall, Boca Raton (1998)"}],"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-22497-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T19:28:58Z","timestamp":1553887738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22497-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224966","9783642224973"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22497-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}