Accepted Papers

• Beyond the Finite Variant Property: Extending Symbolic Diffie-Hellman Group Models
  Sofia Giampietro, Ralf Sasse, David Basin (ETH Zürich)
• Optimizing Differential Privacy in Federated Analytics under Known Input Distributions
  Ferran Alborch Escobar (Orange Innovation); Andreas Athanasiou (TU Delft); Pascal Reisert (University of Stuttgart)
• Are ideal functionalities really ideal?
  Myrto Arapinis (The University of Edinburgh); Véronique Cortier (Université de Lorraine, CNRS, Inria, LORIA); Hubert de Groote (ENS Paris-Saclay, Université Paris-Saclay); Charlie Jacomme, Steve Kremer (Université de Lorraine, Inria, CNRS, LORIA)
• Interpreting Differential Privacy in Terms of Disclosure Risk
  Zeki Kazan (Duke University); Sagar Sharma, Wanrong Zhang, Bo Jiang, Qiang Yan (TikTok Inc)
• Bayesian Advantage of Re-Identification Attack in the Shuffle Model
  Pengcheng Su, Haibo Cheng, Ping Wang (Peking University)
• Privacy Mechanism Design based on Empirical Distributions
  Leonhard Grosse (KTH Royal Institute of Technology); Sara Saeidian (KTH Royal Institute of Technology and Inria Saclay); Mikael Skoglund, Tobias J. Oechtering (KTH Royal Institute of Technology)
• A new measure for dynamic leakage based on quantitative information flow
  Luigi D. C. Soares (UFMG and Macquarie University); Mário S. Alvim (UFMG); Natasha Fernandes (Macquarie University)
• A unified compositional view of attack tree metrics
  Benedikt Peterseim, Milan Lopuhaä-Zwakenberg (University of Twente)
• Dolev-Yao Information Flow
  Simon Tobias Lund (Technical University of Denmark); Sebastian Mödersheim (DTU)
• On the design of Survivable Distributed Passwordless Authentication and Single Sign-On
  Luca Ferretti, Federico Magnanini, Mauro Andreolini, Mattia Trabucco (University of Modena and Reggio Emilia); Michele Colajanni (University of Bologna)
• Efficient Homomorphic Encryption-Based CNN Batch Inference Using Channel-Interleaved Packing with Small Rotation Key Set
  Haun-Chih Wang, Ja-Ling Wu (National Taiwan University)
• Towards Strong Certified Defense with Universal Asymmetric Randomization
  Hanbin Hong (University of Connecticut); Ali Payani, Ashish Kundu (Cisco); Binghui Wang (Illinois Institute of Technology); Yuan Hong (University of Connecticut)
• LAP$_2$: Revisiting Laplace DP-SGD for High Dimensions via Majorization Theory
  Meisam Mohammady (Iowa State University); Qin Yang (University of Connecticut); Nicholas Stout, Ayesha Samreen (Iowa State University); Han Wang (University of Kansas); Christopher J Quinn (Iowa State University); Yuan Hong (University of Connecticut)
• Formalizing Privacy in Decentralized Identity: A Provably Secure Framework with Minimal Disclosure
  Yu Zhang (Northwestern Polytechnical University); Zongbin Wang (Beijing Infosec Technologies Co., Ltd.)
• Tamarin Unchained: Handling User-Defined AC Operators
  Jannik Dreier, Elise Klein, Steve Kremer (Université de Lorraine, CNRS, Inria, LORIA)
• Incremental Fingerprinting in an Open World
  Loes Kruger (Radboud University); Paul Kobialka, Andrea Pferscher, Einar Broch Johnsen (University of Oslo); Sebastian Junges, Jurriaan Rot (Radboud University)
• Mind the Gap – Connecting Protocol Representations in Squirrel
  David Baelde, Stéphanie Delaune (Univ Rennes, CNRS, IRISA); Julia Gabet (unaffiliated); Clément Hérouard (Univ Rennes, CNRS, IRISA)
• Computationally Sound Symbolic Cryptography in Lean
  Stefan Dziembowski (University of Warsaw and IDEAS Institute); Grzegorz Fabiański (University of Warsaw); Daniele Micciancio (UCSD); Rafał Stefański (University of Warsaw)
• On the necessity of pre-agreed secrets for thwarting last-minute coercion: vulnerabilities and lessons from the Loki e-voting protocol
  Jingxin Qiao, Myrto Arapinis (The University of Edinburgh); Thomas Zacharias (University of Glasgow)
• DPEI: Privacy Budget Savings for Edge Information Protection in Synthetic Graph Publishing
  Ruizhong Du, Zizhan Wei, Mingyue Li (Hebei University)
• A Composable Game-Theoretic Framework for Blockchains
  Pim Keer, Fabian Regen, Georg Fuchsbauer, Matteo Maffei (TU Wien); Zeta Avarikioti (TU Wien & Common Prefix)
