Barry Van Leeuwen

Paper 2023/1470 , KU Leuven , University of Luxembourg , KU Leuven Zero-knowledge proof or argument systems for generic NP statements (such as circuit satisfiability) have typically been instantiated with cryptographic commitment schemes; this implies that the security of the proof system (e.g., computational or statistical) depends on that of the chosen commitment scheme.

Paper 2023/014 Amortized Bootstrapping Revisited: Simpler, Asymptotically-faster, Implemented , University of Campinas, Brazil , imec-COSIC, KU Leuven, Leuven, Belgium , imec-COSIC, KU Leuven, Leuven, Belgium Abstract Micciancio and Sorrel (ICALP 2018) proposed a bootstrapping algorithm that can refresh many messages at once with sublinearly many homomorphic operations per message.

Paper 2021/841 MPC for $Q_2$ Access Structures over Rings and Fields Abstract We examine Multi-Party Computation protocols in the active-security-with-abort setting for $Q_2$ access structures over small and large finite fields $F_p$ and over rings $Z_{p^k}$. We give general protocols which work for any $Q_2$ access structure which is realised by a multiplicative Extended Span Program. We generalize a number of techniques and protocols from various papers and compare the different methodologies.