{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:59:47Z","timestamp":1766066387026},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T00:00:00Z","timestamp":1403568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10623-014-9986-9","type":"journal-article","created":{"date-parts":[[2014,6,23]],"date-time":"2014-06-23T03:50:13Z","timestamp":1403495413000},"page":"61-98","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES"],"prefix":"10.1007","volume":"77","author":[{"given":"Ryo","family":"Nishimaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"Xagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,24]]},"reference":[{"key":"9986_CR1","doi-asserted-by":"crossref","unstructured":"Abe M., Chase M., David B., Kohlweiss M., Nishimaki R., Ohkubo M.: Constant-size structure-preserving signatures: generic constructions and simple assumptions. In: ASIACRYPT\u201912. Lecture Notes in Computer Science, vol. 7658, pp. 4\u201324. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-34961-4_3"},{"key":"9986_CR2","unstructured":"Asokan N., Shoup V., Waidner M.: Optimistic fair exchange of digital signatures (extended abstract). In: EUROCRYPT\u201998. Lecture Notes in Computer Science, vol. 1403, pp. 591\u2013606. Springer, Berlin (1998)."},{"key":"9986_CR3","unstructured":"Bao F., Deng R.H., Mao W.: Efficient and practical fair exchange protocols with off-line TTP. In: IEEE Symposium on Security and Privacy\u201998, pp. 77\u201385. IEEE Computer Society, Washington, DC (1998)."},{"key":"9986_CR4","doi-asserted-by":"crossref","unstructured":"Barak B., Goldreich O., Impagliazzo R., Rudich S., Sahai A., Vadhan S.P., Yang K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012).","DOI":"10.1145\/2160158.2160159"},{"key":"9986_CR5","doi-asserted-by":"crossref","unstructured":"Belenkiy M., Camenisch J., Chase M., Kohlweiss M., Lysyanskaya A., Shacham H.: Randomizable proofs and delegatable anonymous credentials. In: CRYPTO\u201909. Lecture Notes in Computer Science, vol. 5677, pp. 108\u2013125. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-03356-8_7"},{"key":"9986_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky N., Canetti R.: On strong simulation and composable point obfuscation. In: CRYPTO\u201910. Lecture Notes in Computer Science, vol. 6223, pp. 520\u2013537 (2010).","DOI":"10.1007\/978-3-642-14623-7_28"},{"key":"9986_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008).","DOI":"10.1007\/s00145-007-9005-7"},{"key":"9986_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586\u2013615 (2003).","DOI":"10.1137\/S0097539701398521"},{"key":"9986_CR9","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X., Shacham H.: Short group signatures. In: CRYPTO\u201904. Lecture Notes in Computer Science, vol. 3152, pp. 41\u201355. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"9986_CR10","doi-asserted-by":"crossref","unstructured":"Boneh D., Lynn B., Shacham H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004).","DOI":"10.1007\/s00145-004-0314-9"},{"key":"9986_CR11","doi-asserted-by":"crossref","unstructured":"Boneh D., Shen E., Waters B.: Strongly unforgeable signatures based on computational Diffie\u2013Hellman. In: PKC\u201906. Lecture Notes in Computer Science, vol. 3958, pp. 229\u2013240. Springer, Berlin (2006).","DOI":"10.1007\/11745853_15"},{"key":"9986_CR12","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Lynn B., Shacham H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: EUROCRYPT\u201903. Lecture Notes in Computer Science, vol. 2656, pp. 416\u2013432. Springer, Berlin (2003).","DOI":"10.1007\/3-540-39200-9_26"},{"key":"9986_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: CRYPTO\u201912. Lecture Notes in Computer Science, vol. 7417, pp. 868\u2013886. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"9986_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106. IEEE Press, New York, NY (2011).","DOI":"10.1109\/FOCS.2011.12"},{"key":"9986_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325. ACM Press, New york, NY (2012).","DOI":"10.1145\/2090236.2090262"},{"key":"9986_CR16","doi-asserted-by":"crossref","unstructured":"Canetti R.: Towards realizing random oracles: Hash functions that hide all partial information. In: CRYPTO\u201997. Lecture Notes in Computer Science, vol. 1294, pp. 455\u2013469. Springer, Berlin (1997).","DOI":"10.1007\/BFb0052255"},{"key":"9986_CR17","doi-asserted-by":"crossref","unstructured":"Canetti R., Dakdouk R.R.: Obfuscating point functions with multibit output. In: EUROCRYPT\u201908. Lecture Notes in Computer Science, vol. 4965, pp. 489\u2013508. Springer, Berlin (2008).","DOI":"10.1007\/978-3-540-78967-3_28"},{"key":"9986_CR18","doi-asserted-by":"crossref","unstructured":"Canetti R., Varia M.: Non-malleable obfuscation. In: TCC\u201909. Lecture Notes in Computer Science, vol. 5444, pp. 73\u201390. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-00457-5_6"},{"key":"9986_CR19","doi-asserted-by":"crossref","unstructured":"Canetti R., Micciancio D., Reingold O.: Perfectly one-way probabilistic hash functions (preliminary version). In: STOC\u201998, pp. 131\u2013140. ACM Press, New York, NY (1998).","DOI":"10.1145\/276698.276721"},{"key":"9986_CR20","doi-asserted-by":"crossref","unstructured":"Canetti R., Rothblum G.N., Varia M.: Obfuscation of hyperplane membership. In: TCC\u201910. Lecture Notes in Computer Science, vol. 5978, pp. 72\u201389. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-11799-2_5"},{"key":"9986_CR21","doi-asserted-by":"crossref","unstructured":"Canetti R., Kalai Y.T., Varia M., Wichs D.: On symmetric encryption and point obfuscation. In: TCC\u201910. Lecture Notes in Computer Science, vol. 5978, pp. 52\u201371. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-11799-2_4"},{"key":"9986_CR22","doi-asserted-by":"crossref","unstructured":"Chandran N., Chase M., Vaikuntanathan V.: Collusion resistant obfuscation and functional re-encryption. In: TCC\u201912. Lecture Notes in Computer Science, vol. 7194, pp. 404\u2013421. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-28914-9_23"},{"key":"9986_CR23","doi-asserted-by":"crossref","unstructured":"Cheng R., Zhang B., Zhang F.: Secure obfuscation of encrypted verifiable encrypted signatures. In: ProvSec\u201911. Lecture Notes in Computer Science, vol. 6980, pp. 188\u2013203. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-24316-5_14"},{"key":"9986_CR24","doi-asserted-by":"crossref","unstructured":"Cheon J.H., Coron J.S., Kim J., Lee M.S., Lepoint T., Tibouchi M., Yun A.: Batch fully homomorphic encryption over the integers. In: EUROCRYPT\u201913. Lecture Notes in Computer Science, vol. 7881, pp. 315\u2013335. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"9986_CR25","doi-asserted-by":"crossref","unstructured":"Coron J.S., Naccache D.: Boneh et al\u2019.s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In: ASIACRYPT\u201903. Lecture Notes in Computer Science, vol. 2894, pp. 392\u2013397. Springer, Berlin (2003).","DOI":"10.1007\/978-3-540-40061-5_25"},{"key":"9986_CR26","doi-asserted-by":"crossref","unstructured":"Coron J.S., Mandal A., Naccache D., Tibouchi M.: Fully homomorphic encryption over the integers with shorter public keys. In: CRYPTO\u201911. Lecture Notes in Computer Science, vol. 6841, pp. 487\u2013504. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"9986_CR27","doi-asserted-by":"crossref","unstructured":"Dodis Y., Smith A.: Correcting errors without leaking partial information. In: STOC\u201905, pp. 654\u2013663. ACM Press, New York, NY (2005).","DOI":"10.1145\/1060590.1060688"},{"key":"9986_CR28","doi-asserted-by":"crossref","unstructured":"Dodis Y., Lee P.J., Yum D.H.: Optimistic fair exchange in a multi-user setting. In: PKC\u201907. Lecture Notes in Computer Science, vol. 4450, pp. 118\u2013133. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-71677-8_9"},{"key":"9986_CR29","doi-asserted-by":"crossref","unstructured":"Fouque P.A., Joux A., Tibouchi M.: Injective encodings to elliptic curves. In: ACISP\u201913. Lecture Notes in Computer Science, vol. 7959, pp. 203\u2013218. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-39059-3_14"},{"key":"9986_CR30","doi-asserted-by":"crossref","unstructured":"Fuchsbauer G.: Commuting signatures and verifiable encryption. In: EUROCRYPT\u201911. Lecture Notes in Computer Science, vol. 6632, pp. 224\u2013245. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-20465-4_14"},{"key":"9986_CR31","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S.: Candidate multilinear maps from ideal lattices. In: EUROCRYPT\u201913. Lecture Notes in Computer Science, vol. 7881, pp. 1\u201317. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"9986_CR32","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S., Raykova M., Sahai A., Waters B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS\u201913. IEEE press, New York, NY (2013).","DOI":"10.1109\/FOCS.2013.13"},{"key":"9986_CR33","doi-asserted-by":"crossref","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: STOC\u201909, pp. 169\u2013178. ACM Press, New York, NY (2009).","DOI":"10.1145\/1536414.1536440"},{"key":"9986_CR34","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: FOCS\u201911, pp. 107\u2013116. IEEE Press, New York, NY (2011).","DOI":"10.1109\/FOCS.2011.94"},{"key":"9986_CR35","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S.: Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: EUROCRYPT\u201911. Lecture Notes in Computer Science, vol. 6632, pp. 129\u2013148. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"9986_CR36","doi-asserted-by":"crossref","unstructured":"Gentry C., Halevi S., Smart N.P.: Fully homomorphic encryption with polylog overhead. In: EUROCRYPT\u201912. Lecture Notes in Computer Science, vol. 7237, pp. 465\u2013482. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"9986_CR37","doi-asserted-by":"crossref","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: CRYPTO\u201913 (1). Lecture Notes in Computer Science, vol. 8042, pp. 75\u201392. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"9986_CR38","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS\u201905, pp. 553\u2013562. IEEE press, New York, NY (2005).","DOI":"10.1109\/SFCS.2005.60"},{"key":"9986_CR39","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Rothblum G.N.: On best-possible obfuscation. In: TCC\u201907. Lecture Notes in Computer Science, vol. 4392, pp. 194\u2013213. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-70936-7_11"},{"key":"9986_CR40","doi-asserted-by":"crossref","unstructured":"Hada S.: Zero-knowledge and code obfuscation. In: ASIACRYPT\u201900. Lecture Notes in Computer Science, vol. 1976, pp. 443\u2013457. Springer, Berlin (2000).","DOI":"10.1007\/3-540-44448-3_34"},{"key":"9986_CR41","doi-asserted-by":"crossref","unstructured":"Hada S.: Secure obfuscation for encrypted signatures. In: EUROCRYPT\u201910. Lecture Notes in Computer Science, vol. 6110, pp. 92\u2013112. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_5"},{"key":"9986_CR42","doi-asserted-by":"crossref","unstructured":"Hofheinz D., Malone-Lee J., Stam M.: Obfuscation for cryptographic purposes. J. Cryptol. 23(1), 121\u2013168 (2010).","DOI":"10.1007\/s00145-009-9046-1"},{"key":"9986_CR43","doi-asserted-by":"crossref","unstructured":"Hohenberger S., Rothblum G.N., Shelat A., Vaikuntanathan V.: Securely obfuscating re-encryption. J. Cryptol. 24(4), 694\u2013719 (2011).","DOI":"10.1007\/s00145-010-9077-7"},{"key":"9986_CR44","doi-asserted-by":"crossref","unstructured":"Lu S., Ostrovsky R., Sahai A., Shacham H., Waters B.: Sequential aggregate signatures and multisignatures without random oracles. In: EUROCRYPT\u201906. Lecture Notes in Computer Science, vol. 4004, pp. 465\u2013485. Springer, Berlin (2006).","DOI":"10.1007\/11761679_28"},{"key":"9986_CR45","doi-asserted-by":"crossref","unstructured":"Lu S., Ostrovsky R., Sahai A., Shacham H., Waters B.: Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles. J. Cryptol. 26(2), 340\u2013373 (2013).","DOI":"10.1007\/s00145-012-9126-5"},{"key":"9986_CR46","doi-asserted-by":"crossref","unstructured":"Lynn B., Prabhakaran M., Sahai A.: Positive results and techniques for obfuscation. In: EUROCRYPT\u201904. Lecture Notes in Computer Science, vol. 3027, pp. 20\u201339. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-24676-3_2"},{"key":"9986_CR47","doi-asserted-by":"crossref","unstructured":"R\u00fcckert M.: Verifiably encrypted signatures from RSA without NIZKs. In: INDOCRYPT\u201909. Lecture Notes in Computer Science, vol. 5922, pp. 363\u2013377. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-10628-6_24"},{"key":"9986_CR48","doi-asserted-by":"crossref","unstructured":"R\u00fcckert M., Schr\u00f6der D.: Security of verifiably encrypted signatures and a construction without random oracles. In: Pairing\u201909. Lecture Notes in Computer Science, vol. 5671, pp. 17\u201334. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-03298-1_2"},{"key":"9986_CR49","doi-asserted-by":"crossref","unstructured":"R\u00fcckert M., Schneider M., Schr\u00f6der D.: Generic constructions for verifiably encrypted signatures without random oracles or NIZKs. In: ACNS\u201910. Lecture Notes in Computer Science, vol. 6123, pp. 69\u201386 (2010).","DOI":"10.1007\/978-3-642-13708-2_5"},{"key":"9986_CR50","doi-asserted-by":"crossref","unstructured":"Shoup V.: Lower bounds for discrete logarithms and related problems. In: EUROCRYPT\u201997, LNCS, vol. 1233, pp. 256\u2013266 (1997).","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9986_CR51","doi-asserted-by":"crossref","unstructured":"van Dijk M., Gentry C., Halevi S., Vaikuntanathan V.: Fully homomorphic encryption over the integers. In: EUROCRYPT\u201910. Lecture Notes in Computer Science, vol. 6110, pp. 24\u201343. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"9986_CR52","doi-asserted-by":"crossref","unstructured":"Waters B.: Efficient identity-based encryption without random oracles. In: EUROCRYPT\u201905. Lecture Notes in Computer Science, vol. 3494, pp. 114\u2013127. Springer, Berlin (2005).","DOI":"10.1007\/11426639_7"},{"key":"9986_CR53","doi-asserted-by":"crossref","unstructured":"Waters B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: CRYPTO\u201909. Lecture Notes in Computer Science, vol. 5677, pp. 619\u2013636. Springer, Berlin (2009). Full version available from http:\/\/eprint.iacr.org\/2009\/385 .","DOI":"10.1007\/978-3-642-03356-8_36"},{"key":"9986_CR54","doi-asserted-by":"crossref","unstructured":"Wee H.: On obfuscating point functions. In: STOC\u201905, pp. 523\u2013532. ACM Press, New York, NY (2005).","DOI":"10.1145\/1060590.1060669"},{"key":"9986_CR55","doi-asserted-by":"crossref","unstructured":"Zhang F., Safavi-Naini R., Susilo W.: Efficient verifiably encrypted signature and partially blind signature from bilinear pairings. In: INDOCRYPT\u201903. Lecture Notes in Computer Science, vol. 2904, pp. 191\u2013204. Springer Berlin (2003).","DOI":"10.1007\/978-3-540-24582-7_14"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9986-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9986-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9986-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T20:24:30Z","timestamp":1565555070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9986-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,24]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9986"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9986-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,24]]}}}