{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:38:15Z","timestamp":1725485895630},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_3","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T19:22:37Z","timestamp":1181157757000},"page":"35-47","source":"Crossref","is-referenced-by-count":29,"title":["New DSA-Verifiable Signcryption Schemes"],"prefix":"10.1007","author":[{"given":"Jun-Bum","family":"Shin","sequence":"first","affiliation":[]},{"given":"Kwangsu","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kyungah","family":"Shim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","first-page":"341","volume-title":"New signcryption schemes based on KCDSA","author":"D. Yum","year":"2001","unstructured":"D. Yum and P. Lee, \u201cNew signcryption schemes based on KCDSA,\u201d in The 4th International Conference on Information Security and Cryptology, pp. 341\u2013354, Springer-Verlag, LNCS 2288, 2001. 35, 36, 39, 42, 43, 45, 46"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BFb0054014","volume-title":"PKC98","author":"F. Bao","year":"1998","unstructured":"F. Bao and R.H. Deng, \u201cA signcryption scheme with signature directly verifiable by public key,\u201d in PKC98, pp. 55\u201359, Springer-Verlag, LNCS 1431, 1998. 35, 36, 37, 42, 43, 45, 46"},{"key":"3_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BFb0052234","volume-title":"Crypto\u201997","author":"Y. Zheng","year":"1997","unstructured":"Y. Zheng, \u201cDigital signcryption or how to achieve cost(signature & encryption) \u226a cost(siganture) + cost(encryption),\u201d in Crypto\u201997, pp. 165\u2013179, Springer-Verlag, LNCS 1294, 1997. 35, 37, 38, 41, 46"},{"issue":"2","key":"3_CR4","first-page":"149","volume":"145","author":"H. Petersen","year":"1998","unstructured":"H. Petersen and M. Michels, \u201cCryptanalysis and Improvement of Signcryption Schemes,\u201d IEE Computers and Digital Communications, vol. 145, no. 2, pp. 149\u2013151, 1998. 35","journal-title":"IEE Computers and Digital Communications"},{"unstructured":"TTAS, \u201cDigital Signature Mechanism with Appendix-Part 2: Certificate-Based Digital Signature Algorithm (KCDSA),\u201d TTAS.KO-12.0001\/R1, 1998. 35","key":"3_CR5"},{"unstructured":"NIST (National Institute for Standard and Techonology), \u201cDigital Signature Standard (DSS).\u201d FIPS PUB 186, 1994. 35, 37","key":"3_CR6"},{"key":"3_CR7","series-title":"Lect Notes Comput Sci","first-page":"182","volume-title":"Eurocrypt\u201994","author":"K. Nyberg","year":"1994","unstructured":"K. Nyberg and R.A. Rueppel, \u201cMessage recovery for signature schemes based on the discrete logarithm problem,\u201d in Eurocrypt\u201994, pp. 182\u2013193, Springer-Verlag, LNCS 950, 1994. 39"},{"key":"3_CR8","series-title":"Lect Notes Comput Sci","volume-title":"On the Security of Joint Signature and Encryption","author":"J.H. An","year":"2002","unstructured":"J.H. An, Y. Dodis, and T. Rabin, \u201cOn the Security of Joint Signature and Encryption,\u201d in Advances in Cryptology-EUROCRYPT 2002 Proceedings, Springer-Verlag, LNCS 2332, 2002. 42, 46"},{"doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom oracles are practical: A paradigm for disigning efficient protocols,\u201d in Proceedings of the 1st ACM Conference on Computer and Communication Security, pp. 62\u201373, 1993. 43","key":"3_CR9","DOI":"10.1145\/168588.168596"},{"key":"3_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-45664-3_6","volume-title":"Formal Proofs for the Security of Signcryption","author":"J. Baek","year":"2002","unstructured":"J. Baek, R. Steinfeld, and Y. Zheng, \u201cFormal Proofs for the Security of Signcryption,\u201d in Proceedings of Public Key Cryptography 2002, Springer-Verlan, LNCS 2274, pp. 80\u201398, 2002. 43, 44, 45"},{"unstructured":"M. Abdalla, M. Bellare, and P. Rogaway, \u201cDHIES: An Encryption Scheme Based on the Diffie-Hellman Problem,\u201d in IEEE P1363a, ANSI X9.63EC, and SECG. Available at \n                    http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/dhies.html\n                    \n                  . 46","key":"3_CR11"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:36:10Z","timestamp":1550363770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}