{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:11Z","timestamp":1772283671487,"version":"3.50.1"},"reference-count":46,"publisher":"Walter de Gruyter GmbH","issue":"3-4","license":[{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12,1]]},"abstract":"Abstract<\/jats:title>\n \n In 2002, An et al. [1] proposed three generic conversions of signcryption,\n \n \n \n \n \u2130<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{E}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ,\n \n \n \n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{S}t\\mathcal{E}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n \n \n \n \ud835\udc9e<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n <\/m:mrow>\n &<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{C}t\\mathcal{E}\\&\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n from the primitive encryption scheme and signature scheme. But, the security proof of confidentiality in the\n \n \n \n \n \n \ud835\udc9e<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n <\/m:mrow>\n &<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{C}t\\mathcal{E}\\&\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n paradigm was ambiguous. In this paper, we revisit these paradigms again and provide a more transparent proof for the aforementioned paradigm. None of these paradigms preserves both stronger securities:\n strong unforgeability<\/jats:italic>\n and IND-CCA security. We extend the above paradigms to new signcryption paradigms,\n \n \n \n \n \u2130<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{E}t\\mathcal{S}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n ,\n \n \n \n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{S}t\\mathcal{E}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n \n \n \n \ud835\udc9e<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n <\/m:mrow>\n &<\/m:mo>\n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{C}t\\mathcal{E}\\&\\mathcal{S}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , by applying one-time signature (OTS) cautiously at the outside layer. In these new paradigms, the stronger security of the primitive encryption and signature schemes are maintained. We also obtain a new paradigm, \u201cEncrypt and Sign then Sign (\n \n \n \n \n \u2130<\/m:mi>\n &<\/m:mo>\n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{E}\\&\\mathcal{S}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n )\u201d, which is surprisingly better than the\n \n \n \n \n \n \ud835\udc9e<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \u2130<\/m:mi>\n <\/m:mrow>\n &<\/m:mo>\n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{C}t\\mathcal{E}\\&\\mathcal{S}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n paradigm in all aspects except that\n \n \n \n \n \u2130<\/m:mi>\n &<\/m:mo>\n \n \ud835\udcae<\/m:mi>\n \u2062<\/m:mo>\n t<\/m:mi>\n \u2062<\/m:mo>\n \ud835\udcae<\/m:mi>\n <\/m:mrow>\n <\/m:mrow>\n <\/m:math>\n ${\\mathcal{E}\\&\\mathcal{S}t\\mathcal{S}}$<\/jats:tex-math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n does not guarantee the non-repudiation.\nMoreover, the IND-CCA security and strong unforgeability of the proposed signcryptions are achieved from the IND-gCCA secure encryption scheme and weak unforgeable signature scheme, respectively.\nFurther, we extend these paradigms to capture signcryptions in attribute-based setting, also known as attribute-based signcryption (ABSC). We show that the IND-CCA security and strong unforgeability under chosen message attack of ABSC can be obtained from IND-CPA security of ABE and unforgeability under no message attack of ABS, respectively.\nFurthermore, our generic constructions are applicable to a\n combined setup<\/jats:italic>\n , where the public parameters and keys for the primitives ABS and ABE are identical. The security of all the generic constructions is proven in the standard model.\n <\/jats:p>","DOI":"10.1515\/jmc-2015-0060","type":"journal-article","created":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T05:02:51Z","timestamp":1478754171000},"page":"181-221","source":"Crossref","is-referenced-by-count":3,"title":["On the security of joint signature and encryption revisited"],"prefix":"10.1515","volume":"10","author":[{"given":"Mridul","family":"Nandi","sequence":"first","affiliation":[{"name":"Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tapas","family":"Pandit","sequence":"additional","affiliation":[{"name":"Stat-Math Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700108, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"2025120600300299192_j_jmc-2015-0060_ref_001_w2aab3b7d912b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"An J. H., Dodis Y. and Rabin T.,\nOn the security of joint signature and encryption,\nAdvances in Cryptology \u2013 Eurocrypt 2002,\nLecture Notes in Comput. Sci. 2332,\nSpringer, Berlin (2002), 83\u2013107.","DOI":"10.1007\/3-540-46035-7_6"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_002_w2aab3b7d912b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"Attrapadung N., Libert B. and de Panafieu E.,\nExpressive key-policy attribute-based encryption with constant-size ciphertexts,\nPublic Key Cryptography \u2013 PKC 2011,\nLecture Notes in Comput. Sci. 6571,\nSpringer, Berlin (2011), 90\u2013108.","DOI":"10.1007\/978-3-642-19379-8_6"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_003_w2aab3b7d912b1b6b1ab2ab3Aa","doi-asserted-by":"crossref","unstructured":"Baek J., Steinfeld R. and Zheng Y.,\nFormal proofs for the security of signcryption,\nPublic Key Cryptography \u2013 PKC 2001,\nLecture Notes in Comput. Sci. 2274,\nSpringer, Berlin (2002), 80\u201398.","DOI":"10.1007\/3-540-45664-3_6"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_004_w2aab3b7d912b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"Barreto P. S. L. M., Libert B., McCullagh N. and Quisquater J.-J.,\nEfficient and provably-secure identity-based signatures and signcryption from bilinear maps,\nAdvances in Cryptology \u2013 Asiacrypt 2005,\nLecture Notes in Comput. Sci. 3788,\nSpringer, Berlin (2005), 515\u2013532.","DOI":"10.1007\/11593447_28"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_005_w2aab3b7d912b1b6b1ab2ab5Aa","unstructured":"Beimel A.,\nSecure schemes for secret sharing and key distribution,\npreprint 1996, www.shoup.net\/papers."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_006_w2aab3b7d912b1b6b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"Bethencourt J., Sahai A. and Waters B.,\nCiphertext-policy attribute-based encryption,\nIEEE Symposium on Security and Privacy,\nIEEE Press, Piscataway (2007), 321\u2013334.","DOI":"10.1109\/SP.2007.11"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_007_w2aab3b7d912b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"Boneh D., Canetti R., Halevi S. and Katz J.,\nChosen-ciphertext security from identity-based encryption,\nSIAM J. Comput. 36 (2006), no. 5, 1301\u20131328.","DOI":"10.1137\/S009753970544713X"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_008_w2aab3b7d912b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"Boyen X.,\nMultipurpose identity-based signcryption,\nAdvances in Cryptology \u2013 Crypto 2003,\nLecture Notes in Comput. Sci. 2729,\nSpringer, Berlin (2003), 383\u2013399.","DOI":"10.1007\/978-3-540-45146-4_23"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_009_w2aab3b7d912b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"Chen C., Chen J., Lim H. W., Zhang Z. and Feng D.,\nCombined public-key schemes: The case of ABE and ABS,\nProvable Security \u2013 ProvSec 2012,\nLecture Notes in Comput. Sci. 7496,\nSpringer, Berlin (2012), 53\u201369.","DOI":"10.1007\/978-3-642-33272-2_5"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_010_w2aab3b7d912b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"Chen L. and Malone-Lee J.,\nImproved identity-based signcryption,\nPublic Key Cryptography \u2013 PKC 2005,\nLecture Notes in Comput. Sci. 3386,\nSpringer, Berlin (2005), 362\u2013379.","DOI":"10.1007\/978-3-540-30580-4_25"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_011_w2aab3b7d912b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"Chiba D., Matsuda T., Schuldt J. C. N. and Matsuura K.,\nEfficient generic constructions of signcryption with insider security in the multi-user setting,\nApplied Cryptography and Network Security \u2013 ACNS 2011,\nLecture Notes in Comput. Sci. 6715,\nSpringer, Berlin (2011), 220\u2013237.","DOI":"10.1007\/978-3-642-21554-4_13"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_012_w2aab3b7d912b1b6b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"Dent A. W., Fischlin M., Manulis M. and Schr\u00f6der D.,\nConfidential signatures and deterministic signcryption,\nPublic Key Cryptography \u2013 PKC 2010,\nLecture Notes in Comput. Sci. 6056,\nSpringer, Berlin (2010), 462\u2013479.","DOI":"10.1007\/978-3-642-13013-7_27"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_013_w2aab3b7d912b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"Dodis Y. and An J. H.,\nConcealment and its applications to authenticated encryption,\nAdvances in Cryptology \u2013 Eurocrypt 2003,\nLecture Notes in Comput. Sci. 2656,\nSpringer, Berlin (2003), 312\u2013329.","DOI":"10.1007\/3-540-39200-9_19"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_014_w2aab3b7d912b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"Emura K., Miyaji A. and Rahman M. S.,\nDynamic attribute-based signcryption without random oracles,\nInt. J. Appl. Cryptogr. 2 (2012), no. 11, 199\u2013211.","DOI":"10.1504\/IJACT.2012.045589"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_015_w2aab3b7d912b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"Gagn\u00e9 M., Narayan S. and Safavi-Naini R.,\nThreshold attribute-based signcryption,\nSecurity and Cryptography for Networks \u2013 SCN 2010,\nLecture Notes in Comput. Sci. 6280,\nSpringer, Berlin (2010), 154\u2013171.","DOI":"10.1007\/978-3-642-15317-4_11"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_016_w2aab3b7d912b1b6b1ab2ac16Aa","unstructured":"Goldreich O.,\nFoundations of Cryptography. Volume 2: Basic Applications,\nCambridge University Press, Cambridge, 2004."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_017_w2aab3b7d912b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"Goyal V., Pandey O., Sahai A. and Waters B.,\nAttribute-based encryption for fine-grained access control of encrypted data,\nProceedings of the 13th ACM Conference on Computer and Communications Security \u2013 CCS \u201906,\nACM, New York (2006), 89\u201398.","DOI":"10.1145\/1180405.1180418"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_018_w2aab3b7d912b1b6b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"Halevi S. and Micali S.,\nPractical and provably-secure commitment schemes from collision-free hashing,\nAdvances in Cryptology \u2013 Crypto 1996,\nLecture Notes in Comput. Sci. 1109,\nSpringer, Berlin (1996), 201\u2013215.","DOI":"10.1007\/3-540-68697-5_16"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_019_w2aab3b7d912b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"Huang Q., Wong D. S. and Zhao Y.,\nGeneric transformation to strongly unforgeable signatures,\nApplied Cryptography and Network Security \u2013 ACNS 2007,\nLecture Notes in Comput. Sci. 4521,\nSpringer, Berlin (2007), 1\u201317.","DOI":"10.1007\/978-3-540-72738-5_1"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_020_w2aab3b7d912b1b6b1ab2ac20Aa","doi-asserted-by":"crossref","unstructured":"Kiltz E.,\nChosen-ciphertext security from tag-based encryption,\nTheory of Cryptography \u2013 TCC 2006,\nLecture Notes in Comput. Sci. 3876,\nSpringer, Berlin (2006), 581\u2013600.","DOI":"10.1007\/11681878_30"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_021_w2aab3b7d912b1b6b1ab2ac21Aa","unstructured":"Lamport L.,\nConstructing digital signatures from a one-way function,\nTechnical Report CSL-98, SRI International, Palo Alto, 1979."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_022_w2aab3b7d912b1b6b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"Lewko A. B., Okamoto T., Sahai A., Takashima K. and Waters B.,\nFully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption,\nAdvances in Cryptology \u2013 Eurocrypt 2010,\nLecture Notes in Comput. Sci. 6110,\nSpringer, Berlin (2010), 62\u201391.","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_023_w2aab3b7d912b1b6b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"Lewko A. and Waters B.,\nNew proof methods for attribute-based encryption: Achieving full security through selective techniques,\nAdvances in Cryptology \u2013 Crypto 2012,\nLecture Notes in Comput. Sci. 7417,\nSpringer, Berlin (2012), 180\u2013198.","DOI":"10.1007\/978-3-642-32009-5_12"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_024_w2aab3b7d912b1b6b1ab2ac24Aa","doi-asserted-by":"crossref","unstructured":"Li J., Au M. H., Susilo W., Xie D. and Ren K.,\nAttribute-based signature and its applications,\nProceedings of the 5th ACM Symposium on Information, Computer and Communications Security \u2013 ASIACCS \u201910,\nACM, New York (2010), 60\u201369.","DOI":"10.1145\/1755688.1755697"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_025_w2aab3b7d912b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"Libert B. and Quisquater J.-J.,\nEfficient signcryption with key privacy from gap diffie-hellman groups,\nPublic Key Cryptography \u2013 PKC 2004,\nLecture Notes in Comput. Sci. 2947,\nSpringer, Berlin (2004), 187\u2013200.","DOI":"10.1007\/978-3-540-24632-9_14"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_026_w2aab3b7d912b1b6b1ab2ac26Aa","doi-asserted-by":"crossref","unstructured":"Libert B. and Quisquater J.-J.,\nImproved signcryption from q-Diffie\u2013Hellman problems,\nSecurity in Communication Networks \u2013 SCN 2004,\nLecture Notes in Comput. Sci. 3352,\nSpringer, Berlin (2004), 220\u2013234.","DOI":"10.1007\/978-3-540-30598-9_16"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_027_w2aab3b7d912b1b6b1ab2ac27Aa","unstructured":"Maji H., Prabhakaran M. and Rosulek M.,\nAttribute-based signatures: Achieving attribute-privacy and collusion-resistance,\npreprint 2008, http:\/\/eprint.iacr.org\/2008\/328."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_028_w2aab3b7d912b1b6b1ab2ac28Aa","doi-asserted-by":"crossref","unstructured":"Maji H., Prabhakaran M. and Rosulek M.,\nAttribute-based signatures,\npreprint 2010, http:\/\/eprint.iacr.org\/2010\/595.","DOI":"10.1007\/978-3-642-14623-7_32"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_029_w2aab3b7d912b1b6b1ab2ac29Aa","doi-asserted-by":"crossref","unstructured":"Malone-Lee J. and Mao W.,\nTwo birds one stone: Signcryption using RSA,\nTopics in Cryptology \u2013 CT-RSA 2003,\nLecture Notes in Comput. Sci. 2612,\nSpringer, Berlin (2003), 211\u2013226.","DOI":"10.1007\/3-540-36563-X_14"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_030_w2aab3b7d912b1b6b1ab2ac30Aa","doi-asserted-by":"crossref","unstructured":"Matsuda T., Matsuura K. and Schuldt J. C. N.,\nEfficient constructions of signcryption schemes and signcryption composability,\nProgress in Cryptology \u2013 Indocrypt 2009,\nLecture Notes in Comput. Sci. 5922,\nSpringer, Berlin (2009), 321\u2013342.","DOI":"10.1007\/978-3-642-10628-6_22"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_031_w2aab3b7d912b1b6b1ab2ac31Aa","unstructured":"Nandi M. and Pandit T.,\nGeneric conversions from CPA to CCA secure functional encryption,\npreprint 2015, http:\/\/eprint.iacr.org\/2015\/457."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_032_w2aab3b7d912b1b6b1ab2ac32Aa","doi-asserted-by":"crossref","unstructured":"Naor M. and Yung M.,\nUniversal one-way hash functions and their cryptographic applications,\nProceedings of the Twenty-First Annual ACM Symposium on Theory of Computing \u2013 STOC \u201989,\nACM, New York (1989), 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_033_w2aab3b7d912b1b6b1ab2ac33Aa","doi-asserted-by":"crossref","unstructured":"Okamoto T. and Takashima K.,\nFully secure functional encryption with general relations from the decisional linear assumption,\nAdvances in Cryptology \u2013 Crypto 2010,\nLecture Notes in Comput. Sci. 6223,\nSpringer, Berlin (2010), 191\u2013208.","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_034_w2aab3b7d912b1b6b1ab2ac34Aa","doi-asserted-by":"crossref","unstructured":"Okamoto T. and Takashima K.,\nEfficient attribute-based signatures for non-monotone predicates in the standard model,\nPublic Key Cryptography \u2013 PKC 2011,\nLecture Notes in Comput. Sci. 6571,\nSpringer, Berlin (2011), 35\u201352.","DOI":"10.1007\/978-3-642-19379-8_3"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_035_w2aab3b7d912b1b6b1ab2ac35Aa","doi-asserted-by":"crossref","unstructured":"Ostrovsky R., Sahai A. and Waters B.,\nAttribute-based encryption with non-monotonic access structures,\nProceedings of the 14th ACM Conference on Computer and Communications Security \u2013 CCS \u201907,\nACM, New York (2007), 195\u2013203.","DOI":"10.1145\/1315245.1315270"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_036_w2aab3b7d912b1b6b1ab2ac36Aa","doi-asserted-by":"crossref","unstructured":"Pandit T., Pandey S. K. and Barua R.,\nAttribute-based signcryption: Signer privacy, strong unforgeability and IND-CCA2 security in adaptive-predicates attack,\nProvable Security \u2013 ProvSec 2014,\nLecture Notes in Comput. Sci. 8782,\nSpringer, Berlin (2014), 274\u2013290.","DOI":"10.1007\/978-3-319-12475-9_19"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_037_w2aab3b7d912b1b6b1ab2ac37Aa","unstructured":"Rabin M. O.,\nDigitalized signatures,\nFound. Sec. Comput. 78 (1978), 155\u2013166."},{"key":"2025120600300299192_j_jmc-2015-0060_ref_038_w2aab3b7d912b1b6b1ab2ac38Aa","doi-asserted-by":"crossref","unstructured":"Rao Y. S. and Dutta R.,\nExpressive bandwidth-efficient attribute based signature and signcryption in standard model,\nInformation Security and Privacy \u2013 ACISP 2014,\nLecture Notes in Comput. Sci. 8544,\nSpringer, Berlin (2014), 209\u2013225.","DOI":"10.1007\/978-3-319-08344-5_14"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_039_w2aab3b7d912b1b6b1ab2ac39Aa","doi-asserted-by":"crossref","unstructured":"Reyzin L. and Reyzin N.,\nBetter than biba: Short one-time signatures with fast signing and verifying,\nInformation Security and Privacy \u2013 ACISP 2002,\nLecture Notes in Comput. Sci. 2384,\nSpringer, Berlin (2002), 144\u2013153.","DOI":"10.1007\/3-540-45450-0_11"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_040_w2aab3b7d912b1b6b1ab2ac40Aa","doi-asserted-by":"crossref","unstructured":"Sahai A. and Waters B.,\nFuzzy identity-based encryption,\nAdvances in Cryptology \u2013 Eurocrypt 2005,\nLecture Notes in Comput. Sci. 3494,\nSpringer, Berlin (2005), 457\u2013473.","DOI":"10.1007\/11426639_27"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_041_w2aab3b7d912b1b6b1ab2ac41Aa","doi-asserted-by":"crossref","unstructured":"Shahandashti S. F. and Safavi-Naini R.,\nThreshold attribute-based signatures and their application to anonymous credential systems,\nProgress in Cryptology \u2013 Africacrypt 2009,\nLecture Notes in Comput. Sci. 5580,\nSpringer, Berlin (2009), 198\u2013216.","DOI":"10.1007\/978-3-642-02384-2_13"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_042_w2aab3b7d912b1b6b1ab2ac42Aa","doi-asserted-by":"crossref","unstructured":"Tan C. H.,\nSigncryption scheme in multi-user setting without random oracles,\nAdvances in Information and Computer Security \u2013 IWSEC 2008,\nLecture Notes in Comput. Sci. 5312,\nSpringer, Berlin (2008), 64\u201382.","DOI":"10.1007\/978-3-540-89598-5_5"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_043_w2aab3b7d912b1b6b1ab2ac43Aa","doi-asserted-by":"crossref","unstructured":"Wang C. and Huang J.,\nAttribute-based signcryption with ciphertext-policy and claim-predicate mechanism,\n2011 Seventh International Conference on Computational Intelligence and Security,\nIEEE Press, Piscataway (2011), 905\u2013909.","DOI":"10.1109\/CIS.2011.204"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_044_w2aab3b7d912b1b6b1ab2ac44Aa","doi-asserted-by":"crossref","unstructured":"Waters B.,\nCiphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization,\nPublic Key Cryptography \u2013 PKC 2011,\nLecture Notes in Comput. Sci. 6571,\nSpringer, Berlin (2011), 53\u201370.","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_045_w2aab3b7d912b1b6b1ab2ac45Aa","doi-asserted-by":"crossref","unstructured":"Yamada S., Attrapadung N., Hanaoka G. and Kunihiro N.,\nGeneric constructions for chosen-ciphertext secure attribute based encryption,\nPublic Key Cryptography \u2013 PKC 2011,\nLecture Notes in Comput. Sci. 6571,\nSpringer, Berlin (2011), 71\u201389.","DOI":"10.1007\/978-3-642-19379-8_5"},{"key":"2025120600300299192_j_jmc-2015-0060_ref_046_w2aab3b7d912b1b6b1ab2ac46Aa","doi-asserted-by":"crossref","unstructured":"Zheng Y.,\nDigital signcryption or how to achieve cost(signature & encryption) \u226a${\\ll}$ cost(signature) + cost(encryption),\nAdvances in Cryptology \u2013 Crypto \u201997,\nLecture Notes in Comput. Sci. 1294,\nSpringer, Berlin (1997), 165\u2013179.","DOI":"10.1007\/BFb0052234"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jmc.2016.10.issue-3-4\/jmc-2015-0060\/jmc-2015-0060.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0060\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0060\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:31:27Z","timestamp":1764981087000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2015-0060\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,10]]},"references-count":46,"journal-issue":{"issue":"3-4","published-online":{"date-parts":[[2016,12,1]]},"published-print":{"date-parts":[[2016,12,1]]}},"alternative-id":["10.1515\/jmc-2015-0060"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2015-0060","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"value":"1862-2984","type":"electronic"},{"value":"1862-2976","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11,10]]}}}