Concept
Hypothèse calculatoire
Publications associées (53)
Extractable Witness Encryption for the Homogeneous Linear Equations Problem
Serge Vaudenay, Bénédikt Minh Dang Tran
Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...
Springer2023Public-Key Encryption with Quantum Keys
In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can ...
Cham2023Enforcing Privacy in Distributed Learning With Performance Guarantees
Ali H. Sayed, Stefan Vlaski, Elsa Rizk
We study the privatization of distributed learning and optimization strategies. We focus on differential privacy schemes and study their effect on performance. We show that the popular additive random perturbation scheme degrades performance because it is ...
Piscataway2023Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum hardness ...
IEEE COMPUTER SOC2022Bootstrapping for Approximate Homomorphic Encryption with Negligible Failure-Probability by Using Sparse-Secret Encapsulation
Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Jean-Philippe Léonard Bossuat
Bootstrapping parameters for the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17), are usually instantiated using sparse secrets to be efficient. However, using sparse secrets constrains the range of practical parameters withi ...
SPRINGER INTERNATIONAL PUBLISHING AG2022The double exponential runtime is tight for 2-stage stochastic ILPs
Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota
We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...
SPRINGER HEIDELBERG2022Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE
Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms.This ...
EPFL2022Privacy and Integrity Preserving Computations with CRISP
Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Sylvain Chatel, Apostolos Pyrgelis
In the digital era, users share their personal data with service providers to obtain some utility, e.g., access to high-quality services. Yet, the induced information flows raise privacy and integrity concerns. Consequently, cautious users may want to prot ...
USENIX ASSOC2021Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys
Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Jean-Philippe Léonard Bossuat, Christian Vincent Mouchet
We present a bootstrapping procedure for the full-RNS variant of the approximate homomorphic-encryption scheme of Cheon et al., CKKS (Asiacrypt 17, SAC 18). Compared to the previously proposed procedures (Eurocrypt 18 & 19, CT-RSA 20), our bootstrapping pr ...
SPRINGER INTERNATIONAL PUBLISHING AG2021Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation
The Ring Learning with Errors (RLWE) problem has become one of the most widely used cryptographic assumptions for the construction of modern cryptographic primitives. Most of these solutions make use of power-of-two cyclotomic rings mainly due to its simpl ...
IEEE2020