{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:07:40Z","timestamp":1760144860468,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]},{"name":"Zhejiang Provincial basic public welfare research project of China","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]},{"name":"Ningbo City\u2019s Key Technology Breakthrough Plan for \u201cScience and Technology Innovation Yongjiang 2035\u201d","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]},{"name":"Ningbo 2025 Major Project of Science and Technology Innovation","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]},{"name":"Major Technological Innovation Projects of Ningbo High tech Zone","award":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"],"award-info":[{"award-number":["61972350","61972124","11974096","LY23F020013","LGG22F030019","2024Z261","2021Z109","2020Z021","2021Z010","2023Z040","2022BCX050002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The secure computation of symmetric encryption schemes using Yao\u2019s garbled circuits, such as AES, allows two parties, where one holds a plaintext block m and the other holds a key k, to compute Enc(k,m) without leaking m and k to one another. Due to its wide application prospects, secure AES computation has received much attention. However, the evaluation of AES circuits using Yao\u2019s garbled circuits incurs substantial communication overhead. To further improve its efficiency, this paper, upon observing the special structures of AES circuits and the symmetries of an S-box, proposes a novel ciphertext reduction scheme for garbling an S-box in the last SubBytes step. Unlike the idea of traditional Yao\u2019s garbled circuits, where the circuit generator uses the input wire labels to encrypt the corresponding output wire labels, our garbling scheme uses the input wire labels of an S-box to encrypt the corresponding \u201cflip bit strings\u201d. This approach leads to a significant performance improvement in our garbling scheme, which necessitates only 28 ciphertexts to garble an S-box and a single invocation of a cryptographic primitive for decryption compared to the best result in previous work that requires 8\u00d728 ciphertexts to garble an S-box and multiple invocations of a cryptographic primitive for decryption. Crucially, the proposed scheme provides a new idea to improve the performance of Yao\u2019s garbled circuits. We analyze the security of the proposed scheme in the semi-honest model and experimentally verify its efficiency.<\/jats:p>","DOI":"10.3390\/sym16060664","type":"journal-article","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T05:19:49Z","timestamp":1716873589000},"page":"664","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Ciphertext Reduction Scheme for Garbling an S-Box in an AES Circuit with Minimal Online Time"],"prefix":"10.3390","volume":"16","author":[{"given":"Xu","family":"Yan","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, NingboTech University, Ningbo 315100, China"},{"name":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310058, China"}]},{"given":"Bin","family":"Lian","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, NingboTech University, Ningbo 315100, China"}]},{"given":"Yunhao","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, NingboTech University, Ningbo 315100, China"},{"name":"College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310058, China"}]},{"given":"Xiaotie","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China"}]},{"given":"Jialin","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, NingboTech University, Ningbo 315100, China"}]},{"given":"Xianghong","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, NingboTech University, Ningbo 315100, China"}]},{"given":"Fuqun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hangzhou Normal University, Hangzhou 311121, China"}]},{"given":"Kefei","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hangzhou Normal University, Hangzhou 311121, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Sfcs 1986), Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_2","unstructured":"Huang, Y., Shen, C.H., Evans, D., Katz, J., and Shelat, A. (2011, January 15\u201319). Efficient secure computation with garbled circuits. Proceedings of the Information Systems Security: 7th International Conference, ICISS 2011, Kolkata, India. Proceedings 7."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Mohassel, P., and Riva, B. (2013, January 18\u201322). Garbled circuits checking garbled circuits: More efficient and secure two-party computation. Proceedings of the Advances in Cryptology\u2013CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part II.","DOI":"10.1007\/978-3-642-40084-1_3"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Frederiksen, T.K., Nielsen, J.B., and Orlandi, C. (2015, January 26\u201330). Privacy-free garbled circuits with applications to efficient zero-knowledge. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., and Williams, S.C. (2009, January 6\u201310). Secure two-party computation is practical. Proceedings of the Advances in Cryptology\u2013ASIACRYPT 2009: 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan. Proceedings 15.","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","article-title":"Scalable private set intersection based on OT extension","volume":"21","author":"Pinkas","year":"2018","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"key":"ref_7","unstructured":"Pinkas, B., Schneider, T., and Zohner, M. (2014, January 20\u201322). Faster private set intersection based on {OT} extension. Proceedings of the 23rd USENIX Security Symposium (USENIX Security 14), San Diego, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Rindal, P., and Schoppmann, P. (2021, January 17\u201321). VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia.","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM (JACM)"},{"key":"ref_10","unstructured":"Chor, B., Gilboa, N., and Naor, M. (1997). Private information retrieval by keywords. Citeseer."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., and Reingold, O. (2005, January 10\u201312). Keyword search and oblivious pseudorandom functions. Proceedings of the Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA. Proceedings 2.","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Yang, Y., Lu, H., and Weng, J. (December, January 29). Multi-user private keyword search for cloud computing. Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science, Athens, Greece.","DOI":"10.1109\/CloudCom.2011.43"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"12331","DOI":"10.1109\/JIOT.2023.3336337","article-title":"Trusted Location Sharing on Enhanced Privacy-Protection IoT Without Trusted Center","volume":"11","author":"Lian","year":"2024","journal-title":"IEEE Internet Things J."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1515\/popets-2017-0044","article-title":"Private set intersection for unequal set sizes with mobile applications","volume":"2017","author":"Kiss","year":"2017","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_15","unstructured":"Kolesnikov, V., and Schneider, T. (2008, January 7\u201311). Improved garbled circuit: Free XOR gates and applications. Proceedings of the Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland. Proceedings, Part II 35."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"102105","DOI":"10.1016\/j.vlsi.2023.102105","article-title":"A new post-processing approach for improvement of nonlinearity property in substitution boxes","volume":"94","year":"2024","journal-title":"Integration"},{"key":"ref_17","first-page":"561","article-title":"A method for synthesis of S-boxes with good avalanche characteristics of component Boolean and quaternary functions","volume":"26","author":"Sokolov","year":"2022","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"6943","DOI":"10.1007\/s11042-022-13612-6","article-title":"New color image encryption technique based on three-dimensional logistic map and Grey wolf optimization based generated substitution boxes","volume":"82","author":"Khan","year":"2023","journal-title":"Multimed. Tools Appl."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Alali, A.S., Ali, R., Jamil, M.K., Ali, J. (2024). Dynamic S-Box Construction Using Mordell Elliptic Curves over Galois Field and Its Applications in Image Encryption. Mathematics, 12.","DOI":"10.3390\/math12040587"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"e23652","DOI":"10.1016\/j.heliyon.2023.e23652","article-title":"A medical image encryption scheme based on Mobius transformation and Galois field","volume":"10","author":"Ali","year":"2024","journal-title":"Heliyon"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"135880","DOI":"10.1109\/ACCESS.2023.3337443","article-title":"A robust S box design using cyclic groups and image encryption","volume":"11","author":"Ali","year":"2023","journal-title":"IEEE Access"},{"key":"ref_22","unstructured":"Huang, Y., Evans, D., Katz, J., and Malka, L. (2011, January 8\u201312). Faster secure Two-Party computation using garbled circuits. Proceedings of the 20th USENIX Security Symposium (USENIX Security 11), San Francisco, CA, USA."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Zahur, S., Rosulek, M., and Evans, D. (2015, January 26\u201330). Two halves make a whole: Reducing data transfer in garbled circuits using half gates. Proceedings of the Advances in Cryptology-EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria. Proceedings, Part II 34.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Keelveedhi, S., and Rogaway, P. (2013, January 19\u201322). Efficient Garbling from a Fixed-Key Blockcipher. Proceedings of the 2013 IEEE Symposium on Security and Privacy, San Francisco, CA, USA.","DOI":"10.1109\/SP.2013.39"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., and Sumner, R. (1999, January 3\u20135). Privacy preserving auctions and mechanism design. Proceedings of the 1st ACM Conference on Electronic Commerce, Denver, CO, USA.","DOI":"10.1145\/336992.337028"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., and Rogaway, P. (1990, January 14\u201316). The round complexity of secure protocols. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA.","DOI":"10.1145\/100216.100287"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Mohassel, P., and Rosulek, M. (2014, January 17\u201321). FleXOR: Flexible garbling for XOR gates that beats free-XOR. Proceedings of the Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA. Proceedings, Part II 34.","DOI":"10.1007\/978-3-662-44381-1_25"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Rosulek, M., and Roy, L. (2021, January 16\u201320). Three halves make a whole? Beating the half-gates lower bound for garbled circuits. Proceedings of the Annual International Cryptology Conference, Virtual Event.","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"ref_29","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., and Sella, Y. (2004, January 9\u201313). Fairplay-Secure Two-Party Computation System. Proceedings of the USENIX Security Symposium, San Diego, CA, USA."},{"key":"ref_30","unstructured":"Zahur, S., and Evans, D. (2015, November 30). Obliv-C: A Language for Extensible Data-Oblivious Computation. Available online: https:\/\/eprint.iacr.org\/2015\/1153."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.R., Schneider, T., and Wehrenberg, I. (2010, January 4\u20138). TASTY: Tool for automating secure two-party computations. Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, IL, USA.","DOI":"10.1145\/1866307.1866358"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Naor, M., and Pinkas, B. (1999, January 23\u201326). Oblivious transfer and polynomial evaluation. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Dallas, TX, USA.","DOI":"10.1145\/301250.301312"},{"key":"ref_33","unstructured":"Naor, M., and Pinkas, B. (2001, January 7\u20139). Efficient oblivious transfer protocols. Proceedings of the SODA, Washington, DC, USA."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., and Rogaway, P. (2012, January 16\u201318). Foundations of garbled circuits. Proceedings of the 2012 ACM Conference on Computer and Communications Security, Raleigh, NC, USA.","DOI":"10.1145\/2382196.2382279"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/664\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:49:25Z","timestamp":1760107765000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/6\/664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,28]]},"references-count":34,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["sym16060664"],"URL":"https:\/\/doi.org\/10.3390\/sym16060664","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2024,5,28]]}}}