{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:38:12Z","timestamp":1775817492383,"version":"3.50.1"},"reference-count":21,"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,2,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, we propose a PEKS scheme in which both the encrypted keyword and the trapdoor are randomized so that the cloud server is not able to recognize identical queries\n                    <jats:italic>a priori<\/jats:italic>\n                    . Our scheme is\n                    <jats:italic>Ciphertext-Indistinguishabiltity<\/jats:italic>\n                    secure in the single-user setting and\n                    <jats:italic>Trapdoor-Indistinguishability<\/jats:italic>\n                    secure in the multi-user setting with a stronger security, i.e., with\n                    <jats:italic>multi-trapdoor<\/jats:italic>\n                    .\n                  <\/jats:p>","DOI":"10.1515\/jmc-2023-0029","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T15:33:49Z","timestamp":1707924829000},"source":"Crossref","is-referenced-by-count":1,"title":["Searchable encryption with randomized ciphertext and randomized keyword search"],"prefix":"10.1515","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6817-3421","authenticated-orcid":false,"given":"Marco","family":"Calderini","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Trento, via Sommarive 14 , 38123 , Povo (Trento) , Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8739-3091","authenticated-orcid":false,"given":"Riccardo","family":"Longo","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Trento, via Sommarive 14 , 38123 , Povo (Trento) , Italy"},{"name":"Center for Cybersecurity, Fondazione Bruno Kessler, Via Sommarive 18 , 38123 , Povo (Trento) , Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7266-5146","authenticated-orcid":false,"given":"Massimiliano","family":"Sala","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Trento, via Sommarive 14 , 38123 , Povo (Trento) , Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6381-4712","authenticated-orcid":false,"given":"Irene","family":"Villa","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Trento, via Sommarive 14 , 38123 , Povo (Trento) , Italy"},{"name":"Department of Mathematics, Excellence Department 2023-2027, University of Genova , via Dodecaneso 35, 16146 , Genova , Italy"}]}],"member":"374","published-online":{"date-parts":[[2024,2,14]]},"reference":[{"key":"2025120600251185287_j_jmc-2023-0029_ref_001","doi-asserted-by":"crossref","unstructured":"Boneh D, Crescenzo GD, Ostrovsky R, and Persiano G. Public key encryption with keyword search. In: International conference on the theory and applications of cryptographic techniques. Berlin, Heidelberg: Springer; 2004. p. 506\u201322.","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_002","unstructured":"Song DX, Wagner DA, Perrig A. Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy. Berkeley, CA, USA: IEEE Computer Society; 2000. p. 44\u201355."},{"key":"2025120600251185287_j_jmc-2023-0029_ref_003","doi-asserted-by":"crossref","unstructured":"Demertzis I, Chamani JG, Papadopoulos D, Papamanthou C. Dynamic searchable encryption with small client storage. In: 27th Annual Network and Distributed System Security Symposium. NDSS 2020, San Diego, California, USA, 23-26 February 2020. The Internet Society; 2020.","DOI":"10.14722\/ndss.2020.24423"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_004","doi-asserted-by":"crossref","unstructured":"He D, Ma M, Zeadally S, Kumar N, Liang K. Certificateless public key authenticated encryption with keyword search for industrial internet of things. IEEE Trans Ind Inform. 2018;14(8):3618\u201327.","DOI":"10.1109\/TII.2017.2771382"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_005","doi-asserted-by":"crossref","unstructured":"Noroozi M, Karoubi I, Eslami Z. Designing a secure designated server identity-based encryption with keyword search scheme: still unsolved. Ann des Telecommun. 2018;73(11-12):769\u201376.","DOI":"10.1007\/s12243-018-0653-4"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_006","doi-asserted-by":"crossref","unstructured":"Qin B, Chen Y, Huang Q, Liu X, Zheng D. Public-key authenticated encryption with keyword search revisited: security model and constructions. Inf Sci. 2020;516: 515\u201328.","DOI":"10.1016\/j.ins.2019.12.063"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_007","doi-asserted-by":"crossref","unstructured":"Soleimanian A, Khazaei S. Publicly verifiable searchable symmetric encryption based on efficient cryptographic components. Des Codes Cryptography 2019;87(1):123\u201347.","DOI":"10.1007\/s10623-018-0489-y"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_008","doi-asserted-by":"crossref","unstructured":"Byun JW, Rhee HS, Park H, Lee DH. Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: SDM 2006, LNCS 4165, 2006; 2006. p. 75\u201383.","DOI":"10.1007\/11844662_6"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_009","doi-asserted-by":"crossref","unstructured":"Jeong IR, Kwon JO, Hong D, Lee DH. Constructing PEKS schemes secure against keyword guessing attacks is possible? Comput Commun. 2009;32(2):394\u20136.","DOI":"10.1016\/j.comcom.2008.11.018"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_010","doi-asserted-by":"crossref","unstructured":"Lu Y, Wang G, Li J. Keyword guessing attacks on a public key encryption with keyword search scheme without random oracle and its improvement. Inf Sci. 2019;479:270\u20136.","DOI":"10.1016\/j.ins.2018.12.004"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_011","doi-asserted-by":"crossref","unstructured":"Yau W-C, Heng S-H, Goi B-M. Off-Line keyword guessing attacks on recent public key encryption with keyword search schemes. In: Rong C, Jaatun MG, Sandnes FE, Yang LT, Ma J, (eds.) ATC 2008. LNCS. Vol. 5060. Heidelberg: Springer; 2008. p. 100\u20135.","DOI":"10.1007\/978-3-540-69295-9_10"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_012","doi-asserted-by":"crossref","unstructured":"Yau W, Phan RC, Heng S, Goi B Keyword guessing attacks on secure searchable public key encryption schemes with a designated tester. Int J Comput Math. 2013;90(12):2581\u20137.","DOI":"10.1080\/00207160.2013.778985"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_013","doi-asserted-by":"crossref","unstructured":"Huang Q, Li H. An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci. 2017;403:1\u201314.","DOI":"10.1016\/j.ins.2017.03.038"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_014","doi-asserted-by":"crossref","unstructured":"Noroozi M, Eslami Z. Public key authenticated encryption with keyword search: revisited. IET Inf Secur. 2019;13(4):336\u201342.","DOI":"10.1049\/iet-ifs.2018.5315"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_015","doi-asserted-by":"crossref","unstructured":"Qin B, Cui H, Zheng X, Zheng D. Improved security model for public-key authenticated encryption with keyword search. In: International Conference on Provable Security. Cham: Springer; 2021. p. 19\u201338.","DOI":"10.1007\/978-3-030-90402-9_2"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_016","doi-asserted-by":"crossref","unstructured":"Emura K. Generic construction of public-key authenticated encryption with keyword search revisited: stronger security and efficient construction. Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop; 2022.","DOI":"10.1145\/3494105.3526237"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_017","doi-asserted-by":"crossref","unstructured":"Boneh D, Franklin M. Identity-based encryption from the Weil pairing. In: Annual international cryptology conference. Berlin, Heidelberg: Springer; 2001. p. 213\u201329.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_018","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, and Waters B. Ciphertext-policy attribute-based encryption. In: 2007 IEEE Symposium on Security and Privacy (SP\u201907). IEEE; 2007. p. 321\u201334.","DOI":"10.1109\/SP.2007.11"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_019","doi-asserted-by":"crossref","unstructured":"Joux A. A one round protocol for tripartite Diffie\u2013Hellman. In: International algorithmic number theory symposium. Berlin, Heidelberg: Springer; 2000. p. 385\u201393.","DOI":"10.1007\/10722028_23"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_020","doi-asserted-by":"crossref","unstructured":"Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In: International Conference on the theory and Application of Cryptology and Information Security. Berlin, Heidelberg: Springer; 2001. p. 514\u201332.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"2025120600251185287_j_jmc-2023-0029_ref_021","doi-asserted-by":"crossref","unstructured":"Mascia C, Sala M, Villa I. A survey on functional encryption. Adv Math Commun. 2023;17(5):1251\u201389.","DOI":"10.3934\/amc.2021049"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0029\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0029\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:25:20Z","timestamp":1764980720000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2023-0029\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,2,14]]},"published-print":{"date-parts":[[2024,2,14]]}},"alternative-id":["10.1515\/jmc-2023-0029"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2023-0029","relation":{},"ISSN":["1862-2984"],"issn-type":[{"value":"1862-2984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,1]]},"article-number":"20230029"}}