{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:36:13Z","timestamp":1769754973825,"version":"3.49.0"},"reference-count":45,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,28]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A chameleon hash function is a type of hash function that involves a trapdoor to help find collisions, i.e., it allows the rewriting of a message without modifying the hash. For some applications, it is important to have the feature of revoking the rewriting privilege of the trapdoor holder. In this paper, using lattice-based hard problems that are considered quantum-safe, we first introduce a lattice-based chameleon hash with an ephemeral trapdoor\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0012_eq_001.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mrow>\n                            <m:mo>(<\/m:mo>\n                            <m:mrow>\n                              <m:mi mathvariant=\"sans-serif\">CHET<\/m:mi>\n                            <\/m:mrow>\n                            <m:mo>)<\/m:mo>\n                          <\/m:mrow>\n                        <\/m:math>\n                        <jats:tex-math>\\left({\\mathsf{CHET}})<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and then a revocable attribute-based encryption (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0012_eq_002.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"sans-serif\">RABE<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>{\\mathsf{RABE}}<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ) scheme that is adaptively indistinguishable. We also give security analyses of our schemes and compare our\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0012_eq_003.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"sans-serif\">RABE<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>{\\mathsf{RABE}}<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    scheme to two relevant schemes proposed recently. Furthermore, we combine our\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0012_eq_004.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"sans-serif\">CHET<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>{\\mathsf{CHET}}<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"graphic\/j_jmc-2023-0012_eq_005.png\"\/>\n                        <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <m:mi mathvariant=\"sans-serif\">RABE<\/m:mi>\n                        <\/m:math>\n                        <jats:tex-math>{\\mathsf{RABE}}<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    to design a new revocable policy-based chameleon hash.\n                  <\/jats:p>","DOI":"10.1515\/jmc-2023-0012","type":"journal-article","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T16:00:07Z","timestamp":1732809607000},"source":"Crossref","is-referenced-by-count":1,"title":["Revocable policy-based chameleon hash using lattices"],"prefix":"10.1515","volume":"18","author":[{"given":"Jean Belo","family":"Klamti","sequence":"first","affiliation":[{"name":"National Research Council Canada , Ottawa , Ontario , Canada"}]},{"given":"Mohammed Anwarul","family":"Hasan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Waterloo , Waterloo , ON , Canada"}]}],"member":"374","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"2025120600265538761_j_jmc-2023-0012_ref_001","unstructured":"Krawczyk H, Rabin T. Chameleon hashing and signatures; 1998. https:\/\/ia.cr\/1998\/010. Cryptology ePrint Archive, Report 1998\/010."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_002","doi-asserted-by":"crossref","unstructured":"Camenisch J, Derler D, Krenn S, P\u00f6hls HC, Samelin K, Slamanig D. Chameleon-Hashes with ephemeral trapdoors - and applications to invisible sanitizable signatures. In: Fehr S, editor. Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28\u201331, 2017, Proceedings, Part II. vol. 10175 of Lecture Notes in Computer Science. Springer; 2017. p. 152\u201382.","DOI":"10.1007\/978-3-662-54388-7_6"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_003","doi-asserted-by":"crossref","unstructured":"Ateniese G, Chou DH, Medeiros Bd, Tsudik G. Sanitizable signatures. In: European Symposium on Research in Computer Security.  Springer, Berlin, Heidelberg; 2005. p. 159\u201377.","DOI":"10.1007\/11555827_10"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_004","doi-asserted-by":"crossref","unstructured":"Even S, Goldreich O, Micali S. On-line\/offline digital signatures. J Cryptol. 1996;9(1):35\u201367.","DOI":"10.1007\/BF02254791"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_005","unstructured":"Krawczyk H, Rabin T. Chameleon signatures. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2000, San Diego, California, USA. The Internet Society; 2000. p. 143\u201354."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_006","doi-asserted-by":"crossref","unstructured":"Shamir A, Tauman Y. Improved online\/offline signature schemes. In: Annual International Cryptology Conference. Springer; 2001. p. 355\u201367.","DOI":"10.1007\/3-540-44647-8_21"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_007","doi-asserted-by":"crossref","unstructured":"Chen X, Zhang F, Susilo W, Mu Y. Efficient generic on-line\/offline signatures without key exposure. In: International Conference on Applied Cryptography and Network Security. Springer; 2007. p. 18\u201330.","DOI":"10.1007\/978-3-540-72738-5_2"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_008","doi-asserted-by":"crossref","unstructured":"Ateniese G, Magri B, Venturi D, Andrade E. Redactable blockchain or rewriting history in Bitcoin and friends. In: 2017 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE; 2017. p. 111\u201326.","DOI":"10.1109\/EuroSP.2017.37"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_009","doi-asserted-by":"crossref","unstructured":"Derler D, Samelin K, Slamanig D, Striecks C. Fine-grained and controlled rewriting in blockchains: Chameleon-Hashing gone attribute-based. In: 26th Annual Network and Distributed System Security Symposium, NDSS 2019, San Diego, California, USA, February 24\u201327, 2019. The Internet Society; 2019.","DOI":"10.14722\/ndss.2019.23066"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_010","doi-asserted-by":"crossref","unstructured":"Xu S, Ning J, Ma J, Xu G, Yuan J, Deng RH. Revocable policy-based Chameleon Hash. In: European Symposium on Research in Computer Security. Springer International Publishing; 2021. p. 327\u201347.","DOI":"10.1007\/978-3-030-88418-5_16"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_011","doi-asserted-by":"crossref","unstructured":"Cash D, Hofheinz D, Kiltz E, Peikert C. Bonsai trees, or how to delegate a lattice basis. J Cryptol. 2012;25(4):601\u201339.","DOI":"10.1007\/s00145-011-9105-2"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_012","doi-asserted-by":"crossref","unstructured":"Ateniese G, de Medeiros B. Identity-based chameleon hash and applications. In: Financial Cryptography: 8th International Conference, FC 2004, Key West, FL, USA, February 9\u201312, 2004. Revised Papers 8. Springer; 2004.p. 164\u201380.","DOI":"10.1007\/978-3-540-27809-2_19"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_013","doi-asserted-by":"crossref","unstructured":"Bao F, Deng RH, Ding X, Lai J, Zhao Y. Hierarchical identity-based chameleon hash and its applications. In: Applied Cryptography and Network Security: 9th International Conference, ACNS 2011, Nerja, Spain, June 7\u201310, 2011. Proceedings 9. Springer; 2011. p. 201\u201319.","DOI":"10.1007\/978-3-642-21554-4_12"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_014","doi-asserted-by":"crossref","unstructured":"Chen X, Tian H, Zhang F, Ding Y. Comments and improvements on key-exposure free chameleon hashing based on factoring. In: International Conference on Information security and Cryptology. Springer; 2010. p. 415\u201326.","DOI":"10.1007\/978-3-642-21518-6_29"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_015","unstructured":"Zhang F, Safavi-Naini R, Susilo W. ID-based chameleon hashes from bilinear pairings. Cryptology ePrint Archive. 2003."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_016","doi-asserted-by":"crossref","unstructured":"Brzuska C, Fischlin M, Freudenreich T, Lehmann A, Page M, Schelbert J, et al. Security of sanitizable signatures revisited. In: Public Key Cryptography-PKC 2009: 12th International Conference on Practice and Theory in Public Key Cryptography, Irvine, CA, USA, March 18\u201320, 2009. Proceedings 12. Springer; 2009. p. 317\u201336.","DOI":"10.1007\/978-3-642-00468-1_18"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_017","doi-asserted-by":"crossref","unstructured":"Tsabary R. Fully secure attribute-based encryption for t-CNF from LWE. In: Annual International Cryptology Conference. Springer; 2019. p. 62\u201385.","DOI":"10.1007\/978-3-030-26948-7_3"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_018","doi-asserted-by":"crossref","unstructured":"Xiong H, Huang X, Yang M, Wang L, Yu S. Unbounded and efficient revocable attribute-based encryption with adaptive security for cloud-assisted internet of things. IEEE Internet Things J. 2022;9(4):428\u201341.","DOI":"10.1109\/JIOT.2021.3094323"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_019","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C. Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval D, Johansson T, editors. Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. Vol. 7237 of Lecture Notes in Computer Science. Springer; 2012. p. 700\u201318.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_020","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on Theory of computing; 2008. p. 197\u2013206.","DOI":"10.1145\/1374376.1374407"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_021","doi-asserted-by":"crossref","unstructured":"Ajtai M. Generating hard instances of lattice problems. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing; 1996. p. 99\u2013108.","DOI":"10.1145\/237814.237838"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_022","doi-asserted-by":"crossref","unstructured":"Alwen J, Peikert C. Generating shorter bases for hard random lattices. Theory Comput Syst. 2011;48(3):535\u201353.","DOI":"10.1007\/s00224-010-9278-3"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_023","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: Annual Cryptology Conference. Springer; 2010. p. 98\u2013115.","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_024","unstructured":"Laarhoven T, van De Pol J, De Weger B. Solving hard lattice problems and the security of lattice-based cryptosystems. Cryptology ePrint Archive. 2012."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_025","doi-asserted-by":"crossref","unstructured":"Albrecht MR, Deo A. Large modulus Ring-LWE \u2265 module-LWE. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer; 2017. p. 267\u201396.","DOI":"10.1007\/978-3-319-70694-8_10"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_026","doi-asserted-by":"crossref","unstructured":"Koo Z, Lee Y, Lee JW, No JS, Kim YS. Improved reduction between SIS problems over structured lattices. IEEE Access. 2021;9:157083\u201392.","DOI":"10.1109\/ACCESS.2021.3128139"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_027","doi-asserted-by":"crossref","unstructured":"Micciancio D, Peikert C. Hardness of SIS and LWE with small parameters. In: Annual Cryptology Conference. Springer; 2013. p. 21\u201339.","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_028","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM). 2009;56(6):1\u201340.","DOI":"10.1145\/1568318.1568324"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_029","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V. Lattice signatures without trapdoors. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer; 2012. p. 738\u201355.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_030","doi-asserted-by":"crossref","unstructured":"Goldreich O, Goldwasser S, Micali S. How to construct random functions. J ACM. 1986;33(4):792\u2013807.","DOI":"10.1145\/6490.6503"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_031","doi-asserted-by":"crossref","unstructured":"Boneh D, Waters B. Constrained pseudorandom functions and their applications. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer; 2013. p. 280\u2013300.","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_032","unstructured":"Peter N, Tsabary R, Wee H. One-one constrained pseudorandom functions. In: 1st Conference on Information-theoretic Cryptography (ITC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik; 2020."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_033","unstructured":"Sahai A, Waters B. Fuzzy identity-based encryption. In: Cramer R, editor. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22\u201326, 2005, Proceedings. vol. 3494 of Lecture Notes in Computer Science. Springer; 2005. p. 457\u201373."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_034","doi-asserted-by":"crossref","unstructured":"Goyal V, Pandey O, Sahai A, Waters B. Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security; 2006. p. 89\u201398.","DOI":"10.1145\/1180405.1180418"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_035","doi-asserted-by":"crossref","unstructured":"Derler D, Samelin K, Slamanig D. Bringing order to Chaos: the case of collision-resistant Chameleon-Hashes. In: Kiayias A, Kohlweiss M, Wallden P, Zikas V, editors. Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4\u20137, 2020, Proceedings, Part I. vol. 12110 of Lecture Notes in Computer Science. Springer; 2020. p. 462\u201392.","DOI":"10.1007\/978-3-030-45374-9_16"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_036","doi-asserted-by":"crossref","unstructured":"Derler D, Krenn S, Samelin K, Slamanig D. Fully collision-resistant Chameleon-Hashes from simpler and post-quantum assumptions. In: International Conference on Security and Cryptography for Networks. Springer; 2020. p. 427\u201347.","DOI":"10.1007\/978-3-030-57990-6_21"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_037","doi-asserted-by":"crossref","unstructured":"Naor D, Naor M, Lotspiech J. Revocation and tracing schemes for stateless receivers. In: Annual International Cryptology Conference. Springer; 2001. p. 41\u201362.","DOI":"10.1007\/3-540-44647-8_3"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_038","doi-asserted-by":"crossref","unstructured":"Dong X, Hu Y, Wang B, Liu M, Gao W. Lattice-based revocable attribute-based encryption with decryption key exposure resistance. IET inform security. 2021;15(6):428\u201341.","DOI":"10.1049\/ise2.12033"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_039","doi-asserted-by":"crossref","unstructured":"Dong X, Zhang Y, Wang B, Chen J. Server-aided revocable attribute-based encryption from lattices. Security Commun Netw. 2020;2020:1460531.","DOI":"10.1155\/2020\/1460531"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_040","doi-asserted-by":"crossref","unstructured":"Luo F, Al-Kuwari S, Wang H, Wang F, Chen K. Revocable attribute-based encryption from standard lattices. Comput Standards Interfaces. 2023;84:103698.","DOI":"10.1016\/j.csi.2022.103698"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_041","doi-asserted-by":"crossref","unstructured":"Huang B, Gao J, Li X. Efficient lattice-based revocable attribute-based encryption against decryption key exposure for cloud file sharing. J Cloud Comput. 2023;12(1):1\u201315.","DOI":"10.1186\/s13677-023-00414-w"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_042","unstructured":"Yang K, Wu G, Dong C, Fu X, Li F, Wu T. Attribute based encryption with efficient revocation from lattices. Int J Netw Secur. 2020;22(1):161\u201370."},{"key":"2025120600265538761_j_jmc-2023-0012_ref_043","doi-asserted-by":"crossref","unstructured":"Katsumata S, Matsuda T, Takayasu A. Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance. Theoretic Comput Sci. 2020;809:103\u201336.","DOI":"10.1016\/j.tcs.2019.12.003"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_044","doi-asserted-by":"crossref","unstructured":"Chen J, Lim HW, Ling S, Wang H, Nguyen K. Revocable identity-based encryption from lattices. In: Information Security and Privacy: 17th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9\u201311, 2012. Proceedings 17. Springer; 2012. p. 390\u2013403.","DOI":"10.1007\/978-3-642-31448-3_29"},{"key":"2025120600265538761_j_jmc-2023-0012_ref_045","doi-asserted-by":"crossref","unstructured":"Micciancio D. On the hardness of learning with errors with binary secrets. Theory Comput. 2018;14(1):1\u201317.","DOI":"10.4086\/toc.2018.v014a013"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0012\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0012\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:27:10Z","timestamp":1764980830000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0012\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":45,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,3,6]]},"published-print":{"date-parts":[[2024,3,6]]}},"alternative-id":["10.1515\/jmc-2023-0012"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2023-0012","relation":{},"ISSN":["1862-2984"],"issn-type":[{"value":"1862-2984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,1]]},"article-number":"20230012"}}