{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T11:04:26Z","timestamp":1777806266271,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2024,6,3]],"date-time":"2024-06-03T00:00:00Z","timestamp":1717372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2024,11,20]]},"abstract":"<jats:p>Identity-based chameleon hash (IBCH) is a cryptographic primitive with nice properties. IBCH equips each user with a trapdoor and the hash values can be publicly evaluated w.r.t. the identity of any user. On the one hand, it is hard to find collisions for the hash values without the user\u2019s trapdoor. On the other hand, with the help of the user\u2019s trapdoor, finding collisions becomes easy. An important application of IBCH is to upgrade an identity-based signature (IBS) scheme to an on-line\/off-line identity-based signature (OO-IBS) scheme. OO-IBS is a useful tool to provide authenticity in lightweight smart devices, since it only involves light on-line computations and does not need key certificate. Up to now, there are many IBCH constructions from traditional number-theoretic assumptions like RSA, CDH, etc. However, none of the existing IBCH schemes achieve the post-quantum security in the standard model.<\/jats:p>\n                  <jats:p>In this paper, we propose a new IBCH scheme from lattices. The security of our IBCH is reduced to a well-accepted lattice-based assumption\u00a0\u2013 the Short Integer Solution (SIS) assumption in the standard model. Our work provides the first post-quantum solution to IBCH in the standard model.<\/jats:p>","DOI":"10.3233\/jcs-220121","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T14:44:53Z","timestamp":1717512293000},"page":"509-531","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Identity-based chameleon hash from lattices"],"prefix":"10.1177","volume":"32","author":[{"given":"Yiming","family":"Li","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"},{"name":"State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China"},{"name":"State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,6,3]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2009.1832"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1007\/11555827_10"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27809-2_19"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_12"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2017.37"},{"key":"ref007","doi-asserted-by":"crossref","unstructured":"A.\u00a0Banerjee, C.\u00a0Peikert and A.\u00a0Rosen, Pseudorandom functions and lattices, in: Advances in Cryptology\u00a0\u2013 EUROCRYPT 2012\u00a0\u2013 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques.","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9028-8"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_34"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_13"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_30"},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_15"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54388-7_6"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-018-0322-0"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30144-8_8"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14081-5_13"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.12.020"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055717"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_21"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45374-9_16"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1007\/BF02254791"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_2"},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_38"},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.09.001"},{"key":"ref032","unstructured":"H.\u00a0Krawczyk and T.\u00a0Rabin, Chameleon signatures, in: Proceedings of the Network and Distributed System Security Symposium, NDSS 2000, The Internet Society, San Diego, California, USA, 2000, https:\/\/www.ndss-symposium.org\/ndss2000\/chameleon-signatures\/."},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746617"},{"key":"ref034","unstructured":"Y.\u00a0Li and S.\u00a0Liu, Tagged chameleon hash from lattice and application to redactable blockchain, IACR Cryptol. ePrint Arch (2023), 774, https:\/\/eprint.iacr.org\/2023\/774."},{"key":"ref035","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"ref036","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"ref037","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"ref038","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.72"},{"key":"ref039","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81293-5_19"},{"key":"ref040","unstructured":"C.\u00a0Peikert, Bonsai trees (or, arboriculture in lattice-based cryptography), IACR Cryptol. ePrint Arch (2009), 359, http:\/\/eprint.iacr.org\/2009\/359."},{"key":"ref041","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_5"},{"key":"ref042","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139165464"},{"key":"ref043","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.008"},{"key":"ref044","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500446"},{"key":"ref045","doi-asserted-by":"publisher","DOI":"10.1007\/11780656_9"},{"key":"ref046","unstructured":"F.\u00a0Zhang, R.\u00a0Safavi-Naini and W.\u00a0Susilo, Id-based chameleon hashes from bilinear pairings, IACR Cryptol. ePrint Arch. (2003), 208, http:\/\/eprint.iacr.org\/2003\/208."},{"key":"ref047","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_11"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-220121","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-220121","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-220121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:45:51Z","timestamp":1777495551000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-220121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,3]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11,20]]}},"alternative-id":["10.3233\/JCS-220121"],"URL":"https:\/\/doi.org\/10.3233\/jcs-220121","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,3]]}}}