{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:38:23Z","timestamp":1760143103446,"version":"build-2065373602"},"reference-count":41,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Hunan Province","award":["2023JJ40054","2022A1515011512","202208430100"],"award-info":[{"award-number":["2023JJ40054","2022A1515011512","202208430100"]}]},{"name":"Guangdong Basic and Applied Basic Research Foundation","award":["2023JJ40054","2022A1515011512","202208430100"],"award-info":[{"award-number":["2023JJ40054","2022A1515011512","202208430100"]}]},{"name":"scholarship under the State Scholarship Fund of China Scholarship Council","award":["2023JJ40054","2022A1515011512","202208430100"],"award-info":[{"award-number":["2023JJ40054","2022A1515011512","202208430100"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>A bilinear map whose domain and target sets are identical is called a self-bilinear map. Original self-bilinear maps are defined over cyclic groups. Since the map itself reveals information about the underlying cyclic group, the Decisional Diffie\u2013Hellman Problem (DDH) and the computational Diffie\u2013Hellman (CDH) problem may be solved easily in some specific groups. This brings a lot of limitations to constructing secure self-bilinear schemes. As a compromise, a self-bilinear map with auxiliary information was proposed in CRYPTO\u20192014. In this paper, we construct this weak variant of a self-bilinear map from generic sets and indistinguishable obfuscation. These sets should own several properties. A new notion, One Way Encoding System (OWES), is proposed to summarize these properties. The new Encoding Division Problem (EDP) is defined to complete the security proof. The OWES can be built by making use of one level of graded encoding systems (GES). To construct a concrete self-bilinear map scheme, Garg, Gentry, and Halvei(GGH13) GES is adopted in our work. Even though the security of GGH13 was recently broken by Hu et al., their algorithm does not threaten our applications. At the end of this paper, some further considerations for the EDP for concrete construction are given to improve the confidence that EDP is indeed hard.<\/jats:p>","DOI":"10.3390\/info15010054","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T08:57:32Z","timestamp":1705481852000},"page":"54","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-Bilinear Map from One Way Encoding System and i\ud835\udcaa"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5804-3092","authenticated-orcid":false,"given":"Huang","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangguo","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baodian","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3387-6864","authenticated-orcid":false,"given":"Yusong","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"key":"ref_1","unstructured":"Boneh, D., and Franklin, M. (2001). Advances in Cryptology\u2013CRYPTO 2001, Springer."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10623-013-9868-6","article-title":"Anonymous HIBE with short ciphertexts: Full security in prime order groups","volume":"74","author":"Lee","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"ref_3","unstructured":"Clark, J., van Oorschot, P., Ruoti, S., Seamons, K., and Zappala, D. (2021). Financial Cryptography and Data Security, Springer."},{"key":"ref_4","unstructured":"Groth, J., Ostrovsky, R., and Sahai, A. (2006). Advances in Cryptology\u2013EUROCRYPT 2006, Springer."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Mahapatra, S., Wooldridge, T., and Wang, X. (2022, January 21\u201324). A Post-quantum Zero-Knowledge Proof System Using Quantum Information Theory. Proceedings of the Seventh International Congress on Information and Communication Technology, London, UK.","DOI":"10.1007\/978-981-19-1610-6_76"},{"key":"ref_6","unstructured":"Eli, B., Brent, W., and David, J. (2023, December 23). Batch Arguments to NIZKs from One-Way Functions. Technical Report, Cryptology ePrint Archive, Report 2023\/1938, 2023. Available online: https:\/\/eprint.iacr.org\/2023\/1938."},{"key":"ref_7","unstructured":"Badrinarayanan, S., Patranabis, S., and Sarkar, P. (2022). Theory of Cryptography, Springer."},{"key":"ref_8","unstructured":"Singh, N., Dayama, P., and Pandit, V. (2022). Financial Cryptography and Data Security, Springer."},{"key":"ref_9","unstructured":"Cascudo, I., and Giunta, E. (2022). Financial Cryptography and Data Security, Springer."},{"key":"ref_10","unstructured":"Sahai, A., and Waters, B. (2005). Advances in Cryptology\u2013EUROCRYPT 2005, Springer."},{"key":"ref_11","unstructured":"Boneh, D., Lynn, B., and Shacham, H. (2001). Advances in Cryptology ASIACRYPT 2001, Springer."},{"key":"ref_12","unstructured":"Zhang, F., Safavi-Naini, R., and Susilo, W. (2004). Public Key Cryptography\u2013PKC 2004, Springer."},{"key":"ref_13","unstructured":"Chatzigiannis, P., Baldimtsi, F., and Chalkias, K. (2022). Financial Cryptography and Data Security, Springer."},{"key":"ref_14","unstructured":"Vesely, P.E.A. (2022). Financial Cryptography and Data Security, Springer."},{"key":"ref_15","unstructured":"Abdelhaliem, B. (2023, December 24). A Signature Scheme from Full-Distance Syndrome Decoding. Technical Report, Cryptology ePrint Archive, Report 2023\/1956, 2023. Available online: https:\/\/eprint.iacr.org\/2023\/1956."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1090\/conm\/324\/05731","article-title":"Applications of multilinear forms to cryptography","volume":"324","author":"Boneh","year":"2003","journal-title":"Contemp. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","article-title":"Candidate Multilinear Maps from Ideal Lattices","volume":"Volume 7881","author":"Garg","year":"2013","journal-title":"Advances in Cryptology\u2013EUROCRYPT 2013"},{"key":"ref_18","unstructured":"Coron, J.S., Lepoint, T., and Tibouchi, M. (2013). Advances in Cryptology\u2013CRYPTO 2013, Springer."},{"key":"ref_19","unstructured":"Gentry, C., Gorbunov, S., and Halevi, S. (2015). Theory of Cryptography, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., and Waters, B. (2013, January 2\u20134). Witness encryption and its applications. Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, Palo Alto, CA, USA.","DOI":"10.1145\/2488608.2488667"},{"key":"ref_21","unstructured":"Baghery, K., Kohlweiss, M., Siim, J., and Volkhov, M. (2021). Financial Cryptography and Data Security, Springer."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., and Waters, B. (2019, January 26\u201329). Candidate indistinguishability obfuscation and functional encryption for all circuits. Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA.","DOI":"10.1109\/FOCS.2013.13"},{"key":"ref_23","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., and Stehl\u00e9, D. (2015). Advances in Cryptology\u2013EUROCRYPT 2015, Springer."},{"key":"ref_24","unstructured":"Garg, S., Gentry, C., Halevi, S., and Zhandry, M. (2014, August 28). Fully Secure Functional Encryption without Obfuscation. Technical Report, Cryptology ePrint Archive, Report 2014\/666. 2014. Available online: https:\/\/eprint.iacr.org\/2014\/666."},{"key":"ref_25","unstructured":"Boneh, D., Wu, D.J., and Zimmerman, J. (2014, November 13). Immunizing Multilinear Maps Against Zeroizing Attacks. Technical Report, Cryptology ePrint Archive, Report 2014\/930, 2014. Available online: https:\/\/eprint.iacr.org\/2014\/930."},{"key":"ref_26","unstructured":"Coron, J.S., Lepoint, T., and Tibouchi, M. (2014, December 01). Cryptanalysis of two candidate fixes of multilinear maps over the integers. Technical Report, Cryptology ePrint Archive, Report 2014\/975, 2014. Available online: https:\/\/eprint.iacr.org\/2014\/975."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Coron, J.S., Lepoint, T., and Tibouchi, M. (2015, January 16\u201320). New Multilinear Maps over the Integers. Proceedings of the Annual Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-662-47989-6_13"},{"key":"ref_28","unstructured":"Cheon, J.H., Fouque, P.A., Lee, C., Minaud, B., and Ryu, H. (2016). Advances in Cryptology EUROCRYPT 2016, Springer."},{"key":"ref_29","unstructured":"Hu, Y., and Jia, H. (2016). Advances in Cryptology\u2013EUROCRYPT 2016, Springer."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10623-016-0266-8","article-title":"Cryptanalysis of multilinear maps from ideal lattices: Revisited","volume":"84","author":"Jia","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref_31","unstructured":"Brakerski, Z., and Rothblum, G.N. (2014). Theory of Cryptography, Springer."},{"key":"ref_32","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., and Sahai, A. (2014). Advances in Cryptology\u2013EUROCRYPT 2014, Springer."},{"key":"ref_33","unstructured":"Pass, R., Seth, K., and Telang, S. (2014). Advances in Cryptology\u2013CRYPTO 2014, Springer."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ananth, P., Gupta, D., Ishai, Y., and Sahai, A. (2014, January 3\u20137). Optimizing Obfuscation: Avoiding Barrington\u2019s Theorem. Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA.","DOI":"10.1145\/2660267.2660342"},{"key":"ref_35","unstructured":"Miles, E., Sahai, A., and Weiss, M. (2014, October 28). Protecting obfuscation against arithmetic attacks. Technical Report, Cryptology ePrint Archive, Report 2014\/878, 2014. Available online: https:\/\/eprint.iacr.org\/2014\/878."},{"key":"ref_36","unstructured":"Badrinarayanan, S., Miles, E., Sahai, A., and Zhandry, M. (2015, February 27). Post-Zeroizing Obfuscation: The case of Evasive Circuits. Technical Report, Cryptology ePrint Archive, Report 2015\/167, 2015. Available online: https:\/\/eprint.iacr.org\/2015\/167."},{"key":"ref_37","first-page":"671","article-title":"A self-pairing map and its applications to cryptography","volume":"151","author":"Lee","year":"2004","journal-title":"Appl. Math. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4134\/BKMS.2009.46.2.303","article-title":"A note on self-bilinear maps","volume":"46","author":"Cheon","year":"2009","journal-title":"Korean Math. Soc."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-662-44381-1_6","article-title":"Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications","volume":"Volume 8617","author":"Yamakawa","year":"2014","journal-title":"Advances in Cryptology\u2013CRYPTO 2014"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Goldreich, O., and Levin, L.A. (1989, January 14\u201317). A hard-core predicate for all one-way functions. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, Seattle, WA, USA.","DOI":"10.1145\/73007.73010"},{"key":"ref_41","unstructured":"Langlois, A., Stehl\u00e9, D., and Steinfeld, R. (2014). Advances in Cryptology\u2013EUROCRYPT 2014, Springer."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/1\/54\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:48:59Z","timestamp":1760104139000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/1\/54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["info15010054"],"URL":"https:\/\/doi.org\/10.3390\/info15010054","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2024,1,17]]}}}