• Mechanizing Nested Hybrid Arguments
  Markus Krabbe Larsen, Carsten Schürmann (IT University of Copenhagen)
• NTRU with Hints: Secret Key Recovery under Partial Leakage on NTRU-based Signatures
  Honglin Shao, Yuejun Liu (School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China); Mingyao Shao (Institute of Information Engineering, Chinese Academy of Sciences; the State Key Laboratory of Cyberspace Security Defense; and the School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China); Wei Cheng (School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China; and also with LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau 91120, France); Yongbin Zhou (School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China; the Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100085, China)
• Partial Cast Calculus for Gradual Information Security
  Zechi Shen, Zhiwu Xu (Shenzhen University); Shengchao Qin (Xidian University); Zhong Ming (Shenzhen University)
• Verifying and Monitoring the Lightweight Directory Access Protocol (LDAP)
  Ndzebelai Precious Zemoh (University of Bamenda); Robert Künnemann (CISPA Helmholtz Center for Information Security)
• Active Cyber Defense Strategy through Multi-Agent Systems Verification
  Gabriel Ballot (SEIDO Lab, EDF R&D and LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France); Etienne Borde (University of Canterbury); Vadim Malvone, Jean Leneutre (LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France)
• Zero-Knowledge Proof of Progress: Secure Multi-Phase Capture-the-Flag Competitions
  Salam Khanji, Behzad Abdolmaleki, John Clark, Aryan Pasikhani (University of Sheffield)
• Setup Protocols for Sender Anonymity
  Tian Huang (Tufts University); Jiatai Zhang (Rensselaer Polytechnic Institute); Megumi Ando (Tufts University)
• Formal Verification of Probing Security via Conditional Independence
  Satoshi Kura, Katsuyuki Takashima (Waseda University)
• Simultaneously Proving Privacy and Verifiability: A ProVerif Framework for Internet Voting
  Vincent Cheval (University of Oxford); Veronique Cortier (CNRS Nancy); Alexandre Debant, Florian Moser (INRIA Nancy)
• Information Leakage Envelopes
  Sara Saeidian (KTH Royal Institute of Technology and Inria); Carlos Pinzón, Catuscia Palamidessi (Inria and École Polytechnique)
• Triosecuris: Formally Verified Protection Against Speculative Control-Flow Hijacking
  Jonathan Baumann, Yonghyun Kim (MPI-SP); Yan Farba (MPI-SP and Ruhr University Bochum); Catalin Hritcu (MPI-SP); Julay Leatherman-Brooks (MPI-SP and Portland State University)
• Beyond Blockchain Ballots: UC-Secure Layer-2 Voting and Governance
  Raghav Bhaskar (None); Pooya Farshim, Matthias Fitzi (Input Output); Aggelos Kiayias (University of Edinburgh and Input Output)
• Interactive Proofs in Higher-Order Logic with Errors and Application to Concrete Cryptography
  Caroline Fontaine (Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles); Adrien Koutsos (Inria); Guillaume Scerri, Théo Vignon (Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles)
• Cryptographic Choreographies
  Sebastian Mödersheim (DTU); Simon Tobias Lund (Technical University of Denmark); Marco Carbone, Rosario Giustolisi, Alessandro Bruni (ITU)
• Self-Guarding Arbitrary Cryptographic Primitives and 2PC Protocols
  Daniele Friolo, Andrea Reale, Daniele Venturi (Sapienza University of Rome)
• BlindReview: Anonymous and End-to-End Verifiable Peer Review
  Xavier Bultel (INSA Centre Val de Loire, Inria); Ashley Fraser (Lancaster University); Elizabeth A. Quaglia (Royal Holloway, University of London)
• Which attacks are most critical? Risk prioritization via attack tree importance measures
  Reza Soltani, Milan Lopuhaä-Zwakenberg, Mariëlle Stoelinga (University of Twente)
• Forking Lemma in EasyCrypt
  Jakub Janků (Masaryk University); Denis Firsov (Tallinn University of Technology, Input Output)
• Beyond Epsilon: A Principled QIF Framework for Local Differential Privacy
  Ramon G. Gonze (Institut Polytechnique de Paris / Universidade Federal de Minas Gerais); Natasha Fernandes (Macquarie University); Heber H. Arcolezi (ETS Montréal); Catuscia Palamidessi, Nataliia Bielova (Inria)
• Revisiting Beimel-Weinreb Weighted Threshold Secret Sharing Schemes
  Oriol Farràs, Miquel Guiot (Universitat Rovira i Virgili)
• Time-Lock Puzzles with Preprocessing: an Instantiation from Average-Case Hardness Assumptions on Graphs and Lattices
  Raz Rosie (Lombard International (part of Utmost Group))