{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T18:31:22Z","timestamp":1773772282188,"version":"3.50.1"},"reference-count":21,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1587\/transinf.2022ngi0001","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T22:21:10Z","timestamp":1667254870000},"page":"1836-1844","source":"Crossref","is-referenced-by-count":3,"title":["Generic Construction of 1-out-of-<i>n<\/i> Oblivious Signatures"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Yu","family":"ZHOU","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"},{"name":"State Key Laboratory of Cryptology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"LIU","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"},{"name":"State Key Laboratory of Cryptology"},{"name":"Westone Cryptologic Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"HAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] L. Chen, \u201cOblivious signatures,\u201d Computer Security-ESORICS 94, Third European Symposium on Research in Computer Security, Brighton, UK, Nov. 7-9, 1994, Proceedings, ed. D. Gollmann, Lecture Notes in Computer Science, vol.875, pp.161-172, Springer, 1994. 10.1007\/3-540-58618-0_62","DOI":"10.1007\/3-540-58618-0_62"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] R. Tso, T. Okamoto, and E. Okamoto, \u201c1-out-of-n oblivious signatures,\u201d International Conference on Information Security Practice and Experience, pp.45-55, 2008.","DOI":"10.1007\/978-3-540-79104-1_4"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] S. Chiou and J. Chen, \u201cDesign and implementation of a multiple-choice e-voting scheme on mobile system using novel t-out-of-n oblivious signature,\u201d J. Inf. Sci. Eng., vol.34, no.1, pp.135-154, 2018.","DOI":"10.1155\/2017\/3075210"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] R. Tso, \u201cTwo-in-one oblivious signatures,\u201d Future Gener. Comput. Syst., vol.101, pp.467-475, 2019. 10.1016\/j.future.2019.06.014","DOI":"10.1016\/j.future.2019.06.014"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] D. Chaum and T.P. Pedersen, \u201cWallet databases with observers,\u201ded. E.F. Brickell, Lecture Notes in Computer Science, vol.740, pp.89-105, Springer, 1992.","DOI":"10.1007\/3-540-48071-4_7"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] C.P. Schnorr, \u201cEfficient signature generation by smart cards,\u201d J. Cryptol., vol.4, no.3, pp.161-174, 1991. 10.1007\/bf00196725","DOI":"10.1007\/BF00196725"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] N. Li, W. Du, and D. Boneh, \u201cOblivious signature-based envelope,\u201d Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, PODC 2003, Boston, Massachusetts, USA, July 13-16, 2003, ed. E. Borowsky and S. Rajsbaum, pp.182-189, ACM, 2003. 10.1145\/872035.872061","DOI":"10.1145\/872035.872061"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] R.L. Rivest, A. Shamir, and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems (reprint),\u201d Commun. ACM, vol.26, no.1, pp.96-99, 1983. 10.1145\/357980.358017","DOI":"10.1145\/357980.358017"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] C. Song, X. Yin, and Y. Liu, \u201cA practical electronic voting protocol based upon oblivious signature scheme,\u201d 2008 International Conference on Computational Intelligence and Security, pp.381-384, IEEE, 2008. 10.1109\/cis.2008.165","DOI":"10.1109\/CIS.2008.165"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] C. Li, Z. Yuan, and M. Mao, \u201cSecure obfuscation of a two-step oblivious signature,\u201d International Conference on Network Computing and Information Security, vol.345, pp.680-688, Springer, 2012. 10.1007\/978-3-642-35211-9_86","DOI":"10.1007\/978-3-642-35211-9_86"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] S.-Y. Chiou and Y.-X. He, \u201cGeneralized proxy oblivious signature and its mobile application,\u201d Secur. Commun. Networks, vol.2021, pp.5531505:1-5531505:16, 2021. 10.1155\/2021\/5531505","DOI":"10.1155\/2021\/5531505"},{"key":"12","unstructured":"[12] M. Mambo, K. Usuda, and E. Okamoto, \u201cProxy signatures: Delegation of the power to sign messages,\u201d IEICE Trans. Fundamentals, vol.E79-A, no.9, pp.1338-1354, 1996."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] T.E. Gamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms,\u201d ed. G.R. Blakley and D. Chaum, Lecture Notes in Computer Science, vol.196, pp.10-18, Springer, 1984.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] P. Paillier, \u201cPublic-key cryptosystems based on composite degree residuosity classes,\u201d ed. J. Stern, Lecture Notes in Computer Science, vol.1592, pp.223-238, Springer, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] O. Regev, \u201cOn lattices, learning with errors, random linear codes, and cryptography,\u201d Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, ed. H.N. Gabow and R. Fagin, pp.84-93, ACM, 2005. 10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"16","unstructured":"[16] M.O. Rabin, \u201cDigitalized signatures and public-key functions as intractable as factorization,\u201d Tech. Rep., Massachusetts Inst. of Tech. Cambridge Lab for Computer Science, 1979."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] J. Katz, Digital Signatures, Springer, 2010.","DOI":"10.1007\/978-0-387-27712-7"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] O. Blazy, S.A. Kakvi, E. Kiltz, and J. Pan, \u201cTightly-secure signatures from chameleon hash functions,\u201d Public-Key Cryptography-PKC 2015-18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings, ed. J. Katz, Lecture Notes in Computer Science, vol.9020, pp.256-279, Springer, 2015. 10.1007\/978-3-662-46447-2_12","DOI":"10.1007\/978-3-662-46447-2_12"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] X. Zhang, S. Liu, D. Gu, and J.K. Liu, \u201cA generic construction of tightly secure signatures in the multi-user setting,\u201d Theor. Comput. Sci., vol.775, pp.32-52, 2019. 10.1016\/j.tcs.2018.12.012","DOI":"10.1016\/j.tcs.2018.12.012"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] X. Zhang, S. Liu, J. Pan, and D. Gu, \u201cTightly secure signature schemes from the LWE and subset sum assumptions,\u201d Theor. Comput. Sci., vol.795, pp.326-344, 2019. 10.1016\/j.tcs.2019.07.015","DOI":"10.1016\/j.tcs.2019.07.015"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] R. Steinfeld, J. Pieprzyk, and H. Wang, \u201cHow to strengthen any weakly unforgeable signature into a strongly unforgeable signature,\u201d Topics in Cryptology-CT-RSA 2007, The Cryptographers' Track at the RSA Conference 2007, San Francisco, CA, USA, Feb. 5-9, 2007, Proceedings, ed. M. Abe, Lecture Notes in Computer Science, vol.4377, pp.357-371, Springer, 2007. 10.1007\/11967668_23","DOI":"10.1007\/11967668_23"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/11\/E105.D_2022NGI0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T04:54:46Z","timestamp":1715316886000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/11\/E105.D_2022NGI0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022ngi0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,1]]},"article-number":"2022NGI0001"}}