265 citations
- Institut national de recherche en sciences et technologies du numériqueFR22 papers
- Geometric (India)IN8 papers
- Institut de Mathématiques de BordeauxFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de l'université de BordeauxFR7 papers
- Centre Inria de l'Université de LorraineFR5 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
- Université de LorraineFR5 papers
- Graz University of TechnologyAT4 papers
- Nantes UniversitéFR4 papers
- École PolytechniqueFR3 papers
10 papers · 1 filter
Efficient passive membership inference attack in federated learning
Oualid Zari, Chuan Xu, Giovanni Neglia
In cross-device federated learning (FL) setting, clients such as mobiles cooperate with the server to train a global machine learning model, while maintaining their data locally. H…
E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning
Sorin Stratulat
Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponenti…
Alethe: Towards a Generic SMT Proof Format (extended abstract)
Hans-Jörg Schurr, Mathias Fleury, Haniel Barbosa +1
The first iteration of the proof format used by the SMT solver veriT was presented ten years ago at the first PxTP workshop. Since then the format has matured. veriT proofs are use…
Trust Me If You Can: Trusted Transformation Between (JSON) Schemas to Support Global Authentication of Education Credentials
Stefan More, Peter Grassberger, Felix Hörandner +2
Recruiters and institutions around the world struggle with the verification of diplomas issued in a diverse and global education setting. Firstly, it is a nontrivial problem to ide…
A Benchmarks Library for Extended Parametric Timed Automata
Étienne André, Dylan Marinho, Jaco van de Pol
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. In order to test the efficiency of new…
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Damien Jamet, Pierre Popoli, Thomas Stoll
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation me…