Towards Efficient LPN-Based Symmetric Encryption

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The excitation of toroidicity-induced Alfven eigenmodes (TAEs) using prescribed external electromagnetic perturbations (hereafter 'antenna') acting on a confined toroidal plasma, as well as its nonlinear couplings to other modes in the system, is studied. ...

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 ...

Field-programmable gate arrays (FPGAs) combine hardware reconfigurability with a high degree of parallelism. Consequently, FPGAs offer performance gains and power savings for many applications. A recent trend has been to leverage the hardware versatility o ...

We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...

To mitigate state exposure threats to long-lived instant messaging sessions, ratcheting was introduced, which is used in practice in protocols like Signal. However, existing ratcheting protocols generally come with a high cost. Recently, Caforio et al. pro ...

Several works published over the last two decades have shown for a stylized set-up with homogeneous users that metering-based priority (MBP) schemes may generate Pareto improving departure time adjustments similar to those induced by congestion pricing, bu ...

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

Public knowledge about the structure of a cryptographic system is a standard assumption in the literature and algorithms are expected to guarantee security in a setting where only the encryption key is kept secret. Nevertheless, undisclosed proprietary cry ...

The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learning with Errors (RLWE), introducing efficiency improvements with respect to the RLWE counterpart thanks to its multivariate structure. Nevertheless, the rec ...

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 ...

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 ...

Most communication systems (e.g., e-mails, instant messengers, VPNs) use encryption to prevent third parties from learning sensitive information. However, encrypted communications protect the contents but often leak metadata: the amount of data sent and th ...

The US National Institute of Standards and Technology (NIST) recently announced the public-key cryptosystems (PKC) that have passed to the second round of the post-quantum standardization process. Most of these PKC come in two flavours: a weak IND-CPA vers ...

Towards Efficient LPN-Based Symmetric Encryption

Chat with Graph Search

Linear and nonlinear excitation of TAE modes by external electromagnetic perturbations using ORB5

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

DFAulted: Analyzing and Exploiting CPU Software Faults Caused by FPGA-Driven Undervolting Attacks

Stochastic distributed learning with gradient quantization and double-variance reduction

Optimal Symmetric Ratcheting for Secure Communication

Impacts of Metering-Based Dynamic Priority Schemes

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography

Efficient Bootstrapping for Approximate Homomorphic Encryption with Non-sparse Keys

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Analyzing and Protecting Communication Metadata

Classical Misuse Attacks on NIST Round 2 PQC: The Power of Rank-Based Schemes