{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:52:58Z","timestamp":1760237578970,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T00:00:00Z","timestamp":1590624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972050"],"award-info":[{"award-number":["61972050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Provincial Key Research and Development Program of China","award":["2018CXGC0701"],"award-info":[{"award-number":["2018CXGC0701"]}]},{"name":"BUPT Excellent Ph.D. Students Foundation","award":["CX2019119, CX2019233"],"award-info":[{"award-number":["CX2019119, CX2019233"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Dual receiver encryption (DRE), being originally conceived at CCS 2004 as a proof technique, enables a ciphertext to be decrypted to the same plaintext by two different but dual receivers and becomes popular recently due to itself useful application potentials such secure outsourcing, trusted third party supervising, client puzzling, etc. Identity-based DRE (IB-DRE) further combines the bilateral advantages\/facilities of DRE and identity-based encryption (IBE). Most previous constructions of IB-DRE are based on bilinear pairings, and thus suffers from known quantum algorithmic attacks. It is interesting to build IB-DRE schemes based on the well-known post quantum platforms, such as lattices. At ACISP 2018, Zhang et al. gave the first lattice-based construction of IB-DRE, and the main part of the public parameter in this scheme consists of 2 n + 2 matrices where n is the bit-length of arbitrary identity. In this paper, by introducing an injective map and a homomorphic computation technique due to Yamada at EUROCRYPT 2016, we propose another lattice-based construction of IB-DRE in an even efficient manner: The main part of the public parameters consists only of 2 p n 1 p + 2 matrices of the same dimensions, where p ( \u2265 2 ) is a flexible constant. The larger the p and n, the more observable of our proposal. Typically, when p = 2 and n = 284 according to the suggestion given by Peikert et al., the size of public parameters in our proposal is reduced to merely 12% of Zhang et al.\u2019s method. In addition, to lighten the pressure of key generation center, we extend our lattice-based IB-DRE scheme to hierarchical scenario. Finally, both the IB-DRE scheme and the HIB-DRE scheme are proved to be indistinguishable against adaptively chosen identity and plaintext attacks (IND-ID-CPA).<\/jats:p>","DOI":"10.3390\/e22060599","type":"journal-article","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T08:27:48Z","timestamp":1590654468000},"page":"599","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Constructions of Identity-Based Dual Receiver Encryption from Lattices"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3619-0099","authenticated-orcid":false,"given":"Yuan","family":"Liu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoying","family":"Shen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lixiang","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,5,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Diament, T., Lee, H.K., Keromytis, A.D., and Yung, M. (2004, January 25\u201329). The Dual Receiver Cryptosystem and its Applications. Proceedings of the 11th ACM Conference on Computer and Communications Security 2004 (CCS\u201904), Washington, DC, USA.","DOI":"10.1145\/1030083.1030128"},{"key":"ref_2","unstructured":"Chow, S.S.M., Franklin, M., and Zhang, H. (2014, January 25\u201328). Practical Dual-Receiver Encryption. Proceedings of the Cryptographers\u2019 Track at the RSA Conference (CT-RSA\u201914), San Francisco, CA, USA."},{"key":"ref_3","unstructured":"Dodis, Y., Katz, J., Smith, A., and Walfish, S. (2009, January 15\u201317). Composability and on-Line Deniability of Authentication. Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography 2009 (TCC\u201909), San Francisco, CA, USA."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"5789","DOI":"10.1002\/sec.1736","article-title":"New application of partitioning methodology: Identity-based dual receiver encryption","volume":"9","author":"Zhang","year":"2016","journal-title":"Secur. Commun. Netw."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Waters, B. (2005, January 22\u201326). Efficient Identity-Based Encryption without Random Oracles. Proceedings of the Advances in Cryptology-Eurocrypt 2005, Aarhus, Denmark.","DOI":"10.1007\/11426639_7"},{"key":"ref_6","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":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Ajtai, M., and Dwork, C. (1997, January 9\u201311). A Public-Key Cryptosystem with Worst-Case\/Average-Case Equivalence. Proceedings of the 29th Annual ACM Symposium on Theory of Computing(STOC\u201997), El Paso, TX, USA.","DOI":"10.1145\/258533.258604"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1996, January 21\u201323). Generating Hard Instances of Lattice Problems. Proceedings of the 28th Annual ACM Symposium on Theory of Computing(STOC\u201996), Philadelphia, PA, USA.","DOI":"10.1145\/237814.237838"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Regev, O. (2005, January 22\u201324). On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Proceedings of the 37th Annual ACM Symposium on Theory of Computing(STOC\u201905), Baltimore, MD, USA.","DOI":"10.1145\/1060590.1060603"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for Hard Lattices and New Cryptographic Constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing(STOC\u201908), Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_11","unstructured":"Agrawal, S., Boneh, D., and Boyen, X. (June, January 30). Efficient Lattice (H)IBE in the Standard Model. Proceedings of the Advances in Cryptology-Eurocrypt\u201910, French Riviera, France."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., and Boyen, X. (2010, January 15\u201319). Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE. Proceedings of the Advances in Cryptology-Crypto\u201910, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-642-14623-7_6"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Singh, K., Pandurangan, C., and Banerjee, A.K. (2012, January 3\u20134). Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters. Proceedings of the Second International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE\u201912), Chennai, India.","DOI":"10.1007\/978-3-642-34416-9_11"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Yamada, S. (2016, January 8\u201312). Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters. Proceedings of the Advances in Cryptology-Eurocrypty\u201916, Vienna, Austria.","DOI":"10.1007\/978-3-662-49896-5_2"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boyen, X., Vaikuntanathan, V., and Voulgaris, P. (2012, January 18\u201320). Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices. Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography(PKC\u201912), Darmstadt, Germany.","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"ref_16","unstructured":"Boyen, X. (2013, January 3\u20136). Attribute-Based Functional Encryption on Lattices. Proceedings of the 10th Theory of Cryptography Conferenc e(TCC\u201913), Tokyo, Japan."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., and Wee, H. (2013, January 1\u20134). Attribute-Based Encryption for Circuits. Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC\u201913), Palo Alto, CA, USA.","DOI":"10.1145\/2488608.2488677"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Gorbunov, S., and Halevi, S. (2014, January 11\u201315). Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuit. Proceedings of the Advances in Cryptology-Eurocrypt\u201914, Copenhagen, Denmark.","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3665","DOI":"10.1109\/ACCESS.2018.2888850","article-title":"Security and efficient multi-authority attribute-based encryption scheme from lattices","volume":"7","author":"Liu","year":"2019","journal-title":"IEEE Access"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Zhang, D., Zhang, K., Li, B., Lu, X., Xue, H., and Li, J. (2018). Lattice-Based Dual Receiver Encryption and More. ACISP2018: Information Security and Privacy, Springer.","DOI":"10.1007\/978-3-319-93638-3_30"},{"key":"ref_21","unstructured":"Alwen, J., and Peikert, C. (2009, January 26\u201328). Generating Shorter Bases for Hard Random Lattices. Proceedings of the 26th Symposium on Theoretical Aspects of Computer Science (STACS\u201909), Freiburg, Germany."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Micciancio, D., and Peikert, C. (2012, January 15\u201319). Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. Proceedings of the Advances in Cryptology-Eurocrypt\u201912, Cambridge, UK.","DOI":"10.1007\/978-3-642-29011-4_41"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/6\/599\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:33:26Z","timestamp":1760175206000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/6\/599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,28]]},"references-count":22,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["e22060599"],"URL":"https:\/\/doi.org\/10.3390\/e22060599","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,5,28]]}}}