{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:34:19Z","timestamp":1769754859941,"version":"3.49.0"},"reference-count":75,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T00:00:00Z","timestamp":1605484800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Cryptography Development Fund","award":["MMJJ20180210"],"award-info":[{"award-number":["MMJJ20180210"]}]},{"name":"National Cryptography Development Fund","award":["61832012"],"award-info":[{"award-number":["61832012"]}]},{"name":"National Cryptography Development Fund","award":["61672019"],"award-info":[{"award-number":["61672019"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["MMJJ20180210"],"award-info":[{"award-number":["MMJJ20180210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832012"],"award-info":[{"award-number":["61832012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672019"],"award-info":[{"award-number":["61672019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,11,16]]},"abstract":"<jats:p>The emergence of quantum computing threatens many classical cryptographic schemes, leading to the innovations in public-key cryptography for postquantum cryptography primitives and protocols that resist to quantum attacks. Lattice-based cryptography is considered to be one of the promising mathematical approaches to achieving security resistant to quantum attacks, which could be built on the learning with errors (LWE) problem and its variants. The fundamental building blocks of protocols for public-key encryption (PKE) and key encapsulation mechanism (KEM) submitted to the National Institute of Standards and Technology (NIST) based on LWE and its variants are called key consensus (KC) and asymmetric key consensus (AKC) by Jin et al. They are powerful tools for constructing PKE schemes. In this work, we further demonstrate the power of KC\/AKC by proposing two special types of PKE schemes, namely, revocable attribute-based encryption (RABE). To be specific, on the basis of AKC and PKE\/KEM protocols submitted to the NIST based on LWE and its variants, combined with full-rank difference, trapdoor on lattices, sampling algorithms, leftover hash lemma, and binary tree structure, we propose two directly revocable ciphertext-policy attribute-based encryption (DR-ABE) schemes from LWE, which support flexible threshold access policies on multivalued attributes, achieving user-level and attribute-level user revocation, respectively. Specifically, the construction of the ciphertext is derived from AKC, and the revocation list is defined and embedded into the ciphertext by the message sender to revoke a user in the user-level revocable scheme or revoke some attributes of a certain user in the attribute-level revocable scheme. We also discuss how to outsource decryption and reduce the workload for the end user. Our schemes proved to be secure in the standard model, assuming the hardness of the LWE problem. The two schemes imply the versatility of KC\/AKC.<\/jats:p>","DOI":"10.1155\/2020\/8834872","type":"journal-article","created":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:22:19Z","timestamp":1605644539000},"page":"1-16","source":"Crossref","is-referenced-by-count":5,"title":["AKC-Based Revocable ABE Schemes from LWE Assumption"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7231-0636","authenticated-orcid":true,"given":"Leixiao","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Fudan University, Shanghai 200433, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9445-1547","authenticated-orcid":true,"given":"Fei","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Mathematics, Shandong University, Jinan, Shandong 250100, China"},{"name":"Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Jinan, Shandong 250100, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2294-7735","authenticated-orcid":true,"given":"Xianmeng","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Mathematics, Shandong University of Finance and Economics, Jinan, Shandong 250014, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3141-392X","authenticated-orcid":true,"given":"Qixin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Tandon School of Engineering, New York University, New York City, USA"}]}],"member":"311","reference":[{"issue":"5","key":"1","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"P. W. Shor","year":"1997","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.26421\/QIC3.4-3","article-title":"Shor\u2019s discrete logarithm quantum algorithm for elliptic curves","volume":"3","author":"J. Proos","year":"2003","journal-title":"Quantum Information and Computation"},{"key":"3","first-page":"124","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","author":"W. S. Peter"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Introduction to Post-Quantum Cryptography","author":"D. Bernstein","year":"2009"},{"key":"5","first-page":"84","article-title":"On lattices, learning with errors, random linear codes, and cryptography","author":"O. Regev"},{"key":"6","first-page":"327","article-title":"Post-quantum key exchange\u2014a new hope","author":"E. Alkim"},{"key":"7","first-page":"1006","article-title":"Frodo: take off the ring! practical, quantum-secure key exchange from LWE","author":"J. Bos"},{"key":"8","article-title":"A simple provably secure key exchange scheme based on the learning with errors problem","volume":"688","author":"J. Ding","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9","article-title":"Optimal key consensus in presence of noise, CoRR, Abs\/1611.06150","author":"Z. Jin","year":"2016"},{"key":"10","first-page":"2017","article-title":"Optimal key consensus in presence of noise","volume":"1058","author":"Z. Jin","year":"2017","journal-title":"IACR Cryptology ePrint Archive"},{"key":"11","first-page":"302","article-title":"Generic and practical key establishment from lattice","author":"Z. Jin"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"14","first-page":"197","article-title":"Lattice cryptography for the internet","author":"C. Peikert"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"16","unstructured":"ZhaoY.jinZ.GongB.SuiG.Supporting documentation: KCL2017Gaithersburg, MD, USANational Institute of Standards and Technology"},{"key":"17","doi-asserted-by":"crossref","article-title":"Compact lossy and all-but-one trapdoor functions from lattice","author":"L. Cheng","DOI":"10.1007\/978-3-319-72359-4_16"},{"key":"18","volume-title":"Submission Requirements and Evaluation Criteria for Post-quantum Cryptography Standardization Process","author":"NIST CSRC","year":"2016"},{"key":"19"},{"key":"20","first-page":"457","article-title":"Fuzzy identity-based encryption","author":"S. Amit"},{"key":"21","first-page":"570","article-title":"Server-aided revocable attribute-based encryption","author":"H. Cui"},{"key":"22","first-page":"516","article-title":"Time-based direct revocable ciphertext-policy attribute-based encryption with short revocation list","author":"J. K. Liu"},{"key":"23","first-page":"504","article-title":"Server-aided revocable attribute-based encryption resilient to decryption key exposure","author":"B. Qin"},{"key":"24","first-page":"199","article-title":"Dynamic credentials and ciphertext delegation for attribute-based encryption","author":"S. Amit"},{"key":"25","first-page":"293","article-title":"Achieving revocable fine-grained cryptographic access control over cloud data","author":"Y. Yang"},{"key":"26","first-page":"261","article-title":"Attribute based data sharing with attribute revocation","author":"S. Yu"},{"key":"27","first-page":"411","article-title":"Easier: encryption-based access control in social networks with efficient revocation","author":"S. Jahid"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-016-0701-7"},{"key":"29","first-page":"844","article-title":"Dynamic user revocation and key refreshing for attribute-based encryption in cloud storage","author":"Z. Xu"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.34028\/iajit\/17\/1\/13"},{"key":"31","first-page":"390","article-title":"Revocable identity-based encryption from lattices","author":"J. Chen"},{"key":"32","first-page":"99","article-title":"Secure attribute-based systems","author":"M. Pirretti"},{"key":"33","first-page":"248","article-title":"Conjunctive broadcast and attribute-based encryption","author":"N. Attrapadung"},{"key":"34","first-page":"305","article-title":"Revocable predicate encryption from lattices","author":"S. Ling"},{"key":"35","first-page":"195","article-title":"Attribute-based encryption with non-monotonic access structures","author":"R. Ostrovsky"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"37","first-page":"177","article-title":"On the amortized complexity of zero-knowledge protocols","author":"R. Cramer"},{"key":"38","first-page":"1","article-title":"Generating hard instances of the short basis problem","author":"M. Ajtai"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9278-3"},{"key":"40","first-page":"700","article-title":"Trapdoors for lattices: simpler, tighter, faster, smaller","author":"D. Micciancio"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9105-2"},{"key":"42","first-page":"2012","article-title":"Identity-based encryption with efficient revocation","volume":"52","author":"A. Boldyreva","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"43","first-page":"441","article-title":"Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance","author":"S. Katsumata"},{"key":"44","first-page":"350","article-title":"Fully private revocable predicate encryption","author":"J. M. Gonz\u00e1lez Nieto"},{"key":"45","first-page":"216","article-title":"Revocable identity-based encryption revisited: security model and construction","author":"J. H. Seo"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2017.0225"},{"issue":"1","key":"47","first-page":"161","article-title":"Attribute based encryption with efficient revocation from lattices","volume":"22","author":"Y. Kang","year":"2020","journal-title":"International Journal of Network Security"},{"key":"48","first-page":"16","article-title":"Ciphertext policy attribute-based encryption from lattices","author":"J. Zhang"},{"key":"49","unstructured":"El BansarkhaniR.Supporting documentation: kindi2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"50","unstructured":"JungH. C.ParkS.LeeJ.Supporting documentation: lizard2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"51","unstructured":"D\u2019AnversJ.-P.KarmakarA.RoyS. S.VercauterenF.Supporting documentation: saber2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"52","unstructured":"DingJ.TakagiT.GaoX.WangY.Supporting documentation: ding key exchange2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"53","article-title":"Supporting documentation: round2","author":"O. Garcia-Morchon","year":"2017"},{"key":"54","unstructured":"LuX.LiuY.JiaD.XueH.HeJ.ZhangZ.Supporting documentation: lac2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"55","unstructured":"NaehrigM.AlkimE.BosJ.Supporting documentation: frodokem2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"56","unstructured":"PhongLe T.HayashiT.AonoY.MoriaiS.Supporting documentation: lotus2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"57","unstructured":"PeterS.AvanziR.BosJ.Supporting documentation: kyber2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"58","unstructured":"SeoM.Hwan ParkJ.DongH. L.KimS.LeeS.-J.Supporting documentation: emblem and r.emblem2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"59","unstructured":"SmartN. P.AlbrechtM. R.LindellY.Supporting documentation: lima2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"60","unstructured":"SteinfeldR.AminS.RaymondK.Supporting documentation: titanium2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"61","first-page":"719","article-title":"Pseudorandom functions and lattices","author":"A. Banerjee"},{"key":"62","first-page":"21","article-title":"On ideal lattices and learning with errors over rings","volume-title":"Lecture Notes in Computer Science","author":"V. Lyubashevsky","year":"2010"},{"key":"63","article-title":"Worst-case to average-case reductions for module lattices. cryptology ePrint archive","author":"A. Langlois","year":"2012"},{"key":"64","unstructured":"HamburgM.Supporting documentation: threebears2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"65","unstructured":"SaarinenM.-J.Supporting documentation: hila52017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"66","unstructured":"P\u00f6ppelmannT.AlkimE.AvanziR.Supporting documentation: newhope2017Gaithersburg, MD, USANational Institute of Standards and TechnologyTechnical report"},{"key":"67","first-page":"89","article-title":"Attribute-based encryption for fine-grained access control of encrypted data","author":"V. Goyal"},{"key":"68","first-page":"90","article-title":"Expressive key-policy attribute-based encryption with constant-size ciphertexts","author":"N. Attrapadung"},{"key":"69","first-page":"162","article-title":"Attribute-based encryption with fast decryption","author":"S. Hohenberger"},{"key":"70","first-page":"321","article-title":"Ciphertext-policy attribute-based encryption","author":"J. Bethencourt"},{"key":"71","first-page":"53","article-title":"Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization","author":"B. Waters"},{"key":"72","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-9472-7"},{"key":"73","first-page":"197","article-title":"Trapdoors for hard lattices and new cryptographic constructions","author":"G. Craig"},{"key":"74","first-page":"333","article-title":"Public-key cryptosystems from the worst-case shortest vector problem: extended abstract","author":"C. Peikert"},{"key":"75","first-page":"2011","article-title":"Fuzzy identity based encryption from lattices","volume":"414","author":"S. Agrawal","year":"2011","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8834872.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8834872.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8834872.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T16:47:48Z","timestamp":1618418868000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8834872\/"}},"subtitle":[],"editor":[{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,11,16]]},"references-count":75,"alternative-id":["8834872","8834872"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8834872","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"value":"1939-0122","type":"electronic"},{"value":"1939-0114","type":"print"}],"subject":[],"published":{"date-parts":[[2020,11,16]]}}}