乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T00:19:59Z","timestamp":1708129199613},"reference-count":36,"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":"Abstract<\/jats:title>\n We address the problem of user fast revocation in the lattice-based Ciphertext Policy Attribute-Based Encryption (CP-ABE) by extending the scheme originally introduced by Zhang and Zhang [Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings<\/jats:italic>. In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324\u201340. doi: https:\/\/doi.org\/10.1007\/978-3-642-34704-7_23<\/jats:ext-link>.]. While a lot of work exists on the construction of revocable schemes for CP-ABE based on pairings, works based on lattices are not so common, and \u2013 to the best of our knowledge \u2013 we introduce the first server-aided revocation scheme in a lattice-based CP-ABE scheme, hence being embedded in a post-quantum secure environment. In particular, we rely on semi-trusted \u201cmediators\u201d to provide a multi-step decryption capable of handling mediation without re-encryption. We comment on the scheme and its application, and we provide performance experiments on a prototype implementation in the Attribute-Based Encryption spin-off library of Palisade to evaluate the overhead compared with the original scheme.<\/jats:p>","DOI":"10.1515\/jmc-2023-0026","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T14:18:25Z","timestamp":1707920305000},"source":"Crossref","is-referenced-by-count":0,"title":["mR_{LWE<\/sub>-CP-ABE: A revocable CP-ABE for post-quantum cryptography"],"prefix":"10.1515","volume":"18","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-6775-7804","authenticated-orcid":false,"given":"Marco","family":"Cianfriglia","sequence":"first","affiliation":[{"name":"Department of Mathematics and Physics, Roma Tre University , 00146 Rome , Italy"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-8391-2563","authenticated-orcid":false,"given":"Elia","family":"Onofri","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Physics, Roma Tre University , 00146 Rome , Italy"},{"name":"Institute for Applied Mathematics, National Research Council , 00185 Rome , Italy"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9016-074X","authenticated-orcid":false,"given":"Marco","family":"Pedicini","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Physics, Roma Tre University , 00146 Rome , Italy"}]}],"member":"374","published-online":{"date-parts":[[2024,2,14]]},"reference":[{"key":"2024021605573600904_j_jmc-2023-0026_ref_001","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. In: STOC\u201905: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. New York: ACM; 2005. p. 84\u201393. https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_002","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhang Z. A ciphertext policy attribute-based encryption scheme without pairings. In: International Conference on Information Security and Cryptology. Springer; 2011. p. 324\u201340. https:\/\/doi.org\/10.1007\/978-3-642-34704-7_23.","DOI":"10.1007\/978-3-642-34704-7_23"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_003","unstructured":"Boneh D, Ding X, Tsudik G, Wong C. A method for fast revocation of public key certificates and security capabilities. In: Wallach DS, editor. 10th USENIX Security Symposium, August 13\u201317, 2001, Washington, D.C., USA. USENIX; 2001. http:\/\/www.usenix.org\/publications\/library\/proceedings\/sec01\/boneh.html."},{"key":"2024021605573600904_j_jmc-2023-0026_ref_004","unstructured":"PALISADE Lattice Cryptography Library (release 1.11.2); 2021. https:\/\/palisade-crypto.org\/."},{"key":"2024021605573600904_j_jmc-2023-0026_ref_005","doi-asserted-by":"crossref","unstructured":"Sahai A, Waters B. Fuzzy identity-based encryption. In: Cramer R, editor. Advances in Cryptology - EUROCRYPT 2005. Berlin, Heidelberg: Springer; 2005. p. 457\u201373. https:\/\/doi.org\/10.1007\/11426639_27.","DOI":"10.1007\/11426639_27"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_006","doi-asserted-by":"crossref","unstructured":"Al-Dahhan RR, Shi Q, Lee GM, Kifayat K. Survey on revocation in Ciphertext-policy attribute-based encryption. Sensors (Basel). 2019 Apr;19(7):1695. https:\/\/doi.org\/10.3390\/s19071695.","DOI":"10.3390\/s19071695"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_007","doi-asserted-by":"crossref","unstructured":"Mascia C, Sala M, Villa I. A survey on functional encryption. Adv Math Commun. 2023;17(5):1251\u201389. https:\/\/doi.org\/10.3934\/amc.2021049.","DOI":"10.3934\/amc.2021049"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_008","doi-asserted-by":"crossref","unstructured":"Moffat S, Hammoudeh M, Hegarty R. A survey on ciphertext-policy attribute-based encryption (CP-ABE) approaches to data security on mobile devices and its application to IoT. In: Proceedings of the International Conference on Future Networks and Distributed Systems. ICFNDS \u201917. New York, NY, USA: Association for Computing Machinery; 2017. https:\/\/doi.org\/10.1145\/3102304.3102338.","DOI":"10.1145\/3102304.3102338"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_009","doi-asserted-by":"crossref","unstructured":"Rasori M, Manna ML, Perazzo P, Dini G. A survey on attribute-based encryption schemes suitable for the Internet of things. IEEE Internet Things J. 2022 June;9(11):8269\u201390. https:\/\/doi.org\/10.1109\/JIOT.2022.3154039.","DOI":"10.1109\/JIOT.2022.3154039"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_010","doi-asserted-by":"crossref","unstructured":"Zhang Y, Deng RH, Xu S, Sun J, Li Q, Zheng D. Attribute-based encryption for cloud computing access control: a survey. ACM Comput Surv. 2020 Aug;53(4):1\u201341. https:\/\/doi.org\/10.1145\/3398036.","DOI":"10.1145\/3398036"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_011","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, Waters B. Ciphertext-policy attribute-based encryption. In: 2007 IEEE Symposium on Security and Privacy (SP \u201907); 2007. p. 321\u201334. https:\/\/doi.org\/10.1109\/SP.2007.11.","DOI":"10.1109\/SP.2007.11"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_012","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. CCS \u201906. New York, NY, USA: Association for Computing Machinery; 2006. p. 89\u201398. https:\/\/doi.org\/10.1145\/1180405.1180418.","DOI":"10.1145\/1180405.1180418"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_013","doi-asserted-by":"crossref","unstructured":"Xu S, Yang G, Mu Y. Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation. Inform Sci. 2019;479:116\u201334. https:\/\/doi.org\/10.1016\/j.ins.2018.11.031.","DOI":"10.1016\/j.ins.2018.11.031"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_014","doi-asserted-by":"crossref","unstructured":"Liu JK, Yuen TH, Zhang P, Liang K. Time-based direct revocable ciphertext-policy attribute-based encryption with short revocation list. In: Preneel B, Vercauteren F, editors. Applied Cryptography and Network Security. Cham: Springer International Publishing; 2018. p. 516\u201334. https:\/\/doi.org\/10.1007\/978-3-319-93387-0_27.","DOI":"10.1007\/978-3-319-93387-0_27"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_015","doi-asserted-by":"crossref","unstructured":"Phuong TVX, Yang G, Susilo W, Chen X. Attribute based broadcast encryption with short ciphertext and decryption key. In: Pernul G, Y A Ryan P, Weippl E, editors. Computer Security - ESORICS 2015. Cham: Springer International Publishing; 2015. p. 252\u201369. https:\/\/doi.org\/10.1007\/978-3-319-24177-7_13.","DOI":"10.1007\/978-3-319-24177-7_13"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_016","doi-asserted-by":"crossref","unstructured":"Sahai A, Seyalioglu H, Waters B. Dynamic credentials and ciphertext delegation for attribute-based encryption. In: Safavi-Naini R, Canetti R, editors. Advances in Cryptology - CRYPTO 2012. Berlin, Heidelberg: Springer; 2012. p. 199\u2013217. https:\/\/doi.org\/10.1007\/978-3-642-32009-5.","DOI":"10.1007\/978-3-642-32009-5_13"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_017","doi-asserted-by":"crossref","unstructured":"Yu S, Wang C, Ren K, Lou W. Attribute based data sharing with attribute revocation. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security. ASIACCS \u201910. New York, NY, USA: Association for Computing Machinery; 2010. p. 261\u201370. https:\/\/doi.org\/10.1145\/1755688.1755720.","DOI":"10.1145\/1755688.1755720"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_018","unstructured":"Xie X, Ma H, Li J, Chen X. An efficient ciphertext-policy attribute-based access control towards revocation in cloud computing. J Universal Comput Sci. 2013;19(16):2349\u201367. https:\/\/doi.org\/10.3217\/jucs-019-16-2349."},{"key":"2024021605573600904_j_jmc-2023-0026_ref_019","doi-asserted-by":"crossref","unstructured":"Yang Y, Ding X, Lu H, Wan Z, Zhou J. Achieving revocable fine-grained cryptographic access control over cloud data. In: Desmedt Y, editor. Information security. Cham: Springer International Publishing; 2015. p. 293\u2013308. https:\/\/doi.org\/10.1007\/978-3-319-27659-5_21.","DOI":"10.1007\/978-3-319-27659-5_21"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_020","doi-asserted-by":"crossref","unstructured":"Cui H, Deng RH, Ding X, Li Y. Attribute-based encryption with granular revocation. In: Deng R, Weng J, Ren K, Yegneswaran V, editors. Security and Privacy in Communication Networks. Cham: Springer International Publishing; 2017. p. 165\u201381. https:\/\/doi.org\/10.1007\/978-3-319-59608-2_9.","DOI":"10.1007\/978-3-319-59608-2_9"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_021","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer J, Seifert JP. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. STOC \u201999. New York, NY, USA: Association for Computing Machinery; 1999. p. 711\u201320. https:\/\/doi.org\/10.1145\/301250.301441.","DOI":"10.1145\/301250.301441"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_022","doi-asserted-by":"crossref","unstructured":"Aggarwal D, Chung E. A note on the concrete hardness of the shortest independent vector in lattices. Inform Process Lett. 2021;167:106065. https:\/\/doi.org\/10.1016\/j.ipl.2020.106065.","DOI":"10.1016\/j.ipl.2020.106065"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_023","doi-asserted-by":"crossref","unstructured":"Bennett H, Golovnev A, Stephens-Davidowitz N. On the quantitative hardness of CVP. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS); 2017. p. 13\u201324. https:\/\/doi.org\/10.1109\/FOCS.2017.11.","DOI":"10.1109\/FOCS.2017.11"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_024","doi-asserted-by":"crossref","unstructured":"Impagliazzo R, Paturi R. On the Complexity of k-SAT. J Comput Syst Sci. 2001;62(2):367\u201375. https:\/\/doi.org\/10.1006\/jcss.2000.1727.","DOI":"10.1006\/jcss.2000.1727"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_025","doi-asserted-by":"crossref","unstructured":"Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures. SIAM J Comput. 2007;37(1):267\u2013302. https:\/\/doi.org\/10.1137\/S0097539705447360.","DOI":"10.1137\/S0097539705447360"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_026","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. https:\/\/doi.org\/10.1145\/1568318.1568324.","DOI":"10.1145\/1568318.1568324"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_027","doi-asserted-by":"crossref","unstructured":"Peikert C. Some recent progress in lattice-based cryptography. In: Theory of Cryptography. Berlin Heidelberg: Springer; 2009. p. 72\u20132. https:\/\/doi.org\/10.1007\/978-3-642-00457-5_5.","DOI":"10.1007\/978-3-642-00457-5_5"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_028","doi-asserted-by":"crossref","unstructured":"Agrawal S, Boneh D, Boyen X. Efficient Lattice (H) IBE in the standard model. Eurocrypt\u201910 and PKC\u201910 joint work.2010. http:\/\/boneh.com\/pubs\/papers\/latticebb.pdf.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_029","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. https:\/\/doi.org\/10.1145\/1374376.1374407.","DOI":"10.1145\/1374376.1374407"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_030","unstructured":"Alwen J, Peikert C. Generating shorter bases for hard random lattices. In: Albers S, Marion JY, editors. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. Freiburg, Germany: IBFI Schloss Dagstuhl; 2009. p. 75\u201386. https:\/\/hal.inria.fr\/inria-00359718."},{"key":"2024021605573600904_j_jmc-2023-0026_ref_031","unstructured":"Cash D, Hofheinz D, Kiltz E. How to delegate a Lattice basis; 2009. Cryptology ePrint Archive, Paper 2009\/351. https:\/\/eprint.iacr.org\/2009\/351."},{"key":"2024021605573600904_j_jmc-2023-0026_ref_032","doi-asserted-by":"crossref","unstructured":"Lombardi A, Mook E, Quach W, Wichs D. Post-quantum insecurity from LWE. In: Theory of Cryptography. Springer Nature Switzerland; 2022. p. 3\u201332. https:\/\/doi.org\/10.1007\/978-3-031-22318-1_1.","DOI":"10.1007\/978-3-031-22318-1_1"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_033","doi-asserted-by":"crossref","unstructured":"Shamir A. How to share a secret. Commun ACM. 1979 Nov;22(11):612\u20133. https:\/\/doi.org\/10.1145\/359168.359176.","DOI":"10.1145\/359168.359176"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_034","doi-asserted-by":"crossref","unstructured":"Zhang J, Zhang Z, Ge A. Ciphertext policy attribute-based encryption from lattices. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security; 2012. p. 16\u20137. https:\/\/doi.org\/10.1145\/2414456.2414464.","DOI":"10.1145\/2414456.2414464"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_035","doi-asserted-by":"crossref","unstructured":"Chen Z, Zhang P, Zhang F, Huang J. Ciphertext policy attribute-based encryption supporting unbounded attribute space from R-LWE. KSII Trans Internet Inform Syst (TIIS). 2017;11(4):2292\u2013309.","DOI":"10.3837\/tiis.2017.04.025"},{"key":"2024021605573600904_j_jmc-2023-0026_ref_036","unstructured":"Microsoft SEAL (release 4.0); 2022. Microsoft Research, Redmond, WA. https:\/\/github.com\/Microsoft\/SEAL."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jmc-2023-0026\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jmc-2023-0026\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T05:57:51Z","timestamp":1708063071000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/jmc-2023-0026\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,2,14]]},"published-print":{"date-parts":[[2024,2,14]]}},"alternative-id":["10.1515\/jmc-2023-0026"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2023-0026","relation":{},"ISSN":["1862-2984"],"issn-type":[{"value":"1862-2984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,1]]}}}}