{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T10:40:31Z","timestamp":1790419231256,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210184","type":"print"},{"value":"9783540246329","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24632-9_14","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:12:48Z","timestamp":1280761968000},"page":"187-200","source":"Crossref","is-referenced-by-count":75,"title":["Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Libert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_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":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/10718964_5","volume-title":"Information Security and Privacy","author":"J. Baek","year":"2000","unstructured":"Baek, J., Lee, B., Kim, K.: Secure Length-Saving ElGamal Encryption under the Computational Diffie-Hellman Assumption. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol.\u00a01841, pp. 49\u201358. Springer, Heidelberg (2000)"},{"key":"14_CR3","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)"},{"key":"14_CR4","unstructured":"Baek, J., Zheng, Y.: Simple and Efficient Threshold Cryptosystem from the Gap Diffie-Hellman Group, Available at, \n                  \n                    http:\/\/citeseer.nj.nec.com\/567030.html"},{"key":"14_CR5","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":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Bellare","year":"2001","unstructured":"Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-Privacy in Public-Key Encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 566\u2013582. Springer, Heidelberg (2001)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Proc. of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity Based Encryption From the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","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: A Swiss Army Knife for Identity-Based Cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 382\u2013398. Springer, Heidelberg (2003)"},{"key":"14_CR11","unstructured":"Dodis, Y., Freedman, M.-J., Walfish, S.: Parallel Signcryption with OAEP, PSSR and other Feistel Paddings (2003), Available at, \n                  \n                    http:\/\/eprint.iacr.org\/2003\/043\/"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: How to Enhance the Security of Public-Key Encryption at Minimum Cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 53\u201368. Springer, Heidelberg (1999)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-36563-X_6","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"S. Galbraith","year":"2003","unstructured":"Galbraith, S., Mao, W.: Invisibility and Anonymity of Undeniable and Confirmer Signatures. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 80\u201397. Springer, Heidelberg (2003)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-49162-7_6","volume-title":"Public Key Cryptography","author":"C. Gamage","year":"1999","unstructured":"Gamage, C., Leiwo, J., Zheng, Y.: Encrypted Message Authentication by Firewalls. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 69\u201381. Springer, Heidelberg (1999)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-39200-9_25","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"E.-J. Goh","year":"2003","unstructured":"Goh, E.-J., Jarecki, S.: A Signature Scheme as Secure as the Diffie-Hellman Problem. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 401\u2013415. Springer, Heidelberg (2003)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-36552-4_2","volume-title":"Information Security and Cryptology - ICISC 2002","author":"I.-R. Jeong","year":"2003","unstructured":"Jeong, I.-R., Jeong, H.-Y., Rhee, H.-S., Lee, D.-H., Jong, I.-L.: Provably Secure Encrypt-then-Sign Composition in Hybrid Signcryption. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 16\u201334. Springer, Heidelberg (2003)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"Joux","year":"2003","unstructured":"Joux, Nguyen, K.: Separating Decision Diffie-Hellman from Diffie-Hellman in Cryptographic Groups. Journal of Cryptology\u00a016(4), 239\u2013247 (2003)","journal-title":"Journal of Cryptology"},{"key":"14_CR19","unstructured":"Libert, B., Quisquater, J.-J.: Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups, Full paper, available on \n                  \n                    http:\/\/eprint.iacr.org"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36563-X_14","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"J. Malone-Lee","year":"2003","unstructured":"Malone-Lee, J., Mao, W.: Two Birds One Stone: Signcryption using RSA. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 211\u2013225. Springer, Heidelberg (2003)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2001)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/3-540-45067-X_33","volume-title":"Information Security and Privacy","author":"J. Pieprzyk","year":"2003","unstructured":"Pieprzyk, J., Pointcheval, D.: Parallel Authentication and Public-Key Encryption. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 383\u2013401. Springer, Heidelberg (2003)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Public Key Cryptography","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D.: Chosen-Ciphertext Security for any One-Way Cryptosystem. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 129\u2013146. Springer, Heidelberg (2000)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","first-page":"387","volume-title":"Public Key Cryptography","author":"D. Pointcheval","year":"2001","unstructured":"Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 387\u2013398. Springer, Heidelberg (2001)"},{"issue":"3","key":"14_CR25","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology\u00a013(3), 361\u2013396 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR26","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.-B. Shin","year":"2003","unstructured":"Shin, J.-B., Lee, K., Shim, K.: New DSA-verifiable Signcryption Schemes. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 35\u201347. Springer, Heidelberg (2003)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-44456-4_23","volume-title":"Information Security","author":"R. Steinfeld","year":"2000","unstructured":"Steinfeld, R., Zheng, Y.: A Signcryption Scheme Based on Integer Factorization. In: Okamoto, E., Pieprzyk, J.P., Seberry, J. (eds.) ISW 2000. LNCS, vol.\u00a01975, pp. 308\u2013322. Springer, Heidelberg (2000)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-45861-1_23","volume-title":"Information Security and Cryptology - ICISC 2001","author":"B.-H. Yum","year":"2002","unstructured":"Yum, B.-H., Lee, P.-J.: New Signcryption Schemes Based on KCDSA. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 305\u2013317. Springer, Heidelberg (2002)"},{"key":"14_CR29","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)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24632-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:40:22Z","timestamp":1552840822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24632-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210184","9783540246329"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24632-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}