{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:32Z","timestamp":1740142772227,"version":"3.37.3"},"reference-count":12,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100003130","name":"FWO","doi-asserted-by":"publisher","award":["12ZH420N"],"award-info":[{"award-number":["12ZH420N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CyberSecurity Research Flanders","award":["VR20192203"],"award-info":[{"award-number":["VR20192203"]}]},{"name":"Research Council KU Leuven","award":["C16\/18\/004"],"award-info":[{"award-number":["C16\/18\/004"]}]},{"DOI":"10.13039\/501100011878","name":"Flemish Government","doi-asserted-by":"publisher","award":["G0D3819N"],"award-info":[{"award-number":["G0D3819N"]}],"id":[{"id":"10.13039\/501100011878","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>With the rapid increase in the practical applications of secure computation protocols, increasingly more research is focused on the efficiency of the symmetric-key primitives underlying them. Whereas traditional block ciphers have evolved to be efficient with respect to certain performance metrics, secure computation protocols call for a different efficiency metric: arithmetic complexity. Arithmetic complexity is viewed through the number and layout of nonlinear operations in the circuit implemented by the protocol. Symmetric-key algorithms that are optimized for this metric are said to be algebraic ciphers. It has been shown that recently proposed algebraic ciphers are greatly efficient in ZK and MPC protocols. However, there has not been many algebraic ciphers proposed targeting Fully Homomorphic Encryption (FHE). In this paper, we evaluate the behavior of Vision when implemented as a circuit in an FHE protocol. To this end, we present a state-of-the-art comparison of AES and Vision implemented using HElib. Counterintuitively, Vision does not deliver a better performance than AES in this setting. Then, by attempting to improve a bottleneck of the FHE implementation evaluating Vision we present a new cipher: Seljuk. Despite the improvement with respect to Vision, Seljuk does not deliver the expected performance.<\/jats:p>","DOI":"10.1093\/comjnl\/bxac146","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T11:07:32Z","timestamp":1673867252000},"page":"1312-1319","source":"Crossref","is-referenced-by-count":0,"title":["How Not To Design An Efficient FHE-Friendly Block Cipher: Seljuk"],"prefix":"10.1093","volume":"66","author":[{"given":"Tomer","family":"Ashur","sequence":"first","affiliation":[{"name":"Mathematics and Computer Science, Coding Theory and Cryptology , TU Eindhoven, 5612 AZ Eindhoven, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahzoun","sequence":"additional","affiliation":[{"name":"Mathematics and Computer Science, Coding Theory and Cryptology , TU Eindhoven, 5612 AZ Eindhoven, the Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilara","family":"Toprakhisar","sequence":"additional","affiliation":[{"name":"imec-COSIC, KU Leuven , 3001 Leuven , Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"2023062312054276700_ref1","first-page":"2","volume-title":"31st Annual Symposium on Foundations of Computer Science","author":"Lund","year":"1990"},{"key":"2023062312054276700_ref2","first-page":"113","volume-title":"Proceedings of the 3rd ACM Cloud Computing Security Workshop, CCSW","author":"Naehrig","year":"2011"},{"key":"2023062312054276700_ref3","first-page":"492","article-title":"MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity","volume":"2016","author":"Albrecht","year":"2016","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023062312054276700_ref4","first-page":"458","article-title":"Starkad and Poseidon: New Hash Functions for Zero Knowledge Proof Systems","volume":"2019","author":"Grassi","year":"2019","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023062312054276700_ref5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.46586\/tosc.v2020.i3.1-45","article-title":"Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols","volume":"2020","author":"Aly","year":"2020","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"2023062312054276700_ref6","first-page":"674","volume-title":"Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part II","author":"Grassi","year":"2020"},{"key":"2023062312054276700_ref7","first-page":"99","article-title":"Homomorphic Evaluation of the AES Circuit","volume":"2012","author":"Gentry","year":"2012","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"2023062312054276700_ref8","first-page":"55","volume-title":"Advances in Cryptology - EUROCRYPT \u201893, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, 23\u201327 May","author":"Nyberg","year":"1993"},{"key":"2023062312054276700_ref9","first-page":"309","volume-title":"Innovations in Theoretical Computer Science","author":"Brakerski","year":"2012"},{"key":"2023062312054276700_ref10","first-page":"97","volume-title":"IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS","author":"Brakerski","year":"2011"},{"key":"2023062312054276700_ref11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings","author":"Gentry","year":"2012"},{"key":"2023062312054276700_ref12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings","author":"Smart","year":"2010"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/6\/1312\/50684650\/bxac146.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/6\/1312\/50684650\/bxac146.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T12:07:13Z","timestamp":1687522033000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/6\/1312\/6986901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":12,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,1,13]]},"published-print":{"date-parts":[[2023,6,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxac146","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,6]]},"published":{"date-parts":[[2023,1,13]]}}}