{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:46:51Z","timestamp":1742975211253,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255595"},{"type":"electronic","value":"9783642255601"}],"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-25560-1_15","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T22:28:46Z","timestamp":1320877726000},"page":"215-234","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Signcryption from Pairings"],"prefix":"10.1007","author":[{"given":"Indivar","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. K.","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/11599371_3","volume-title":"Cryptology and Network Security","author":"H. Bao","year":"2005","unstructured":"Bao, H., Cao, Z., Qian, H.: On the Security of a Group Signcryption Scheme from Distributed Signcryption Scheme. In: Desmedt, Y.G., Wang, H., Mu, Y., Li, Y. (eds.) CANS 2005. LNCS, vol.\u00a03810, pp. 26\u201334. Springer, Heidelberg (2005)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for Pairing-Based Cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"15_CR4","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, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in Elliptic curves in cryptography","author":"I.F. Blake","year":"2005","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic curves in cryptography. Cambridge University Press, Cambridge (2005)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"15_CR7","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)"},{"issue":"5","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G. Frey","year":"1999","unstructured":"Frey, G., M\u00fcller, M., R\u00fcck, H.G.: The Tate Pairing and Discrete Logarithm Applied to Elliptic Curve Cryptosystems. IEEE Trans. of Information Theory\u00a045(5), 1717\u20131719 (1999)","journal-title":"IEEE Trans. of Information Theory"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the Tate Pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"15_CR10","first-page":"33","volume-title":"Proceedings of the Fourth IASTED International Conference on Communication, Network and Information security: CNIS 2007","author":"I. Gupta","year":"2007","unstructured":"Gupta, I., Pillai, N.R., Saxena, P.K.: Distributed Signcryption Scheme on Hyperelliptic Curve. In: Proceedings of the Fourth IASTED International Conference on Communication, Network and Information security: CNIS 2007, pp. 33\u201339. Acta Press, Calgary (2007)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2000","unstructured":"Joux, A.: A One Round Protocol for Tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 385\u2013394. Springer, Heidelberg (2000)"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-003-0052-4","volume":"16","author":"A. Joux","year":"2003","unstructured":"Joux, A., 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":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-540-45203-4_31","volume-title":"Applied Cryptography and Network Security","author":"D.J. Kwak","year":"2003","unstructured":"Kwak, D.J., Moon, S.J.: Efficient Distributed Signcryption Scheme as Group Signcryption. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol.\u00a02846, pp. 403\u2013417. Springer, Heidelberg (2003)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.cose.2006.05.006","volume":"25","author":"D. Kwak","year":"2006","unstructured":"Kwak, D., Moon, S., Wang, G., Deng, R.H.: A Secure Extension of the Kwak-Moon Group Signcryption Scheme. Computer & Security\u00a025, 435\u2013444 (2006)","journal-title":"Computer & Security"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-73408-6_6","volume-title":"Public Key Infrastructure","author":"C.K. Li","year":"2007","unstructured":"Li, C.K., Yang, G., Wong, D.S., Deng, X., Chow, S.S.M.: An Efficient Signcryption Scheme with Key Privacy. In: L\u00f3pez, J., Samarati, P., Ferrer, J.L. (eds.) EuroPKI 2007. LNCS, vol.\u00a04582, pp. 78\u201393. Springer, Heidelberg (2007)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-24632-9_14","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"B. Libert","year":"2004","unstructured":"Libert, B., Quisquater, J.-J.: Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 187\u2013200. Springer, Heidelberg (2004)"},{"key":"15_CR17","unstructured":"Libert, B.: New Secure Applications of Bilinear Maps in Cryptography. PhD Thesis, Microelectronics Laboratory Laboratory, Universit\u00e9 Catholique de Louvain (January 2006)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing and Its Efficient Calculation. Journal of Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44495-5_14","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"Y. Mu","year":"2000","unstructured":"Mu, Y., Varadharajan, V.: Distributed Signcryption. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 155\u2013164. Springer, Heidelberg (2000)"},{"key":"15_CR20","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. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"issue":"4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.ipl.2006.01.015","volume":"99","author":"C.-H. Tan","year":"2006","unstructured":"Tan, C.-H.: Analysis of Improved Signcryption Scheme with Key Privacy. Information Processing Letter\u00a099(4), 135\u2013138 (2006)","journal-title":"Information Processing Letter"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11556992_16","volume-title":"Information Security","author":"G. Yang","year":"2005","unstructured":"Yang, G., Wong, D.S., Deng, X.: Analysis and Improvement of a Signcryption Scheme with Key Privacy. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 218\u2013232. Springer, Heidelberg (2005)"},{"key":"15_CR23","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)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25560-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:24:41Z","timestamp":1558297481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25560-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255595","9783642255601"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25560-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}