{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:54:53Z","timestamp":1742939693796,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894094"},{"type":"electronic","value":"9783540894117"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-540-89411-7_3","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T12:16:35Z","timestamp":1289391395000},"page":"43-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Security for Signcryption: The Multi-User Model"],"prefix":"10.1007","author":[{"given":"Joonsang","family":"Baek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"J. H. An, Y. Dodis, and T. Rabin. On the security of joint signatures and encryption. In L. Knudsen, editor, Advances in Cryptology \u2013 Eurocrypt 2002, volume 2332 of Lecture Notes in Computer Science, pages 83\u2013107. Springer, 2002.","DOI":"10.1007\/3-540-46035-7_6"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"J. Baek, R. Steinfeld, and Y. Zheng. Formal proofs for the security of signcryption. In D. Naccache and P. Paillier, editors, Public Key Cryptography (PKC 2002), volume 2274 of Lecture Notes in Computer Science, pages 80\u201398. Springer, 2002.","DOI":"10.1007\/3-540-45664-3_6"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00145-007-0211-0","volume":"20","author":"J. Baek","year":"2007","unstructured":"J. Baek, R. Steinfeld, and Y. Zheng. Formal proofs for the security of signcryption. Journal of Cryptology, 20(2):203\u2013235, 2007.","journal-title":"Journal of Cryptology"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62\u201373. ACM Press, 1993.","DOI":"10.1145\/168588.168596"},{"key":"3_CR148","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In Proceedings of the 22nd Symposium on the Theory of Computing \u2013 STOC 1990, pages 427\u2013437. ACM Press, 1990.","DOI":"10.1145\/100216.100273"},{"key":"3_CR152","doi-asserted-by":"crossref","unstructured":"T. Okamoto and D. Pointcheval. The gap problems: A new class of problems for the security of cryptographic schemes. In K. Kim, editor, Public Key Cryptography \u2013 PKC 2001, volume 1992 of Lecture Notes in Computer Science, pages 104\u2013118. Springer, 2001.","DOI":"10.1007\/3-540-44586-2_8"},{"key":"3_CR164","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. R. Simon. Non-interactive proof of knowledge and chosen ciphertext attack. In J. Feigenbaum, editor, Advances in Cryptology \u2013 Crypto \u201991, volume 576 of Lecture Notes in Computer Science, pages 433\u2013444. Springer, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"3_CR184","doi-asserted-by":"crossref","unstructured":"R. Steinfeld and Y. Zheng. A signcryption scheme based on integer factorization. In J. Pieprzyk, E. Okamoto, and J. Seberry, editors, Information Security Workshop (ISW 2000), volume 1975 of Lecture Notes in Computer Science, pages 308\u2013322. Springer, 2000.","DOI":"10.1007\/3-540-44456-4_23"},{"key":"3_CR203","doi-asserted-by":"crossref","unstructured":"Y. Zheng. Digital signcryption or how to achieve cost(signature & encryption) \u00ab cost (signature) + cost(encryption). In B. S. Kaliski Jr., editor, Advances in Cryptology \u2013 Crypto \u201997, volume 1294 of Lecture Notes in Computer Science, pages 165\u2013179. Springer, 1997.","DOI":"10.1007\/BFb0052234"},{"key":"3_CR204","doi-asserted-by":"crossref","unstructured":"Y. Zheng. Digital signcryption or how to achieve cost(signature & encryption) \u00ab cost (signature) + cost(encryption). Full version. Available from http:\/\/www.sis.uncc.edu\/\u223cyzheng\/papers\/, 1997.","DOI":"10.1007\/BFb0052234"}],"container-title":["Information Security and Cryptography","Practical Signcryption"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89411-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T01:03:55Z","timestamp":1676077435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-89411-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783540894094","9783540894117"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89411-7_3","relation":{},"ISSN":["1619-7100"],"issn-type":[{"type":"print","value":"1619-7100"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"4 October 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}