Évènements

Public-Key Pseudorandom Correlation Functions (PK-PCF) are functions that generate pseudorandom correlated strings. These correlations can then be used to speed up secure computation protocols. Recent works have made significant progress building PK-PCFs using group-based assumptions, however, these assumptions do not hold up against quantum attackers. Much less is known about PK-PCFs in the post-quantum regime. … Continue reading Séminaire Algorithmique : « Post-Quantum Public-Key Pseudorandom Correlation Functions for Oblivious Transfer », Mahshid Riahinia (ENS Paris et IRIF, Univ. Paris Cité)

Satisfiability Modulo Theories (SMT) solvers combine decision procedures for various theories into a homogeneous automated reasoning framework. They are an indispensable tools to solve formal verification and decision problems. To validate the SMT solver’s responses we can use proof certificates. However, a major challenge is that different theories and decision procedures use different proof calculi. … Continue reading Séminaire Algorithmique : « Eunoia: A Framework for SMT Proof Calculi », Hans-Jörg Schurr (Univ. of Iowa, USA)

Modern cell biology generates a treasure trove of experimental data, allowing us to measure many biochemical processes in individual cells with single-molecule resolution. However, applying this data to generate explainable predictions is often challenging due to the high number of entities, interactions, and environmental factors in question. Systems biology utilizes logic-based explainable models (e.g., Boolean … Continue reading Séminaire Algorithmique : « Data-driven design of logic-based models of biological processes », Samuel Pastva (Masaryk Univ. Brno, Tchéquie)

Les frameworks de preuves “Engager-et-prouver” sont une généralisation des protocoles à divulgation nulle de connaissances. Ils permettent, en plus de prouver la connaissance d’un élément secret à un tiers, de prouver certaines propriétés et relations. Par exemple, qu’un vecteur est de petite norme ou encore qu’il est solution d’une relation quadratique publique. Un de ces … Continue reading Séminaire Algorithmique : « Rejection-free framework of Zero-Knowledge Proof », Antoine Douteau (GREYC, Caen)

Résumé à venir.

Given a graph G, a dominating set of G is a subset of vertices S such that every vertex not in S is adjacent to at least one vertex in S; that is, NG = V(G). While classical studies focus on finding the smallest dominating set of G, our focus shifts to finding the maximum … Continue reading Séminaire Algorithmique : « Packing many dominating sets in a graph », François Pirot (LISN, Univ. Paris-Saclay)

Résumé à venir.