{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:08:46Z","timestamp":1755839326625,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3497759","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"667-681","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Symbolic Synthesis of Indifferentiability Attacks"],"prefix":"10.1145","author":[{"given":"Itsaka","family":"Rakotonirina","sequence":"first","affiliation":[{"name":"MPI-SP, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Ambrona","sequence":"additional","affiliation":[{"name":"Nomadic Labs, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Aguirre","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Barthe","sequence":"additional","affiliation":[{"name":"MPI-SP & IMDEA Software Institute, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"The applied pi calculus: Mobile values, new names, and secure communication. Journal of the ACM (JACM)","author":"Abadi Mart\u00edn","year":"2017","unstructured":"Mart\u00edn Abadi , Bruno Blanchet , and C\u00e9dric Fournet . 2017. The applied pi calculus: Mobile values, new names, and secure communication. Journal of the ACM (JACM) ( 2017 ). Mart\u00edn Abadi, Bruno Blanchet, and C\u00e9dric Fournet. 2017. The applied pi calculus: Mobile values, new names, and secure communication. Journal of the ACM (JACM) (2017)."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.032"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794418.2794756"},{"volume-title":"ACM CCS 2017: 24th Conference on Computer and Communications Security","author":"Ambrona Miguel","key":"e_1_3_2_2_4_1","unstructured":"Miguel Ambrona , Gilles Barthe , Romain Gay , and Hoeteck Wee . 2017. Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions . In ACM CCS 2017: 24th Conference on Computer and Communications Security , Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM Press , Dallas, TX, USA , 647--664. https:\/\/doi.org\/10.1145\/3133956.3134088 10.1145\/3133956.3134088 Miguel Ambrona, Gilles Barthe, Romain Gay, and Hoeteck Wee. 2017. Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions. In ACM CCS 2017: 24th Conference on Computer and Communications Security, Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM Press, Dallas, TX, USA, 647--664. https:\/\/doi.org\/10.1145\/3133956.3134088"},{"key":"e_1_3_2_2_5_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"851","author":"Ambrona Miguel","year":"2016","unstructured":"Miguel Ambrona , Gilles Barthe , and Benedikt Schmidt . 2016 . Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. In Advances in Cryptology -- EUROCRYPT 2016 , Part II (Lecture Notes in Computer Science , Vol. 9666), Marc Fischlin and Jean-S\u00e9 bastien Coron (Eds.). Springer, Heidelberg, Germany, Vienna, Austria, 822-- 851 . https:\/\/doi.org\/10.1007\/978-3-662-49896-5_29 10.1007\/978-3-662-49896-5_29 Miguel Ambrona, Gilles Barthe, and Benedikt Schmidt. 2016. Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. In Advances in Cryptology -- EUROCRYPT 2016, Part II (Lecture Notes in Computer Science, Vol. 9666), Marc Fischlin and Jean-S\u00e9 bastien Coron (Eds.). Springer, Heidelberg, Germany, Vienna, Austria, 822--851. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_29"},{"volume-title":"Frontiers of Combining Systems","author":"Arnaud Mathilde","key":"e_1_3_2_2_6_1","unstructured":"Mathilde Arnaud , V\u00e9ronique Cortier , and St\u00e9phanie Delaune . 2007. Combining Algorithms for Deciding Knowledge in Security Protocols . In Frontiers of Combining Systems , Boris Konev and Frank Wolter (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 103--117. Mathilde Arnaud, V\u00e9ronique Cortier, and St\u00e9phanie Delaune. 2007. Combining Algorithms for Deciding Knowledge in Security Protocols. In Frontiers of Combining Systems, Boris Konev and Frank Wolter (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 103--117."},{"volume-title":"Fast Software Encryption -- FSE 2014 (Lecture Notes in Computer Science","author":"Barbosa Manuel","key":"e_1_3_2_2_7_1","unstructured":"Manuel Barbosa and Pooya Farshim . 2015. The Related-Key Analysis of Feistel Constructions . In Fast Software Encryption -- FSE 2014 (Lecture Notes in Computer Science , Vol. 8540), Carlos Cid and Christian Rechberger (Eds.). Springer, Heidelberg, Germany, London, UK, 265-- 284 . https:\/\/doi.org\/10.1007\/978-3-662-46706-0_14 10.1007\/978-3-662-46706-0_14 Manuel Barbosa and Pooya Farshim. 2015. The Related-Key Analysis of Feistel Constructions. In Fast Software Encryption -- FSE 2014 (Lecture Notes in Computer Science, Vol. 8540), Carlos Cid and Christian Rechberger (Eds.). Springer, Heidelberg, Germany, London, UK, 265--284. https:\/\/doi.org\/10.1007\/978-3-662-46706-0_14"},{"key":"e_1_3_2_2_8_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"220","author":"Barbosa Manuel","year":"2018","unstructured":"Manuel Barbosa and Pooya Farshim . 2018 . Indifferentiable Authenticated Encryption. In Advances in Cryptology -- CRYPTO 2018 , Part I (Lecture Notes in Computer Science , Vol. 10991), Hovav Shacham and Alexandra Boldyreva (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 187-- 220 . https:\/\/doi.org\/10.1007\/978-3-319-96884-1_7 10.1007\/978-3-319-96884-1_7 Manuel Barbosa and Pooya Farshim. 2018. Indifferentiable Authenticated Encryption. In Advances in Cryptology -- CRYPTO 2018, Part I (Lecture Notes in Computer Science, Vol. 10991), Hovav Shacham and Alexandra Boldyreva (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 187--220. https:\/\/doi.org\/10.1007\/978-3-319-96884-1_7"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516663"},{"key":"e_1_3_2_2_10_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"112","author":"Barthe Gilles","year":"2014","unstructured":"Gilles Barthe , Edvard Fagerholm , Dario Fiore , John C. Mitchell , Andre Scedrov , and Benedikt Schmidt . 2014 . Automated Analysis of Cryptographic Assumptions in Generic Group Models. In Advances in Cryptology -- CRYPTO 2014 , Part I (Lecture Notes in Computer Science , Vol. 8616),, Juan A. Garay and Rosario Gennaro (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 95-- 112 . https:\/\/doi.org\/10.1007\/978-3-662-44371-2_6 10.1007\/978-3-662-44371-2_6 Gilles Barthe, Edvard Fagerholm, Dario Fiore, John C. Mitchell, Andre Scedrov, and Benedikt Schmidt. 2014. Automated Analysis of Cryptographic Assumptions in Generic Group Models. In Advances in Cryptology -- CRYPTO 2014, Part I (Lecture Notes in Computer Science, Vol. 8616),, Juan A. Garay and Rosario Gennaro (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 95--112. https:\/\/doi.org\/10.1007\/978-3-662-44371-2_6"},{"volume-title":"ACM CCS 2018: 25th Conference on Computer and Communications Security","author":"Barthe Gilles","key":"e_1_3_2_2_11_1","unstructured":"Gilles Barthe , Xiong Fan , Joshua Gancher , Benjamin Gr\u00e9goire , Charlie Jacomme , and Elaine Shi . 2018. Symbolic Proofs for Lattice-Based Cryptography . In ACM CCS 2018: 25th Conference on Computer and Communications Security , David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press , Toronto, ON , Canada, 538--555. https:\/\/doi.org\/10.1145\/3243734.3243825 10.1145\/3243734.3243825 Gilles Barthe, Xiong Fan, Joshua Gancher, Benjamin Gr\u00e9goire, Charlie Jacomme, and Elaine Shi. 2018. Symbolic Proofs for Lattice-Based Cryptography. In ACM CCS 2018: 25th Conference on Computer and Communications Security, David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press, Toronto, ON, Canada, 538--555. https:\/\/doi.org\/10.1145\/3243734.3243825"},{"key":"e_1_3_2_2_12_1","volume-title":"Automated Proofs of Pairing-Based Cryptography. In ACM CCS 2015: 22nd Conference on Computer and Communications Security, Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM Press","author":"Barthe Gilles","year":"2015","unstructured":"Gilles Barthe , Benjamin Gr\u00e9goire , and Benedikt Schmidt . 2015 . Automated Proofs of Pairing-Based Cryptography. In ACM CCS 2015: 22nd Conference on Computer and Communications Security, Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM Press , Denver, CO, USA, 1156--1168. https:\/\/doi.org\/10.1145\/2810103.2813697 10.1145\/2810103.2813697 Gilles Barthe, Benjamin Gr\u00e9goire, and Benedikt Schmidt. 2015. Automated Proofs of Pairing-Based Cryptography. In ACM CCS 2015: 22nd Conference on Computer and Communications Security, Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM Press, Denver, CO, USA, 1156--1168. https:\/\/doi.org\/10.1145\/2810103.2813697"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2019.00017"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243846"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.005"},{"key":"e_1_3_2_2_17_1","volume-title":"Workshop on the Theory and Application of of Cryptographic Techniques.","author":"Bellare Mihir","year":"1994","unstructured":"Mihir Bellare and Phillip Rogaway . 1994 . Optimal asymmetric encryption . In Workshop on the Theory and Application of of Cryptographic Techniques. Mihir Bellare and Phillip Rogaway. 1994. Optimal asymmetric encryption. In Workshop on the Theory and Application of of Cryptographic Techniques."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.26"},{"volume-title":"Advances in Cryptology -- CRYPTO 2002 (Lecture Notes in Computer Science","author":"Black John","key":"e_1_3_2_2_20_1","unstructured":"John Black , Phillip Rogaway , and Thomas Shrimpton . 2002. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV . In Advances in Cryptology -- CRYPTO 2002 (Lecture Notes in Computer Science , Vol. 2442), Moti Yung (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 320-- 335 . https:\/\/doi.org\/10.1007\/3-540-45708-9_21 10.1007\/3-540-45708-9_21 John Black, Phillip Rogaway, and Thomas Shrimpton. 2002. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. In Advances in Cryptology -- CRYPTO 2002 (Lecture Notes in Computer Science, Vol. 2442), Moti Yung (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 320--335. https:\/\/doi.org\/10.1007\/3-540-45708-9_21"},{"volume-title":"Advances in Cryptology -- EUROCRYPT 2005 (Lecture Notes in Computer Science","author":"Boneh Dan","key":"e_1_3_2_2_21_1","unstructured":"Dan Boneh , Xavier Boyen , and Eu-Jin Goh . 2005. Hierarchical Identity Based Encryption with Constant Size Ciphertext . In Advances in Cryptology -- EUROCRYPT 2005 (Lecture Notes in Computer Science , Vol. 3494),, Ronald Cramer (Ed.). Springer, Heidelberg, Germany, Aarhus, Denmark, 440-- 456 . https:\/\/doi.org\/10.1007\/11426639_26 10.1007\/11426639_26 Dan Boneh, Xavier Boyen, and Eu-Jin Goh. 2005. Hierarchical Identity Based Encryption with Constant Size Ciphertext. In Advances in Cryptology -- EUROCRYPT 2005 (Lecture Notes in Computer Science, Vol. 3494),, Ronald Cramer (Ed.). Springer, Heidelberg, Germany, Aarhus, Denmark, 440--456. https:\/\/doi.org\/10.1007\/11426639_26"},{"volume-title":"Advances in Cryptology -- CRYPTO 2011 (Lecture Notes in Computer Science","author":"Bouillaguet Charles","key":"e_1_3_2_2_22_1","unstructured":"Charles Bouillaguet , Patrick Derbez , and Pierre-Alain Fouque . 2011. Automatic Search of Attacks on Round-Reduced AES and Applications . In Advances in Cryptology -- CRYPTO 2011 (Lecture Notes in Computer Science , Vol. 6841), Phillip Rogaway (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 169-- 187 . https:\/\/doi.org\/10.1007\/978-3-642-22792-9_10 10.1007\/978-3-642-22792-9_10 Charles Bouillaguet, Patrick Derbez, and Pierre-Alain Fouque. 2011. Automatic Search of Attacks on Round-Reduced AES and Applications. In Advances in Cryptology -- CRYPTO 2011 (Lecture Notes in Computer Science, Vol. 6841), Phillip Rogaway (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 169--187. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_10"},{"volume-title":"Fast Software Encryption -- FSE 2006 (Lecture Notes in Computer Science","author":"Buchmann Johannes","key":"e_1_3_2_2_23_1","unstructured":"Johannes Buchmann , Andrei Pyshkin , and Ralf-Philipp Weinmann . 2006. A Zero-Dimensional Gr\u00f6bner Basis for AES-128 . In Fast Software Encryption -- FSE 2006 (Lecture Notes in Computer Science , Vol. 4047), Matthew J. B. Robshaw (Ed.). Springer, Heidelberg, Germany, Graz, Austria, 78-- 88 . https:\/\/doi.org\/10.1007\/11799313_6 10.1007\/11799313_6 Johannes Buchmann, Andrei Pyshkin, and Ralf-Philipp Weinmann. 2006. A Zero-Dimensional Gr\u00f6bner Basis for AES-128. In Fast Software Encryption -- FSE 2006 (Lecture Notes in Computer Science, Vol. 4047), Matthew J. B. Robshaw (Ed.). Springer, Heidelberg, Germany, Graz, Austria, 78--88. https:\/\/doi.org\/10.1007\/11799313_6"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_54"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046744"},{"key":"e_1_3_2_2_26_1","volume-title":"Deciding equivalence-based properties using constraint solving. Theoretical Computer Science","author":"Cheval Vincent","year":"2013","unstructured":"Vincent Cheval , V\u00e9ronique Cortier , and St\u00e9phanie Delaune . 2013. Deciding equivalence-based properties using constraint solving. Theoretical Computer Science ( 2013 ). Vincent Cheval, V\u00e9ronique Cortier, and St\u00e9phanie Delaune. 2013. Deciding equivalence-based properties using constraint solving. Theoretical Computer Science (2013)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00033"},{"key":"e_1_3_2_2_28_1","volume-title":"Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures. Theoretical Computer Science","author":"Chevalier Yannick","year":"2010","unstructured":"Yannick Chevalier and Michael Rusinowitch . 2010. Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures. Theoretical Computer Science ( 2010 ). Yannick Chevalier and Michael Rusinowitch. 2010. Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures. Theoretical Computer Science (2010)."},{"key":"e_1_3_2_2_29_1","volume-title":"Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning","author":"Ciob\u00e2cua S","year":"2012","unstructured":"c S tefan Ciob\u00e2cua , St\u00e9phanie Delaune , and Steve Kremer . 2012. Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning ( 2012 ). cS tefan Ciob\u00e2cua, St\u00e9phanie Delaune, and Steve Kremer. 2012. Computing knowledge in security protocols under convergent equational theories. Journal of Automated Reasoning (2012)."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455786"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9189-6"},{"volume-title":"Advances in Cryptology -- CRYPTO 2008 (Lecture Notes in Computer Science","author":"Coron Jean-S\u00e9bastien","key":"e_1_3_2_2_32_1","unstructured":"Jean-S\u00e9bastien Coron , Jacques Patarin , and Yannick Seurin . 2008. The Random Oracle Model and the Ideal Cipher Model Are Equivalent . In Advances in Cryptology -- CRYPTO 2008 (Lecture Notes in Computer Science , Vol. 5157), David Wagner (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1-- 20 . https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1 10.1007\/978-3-540-85174-5_1 Jean-S\u00e9bastien Coron, Jacques Patarin, and Yannick Seurin. 2008. The Random Oracle Model and the Ideal Cipher Model Are Equivalent. In Advances in Cryptology -- CRYPTO 2008 (Lecture Notes in Computer Science, Vol. 5157), David Wagner (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 1--20. https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9208-8"},{"key":"e_1_3_2_2_34_1","volume-title":"A survey of symbolic methods in computational analysis of cryptographic systems. Journal of Automated Reasoning","author":"Cortier V\u00e9ronique","year":"2011","unstructured":"V\u00e9ronique Cortier , Steve Kremer , and Bogdan Warinschi . 2011. A survey of symbolic methods in computational analysis of cryptographic systems. Journal of Automated Reasoning ( 2011 ). V\u00e9ronique Cortier, Steve Kremer, and Bogdan Warinschi. 2011. A survey of symbolic methods in computational analysis of cryptographic systems. Journal of Automated Reasoning (2011)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455817"},{"volume-title":"Advances in Cryptology -- CRYPTO 2003 (Lecture Notes in Computer Science","author":"Courtois Nicolas","key":"e_1_3_2_2_36_1","unstructured":"Nicolas Courtois . 2003. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback . In Advances in Cryptology -- CRYPTO 2003 (Lecture Notes in Computer Science , Vol. 2729), Dan Boneh (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 176-- 194 . https:\/\/doi.org\/10.1007\/978-3-540-45146-4_11 10.1007\/978-3-540-45146-4_11 Nicolas Courtois. 2003. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In Advances in Cryptology -- CRYPTO 2003 (Lecture Notes in Computer Science, Vol. 2729), Dan Boneh (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 176--194. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_11"},{"volume-title":"Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science","author":"Courtois Nicolas","key":"e_1_3_2_2_37_1","unstructured":"Nicolas Courtois and Willi Meier . 2003. Algebraic Attacks on Stream Ciphers with Linear Feedback . In Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science , Vol. 2656),, Eli Biham (Ed.). Springer, Heidelberg, Germany, Warsaw, Poland, 345-- 359 . https:\/\/doi.org\/10.1007\/3-540-39200-9_21 10.1007\/3-540-39200-9_21 Nicolas Courtois and Willi Meier. 2003. Algebraic Attacks on Stream Ciphers with Linear Feedback. In Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science, Vol. 2656),, Eli Biham (Ed.). Springer, Heidelberg, Germany, Warsaw, Poland, 345--359. https:\/\/doi.org\/10.1007\/3-540-39200-9_21"},{"volume-title":"ACM Conference on Computer and Communications Security (CCS).","author":"Cremers Cas","key":"e_1_3_2_2_38_1","unstructured":"Cas Cremers , Marko Horvat , Jonathan Hoyland , Sam Scott , and Thyla van der Merwe. 2017. A comprehensive symbolic analysis of TLS 1.3 . In ACM Conference on Computer and Communications Security (CCS). Cas Cremers, Marko Horvat, Jonathan Hoyland, Sam Scott, and Thyla van der Merwe. 2017. A comprehensive symbolic analysis of TLS 1.3. In ACM Conference on Computer and Communications Security (CCS)."},{"key":"e_1_3_2_2_39_1","volume-title":"Part III (Lecture Notes in Computer Science","volume":"555","author":"Dai Yuanxi","year":"2017","unstructured":"Yuanxi Dai , Yannick Seurin , John P. Steinberger , and Aishwarya Thiruvengadam . 2017 . Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. In Advances in Cryptology -- CRYPTO 2017 , Part III (Lecture Notes in Computer Science , Vol. 10403),, Jonathan Katz and Hovav Shacham (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 524-- 555 . https:\/\/doi.org\/10.1007\/978-3-319-63697-9_18 10.1007\/978-3-319-63697-9_18 Yuanxi Dai, Yannick Seurin, John P. Steinberger, and Aishwarya Thiruvengadam. 2017. Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient. In Advances in Cryptology -- CRYPTO 2017, Part III (Lecture Notes in Computer Science, Vol. 10403),, Jonathan Katz and Hovav Shacham (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 524--555. https:\/\/doi.org\/10.1007\/978-3-319-63697-9_18"},{"key":"e_1_3_2_2_40_1","volume-title":"Steinberger","author":"Dai Yuanxi","year":"2016","unstructured":"Yuanxi Dai and John P . Steinberger . 2016 . Indifferentiability of 8-Round Feistel Networks. In Advances in Cryptology -- CRYPTO 2016, Part I (Lecture Notes in Computer Science , Vol. 9814), Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 95-- 120 . https:\/\/doi.org\/10.1007\/978-3-662-53018-4_4 10.1007\/978-3-662-53018-4_4 Yuanxi Dai and John P. Steinberger. 2016. Indifferentiability of 8-Round Feistel Networks. In Advances in Cryptology -- CRYPTO 2016, Part I (Lecture Notes in Computer Science, Vol. 9814), Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 95--120. https:\/\/doi.org\/10.1007\/978-3-662-53018-4_4"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31365-3_15"},{"key":"e_1_3_2_2_42_1","volume-title":"Symbolic protocol analysis for monoidal equational theories. Information and Computation","author":"Delaune St\u00e9phanie","year":"2008","unstructured":"St\u00e9phanie Delaune , Pascal Lafourcade , Denis Lugiez , and Ralf Treinen . 2008. Symbolic protocol analysis for monoidal equational theories. Information and Computation ( 2008 ). St\u00e9phanie Delaune, Pascal Lafourcade, Denis Lugiez, and Ralf Treinen. 2008. Symbolic protocol analysis for monoidal equational theories. Information and Computation (2008)."},{"key":"e_1_3_2_2_43_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"184","author":"Derbez Patrick","year":"2016","unstructured":"Patrick Derbez and Pierre-Alain Fouque . 2016 . Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks. In Advances in Cryptology -- CRYPTO 2016 , Part II (Lecture Notes in Computer Science , Vol. 9815),, Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 157-- 184 . https:\/\/doi.org\/10.1007\/978-3-662-53008-5_6 10.1007\/978-3-662-53008-5_6 Patrick Derbez and Pierre-Alain Fouque. 2016. Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks. In Advances in Cryptology -- CRYPTO 2016, Part II (Lecture Notes in Computer Science, Vol. 9815),, Matthew Robshaw and Jonathan Katz (Eds.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 157--184. https:\/\/doi.org\/10.1007\/978-3-662-53008-5_6"},{"key":"e_1_3_2_2_44_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"704","author":"Dodis Yevgeniy","year":"2016","unstructured":"Yevgeniy Dodis , Martijn Stam , John P. Steinberger , and Tianren Liu . 2016 . Indifferentiability of Confusion-Diffusion Networks. In Advances in Cryptology -- EUROCRYPT 2016 , Part II (Lecture Notes in Computer Science , Vol. 9666),, Marc Fischlin and Jean-S\u00e9 bastien Coron (Eds.). Springer, Heidelberg, Germany, Vienna, Austria, 679-- 704 . https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24 10.1007\/978-3-662-49896-5_24 Yevgeniy Dodis, Martijn Stam, John P. Steinberger, and Tianren Liu. 2016. Indifferentiability of Confusion-Diffusion Networks. In Advances in Cryptology -- EUROCRYPT 2016, Part II (Lecture Notes in Computer Science, Vol. 9666),, Marc Fischlin and Jean-S\u00e9 bastien Coron (Eds.). Springer, Heidelberg, Germany, Vienna, Austria, 679--704. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24"},{"volume-title":"On the Security of Public Key Protocols. In Symposium on Foundations of Computer Science (FOCS).","author":"Dolev D.","key":"e_1_3_2_2_45_1","unstructured":"D. Dolev and A.C. Yao . 1981 . On the Security of Public Key Protocols. In Symposium on Foundations of Computer Science (FOCS). D. Dolev and A.C. Yao. 1981. On the Security of Public Key Protocols. In Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_2_46_1","volume-title":"A construction of a cipher from a single pseudorandom permutation. Journal of cryptology","author":"Even Shimon","year":"1997","unstructured":"Shimon Even and Yishay Mansour . 1997. A construction of a cipher from a single pseudorandom permutation. Journal of cryptology ( 1997 ). Shimon Even and Yishay Mansour. 1997. A construction of a cipher from a single pseudorandom permutation. Journal of cryptology (1997)."},{"key":"e_1_3_2_2_47_1","unstructured":"H. Feistel. 1973. Cryptography and Computer Privacy. Scientific American. https:\/\/books.google.es\/books?id=Y0BenQEACAAJ  H. Feistel. 1973. Cryptography and Computer Privacy. Scientific American. https:\/\/books.google.es\/books?id=Y0BenQEACAAJ"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_16"},{"key":"e_1_3_2_2_49_1","volume-title":"Malozemoff","author":"Hoang Viet Tung","year":"2015","unstructured":"Viet Tung Hoang , Jonathan Katz , and Alex J . Malozemoff . 2015 . Automated Analysis and Synthesis of Authenticated Encryption Schemes. In ACM CCS 2015: 22nd Conference on Computer and Communications Security,, Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM Press , Denver, CO, USA, 84--95. https:\/\/doi.org\/10.1145\/2810103.2813636 10.1145\/2810103.2813636 Viet Tung Hoang, Jonathan Katz, and Alex J. Malozemoff. 2015. Automated Analysis and Synthesis of Authenticated Encryption Schemes. In ACM CCS 2015: 22nd Conference on Computer and Communications Security,, Indrajit Ray, Ninghui Li, and Christopher Kruegel (Eds.). ACM Press, Denver, CO, USA, 84--95. https:\/\/doi.org\/10.1145\/2810103.2813636"},{"key":"e_1_3_2_2_50_1","volume-title":"Robin K\u00fc nzler, and Stefano Tessaro","author":"Holenstein Thomas","year":"2010","unstructured":"Thomas Holenstein , Robin K\u00fc nzler, and Stefano Tessaro . 2010 . Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited. CoRR , Vol. abs\/ 1011 .1264 (2010). Thomas Holenstein, Robin K\u00fc nzler, and Stefano Tessaro. 2010. Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited. CoRR, Vol. abs\/1011.1264 (2010)."},{"key":"e_1_3_2_2_51_1","volume-title":"An extensive formal analysis of multi-factor authentication protocols. ACM Transactions on Privacy and Security (TOPS)","author":"Jacomme Charlie","year":"2021","unstructured":"Charlie Jacomme and Steve Kremer . 2021. An extensive formal analysis of multi-factor authentication protocols. ACM Transactions on Privacy and Security (TOPS) ( 2021 ). Charlie Jacomme and Steve Kremer. 2021. An extensive formal analysis of multi-factor authentication protocols. ACM Transactions on Privacy and Security (TOPS) (2021)."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_12"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74835-9_40"},{"key":"e_1_3_2_2_54_1","volume-title":"Part I (Lecture Notes in Computer Science","volume":"463","author":"Lampe Rodolphe","year":"2013","unstructured":"Rodolphe Lampe and Yannick Seurin . 2013 . How to Construct an Ideal Cipher from a Small Set of Public Permutations. In Advances in Cryptology -- ASIACRYPT 2013 , Part I (Lecture Notes in Computer Science , Vol. 8269),, Kazue Sako and Palash Sarkar (Eds.). Springer, Heidelberg, Germany, Bengalore, India, 444-- 463 . https:\/\/doi.org\/10.1007\/978-3-642-42033-7_23 10.1007\/978-3-642-42033-7_23 Rodolphe Lampe and Yannick Seurin. 2013. How to Construct an Ideal Cipher from a Small Set of Public Permutations. In Advances in Cryptology -- ASIACRYPT 2013, Part I (Lecture Notes in Computer Science, Vol. 8269),, Kazue Sako and Palash Sarkar (Eds.). Springer, Heidelberg, Germany, Bengalore, India, 444--463. https:\/\/doi.org\/10.1007\/978-3-642-42033-7_23"},{"volume-title":"Advances in Cryptology -- ASIACRYPT 2012 (Lecture Notes in Computer Science","author":"Leurent Ga\u00ebtan","key":"e_1_3_2_2_55_1","unstructured":"Ga\u00ebtan Leurent . 2012. Analysis of Differential Attacks in ARX Constructions . In Advances in Cryptology -- ASIACRYPT 2012 (Lecture Notes in Computer Science , Vol. 7658),, Xiaoyun Wang and Kazue Sako (Eds.). Springer, Heidelberg, Germany, Beijing, China, 226-- 243 . https:\/\/doi.org\/10.1007\/978-3-642-34961-4_15 10.1007\/978-3-642-34961-4_15 Ga\u00ebtan Leurent. 2012. Analysis of Differential Attacks in ARX Constructions. In Advances in Cryptology -- ASIACRYPT 2012 (Lecture Notes in Computer Science, Vol. 7658),, Xiaoyun Wang and Kazue Sako (Eds.). Springer, Heidelberg, Germany, Beijing, China, 226--243. https:\/\/doi.org\/10.1007\/978-3-642-34961-4_15"},{"key":"e_1_3_2_2_56_1","volume-title":"Green","author":"Malozemoff Alex J.","year":"2014","unstructured":"Alex J. Malozemoff , Jonathan Katz , and Matthew D . Green . 2014 . Automated Analysis and Synthesis of Block-Cipher Modes of Operation. In CSF 2014: IEEE 27st Computer Security Foundations Symposium,, Anupam Datta and Cedric Fournet (Eds.). IEEE Computer Society Press , Vienna, Austria, 140--152. https:\/\/doi.org\/10.1109\/CSF.2014.18 10.1109\/CSF.2014.18 Alex J. Malozemoff, Jonathan Katz, and Matthew D. Green. 2014. Automated Analysis and Synthesis of Block-Cipher Modes of Operation. In CSF 2014: IEEE 27st Computer Security Foundations Symposium,, Anupam Datta and Cedric Fournet (Eds.). IEEE Computer Society Press, Vienna, Austria, 140--152. https:\/\/doi.org\/10.1109\/CSF.2014.18"},{"key":"e_1_3_2_2_57_1","volume-title":"10th IMA International Conference on Cryptography and Coding (Lecture Notes in Computer Science","volume":"12","author":"Maurer Ueli M.","year":"2005","unstructured":"Ueli M. Maurer . 2005 . Abstract Models of Computation in Cryptography (Invited Paper) . In 10th IMA International Conference on Cryptography and Coding (Lecture Notes in Computer Science , Vol. 3796),, Nigel P. Smart (Ed.). Springer, Heidelberg, Germany, Cirencester, UK, 1-- 12 . Ueli M. Maurer. 2005. Abstract Models of Computation in Cryptography (Invited Paper). In 10th IMA International Conference on Cryptography and Coding (Lecture Notes in Computer Science, Vol. 3796),, Nigel P. Smart (Ed.). Springer, Heidelberg, Germany, Cirencester, UK, 1--12."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02113297"},{"volume-title":"Advances in Cryptology -- CRYPTO'93 (Lecture Notes in Computer Science","author":"Preneel Bart","key":"e_1_3_2_2_61_1","unstructured":"Bart Preneel , Ren\u00e9 Govaerts , and Joos Vandewalle . 1994. Hash Functions Based on Block Ciphers: A Synthetic Approach . In Advances in Cryptology -- CRYPTO'93 (Lecture Notes in Computer Science , Vol. 773), Douglas R. Stinson (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 368-- 378 . https:\/\/doi.org\/10.1007\/3-540-48329-2_31 10.1007\/3-540-48329-2_31 Bart Preneel, Ren\u00e9 Govaerts, and Joos Vandewalle. 1994. Hash Functions Based on Block Ciphers: A Synthetic Approach. In Advances in Cryptology -- CRYPTO'93 (Lecture Notes in Computer Science, Vol. 773), Douglas R. Stinson (Ed.). Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 368--378. https:\/\/doi.org\/10.1007\/3-540-48329-2_31"},{"key":"e_1_3_2_2_62_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science","author":"Ristenpart Thomas","year":"2046","unstructured":"Thomas Ristenpart , Hovav Shacham , and Thomas Shrimpton . 2011. Careful with Composition: Limitations of the Indifferentiability Framework . In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science , Vol. 6632),, Kenneth G. Paterson (Ed.). Springer, Heidelberg, Germany, Tallinn, Estonia, 487-- 506 . https:\/\/doi.org\/10.1007\/978-3-642- 2046 5-4_27 10.1007\/978-3-642-20465-4_27 Thomas Ristenpart, Hovav Shacham, and Thomas Shrimpton. 2011. Careful with Composition: Limitations of the Indifferentiability Framework. In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science, Vol. 6632),, Kenneth G. Paterson (Ed.). Springer, Heidelberg, Germany, Tallinn, Estonia, 487--506. https:\/\/doi.org\/10.1007\/978-3-642-20465-4_27"},{"key":"e_1_3_2_2_63_1","volume-title":"Part II (Lecture Notes in Computer Science","volume":"34","author":"Shi Danping","year":"2018","unstructured":"Danping Shi , Siwei Sun , Patrick Derbez , Yosuke Todo , Bing Sun , and Lei Hu . 2018 . Programming the Demirci-Selc cuk Meet-in-the-Middle Attack with Constraints. In Advances in Cryptology -- ASIACRYPT 2018 , Part II (Lecture Notes in Computer Science , Vol. 11273), Thomas Peyrin and Steven Galbraith (Eds.). Springer, Heidelberg, Germany, Brisbane, Queensland, Australia, 3-- 34 . https:\/\/doi.org\/10.1007\/978-3-030-03329-3_1 10.1007\/978-3-030-03329-3_1 Danping Shi, Siwei Sun, Patrick Derbez, Yosuke Todo, Bing Sun, and Lei Hu. 2018. Programming the Demirci-Selc cuk Meet-in-the-Middle Attack with Constraints. In Advances in Cryptology -- ASIACRYPT 2018, Part II (Lecture Notes in Computer Science, Vol. 11273), Thomas Peyrin and Steven Galbraith (Eds.). Springer, Heidelberg, Germany, Brisbane, Queensland, Australia, 3--34. https:\/\/doi.org\/10.1007\/978-3-030-03329-3_1"},{"volume-title":"Advances in Cryptology -- EUROCRYPT'97 (Lecture Notes in Computer Science","author":"Shoup Victor","key":"e_1_3_2_2_64_1","unstructured":"Victor Shoup . 1997. Lower Bounds for Discrete Logarithms and Related Problems . In Advances in Cryptology -- EUROCRYPT'97 (Lecture Notes in Computer Science , Vol. 1233), Walter Fumy (Ed.). Springer, Heidelberg, Germany, Konstanz, Germany, 256-- 266 . https:\/\/doi.org\/10.1007\/3-540-69053-0_18 10.1007\/3-540-69053-0_18 Victor Shoup. 1997. Lower Bounds for Discrete Logarithms and Related Problems. In Advances in Cryptology -- EUROCRYPT'97 (Lecture Notes in Computer Science, Vol. 1233), Walter Fumy (Ed.). Springer, Heidelberg, Germany, Konstanz, Germany, 256--266. https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"e_1_3_2_2_65_1","unstructured":"Dominique Unruh. 2010. The impossibility of computationally sound XOR. IACR Cryptol. ePrint Arch. (2010).  Dominique Unruh. 2010. The impossibility of computationally sound XOR. IACR Cryptol. ePrint Arch. (2010)."}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Nagasaki Japan","acronym":"ASIA CCS '22"},"container-title":["Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3497759","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3497759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:29Z","timestamp":1750193309000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3497759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":63,"alternative-id":["10.1145\/3488932.3497759","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3497759","relation":{},"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"2022-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}