Publications related to Post-quantum cryptography

Multiquadratic 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

Synthesis of Flexible Accelerators for Early Adoption of Ring-LWE Post-quantum Cryptography

Francesco Regazzoni, Subhadeep Banik, Hamid Nejatollahi

The advent of the quantum computer makes current public-key infrastructure insecure. Cryptography community is addressing this problem by designing, efficiently implementing, and evaluating novel public-key algorithms capable of withstanding quantum comput ...

ASSOC COMPUTING MACHINERY2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption

Juan Ramón Troncoso-Pastoriza

Background Privacy-preserving computations on genomic data, and more generally on medical data, is a critical path technology for innovative, life-saving research to positively and equally impact the global population. It enables medical research algorithm ...

2020

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

Blagovesta Hristova Kostova, Wei Dai

Fully-Homomorphic Encryption (FHE) offers powerful capabilities by enabling secure offloading of both storage and computation, and recent innovations in schemes and implementations have made it all the more attractive. At the same time, FHE is notoriously ...

ASSOC COMPUTING MACHINERY2020

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

Serge Vaudenay, Loïs Evan Huguenin-Dumittan

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

Springer, Cham2020

Byzantine machine learning

Rachid Guerraoui, Mahsa Taziki, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault

The present invention concerns computer-implemented methods for training a machine learning model using Stochastic Gradient Descent, SGD. In one embodiment, the method is performed by a first computer in a distributed computing environment and comprises pe ...

2020

Protecting Privacy and Security of Genomic Data in i2b2 with Homomorphic Encryption and Differential Privacy

Jean-Pierre Hubaux, Jean Louis Raisaro, Gwangbae Choi, Nathalie Jacquemont, Nicolas Rosat

Re-use of patients’ health records can provide tremendous benefits for clinical research. Yet, when researchers need to access sensitive/identifying data, such as genomic data, in order to compile cohorts of well-characterized patients for specific studies ...

IEEE2018

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

Post-quantum cryptography

Graph Chatbot

Chat with Graph Search

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

Synthesis of Flexible Accelerators for Early Adoption of Ring-LWE Post-quantum Cryptography

New Results in Integer and Lattice Programming

Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

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

Byzantine machine learning

Protecting Privacy and Security of Genomic Data in i2b2 with Homomorphic Encryption and Differential Privacy

On compact representations of Voronoi cells of lattices

Short Stickelberger Class Relations and Application to Ideal-SVP

Privacy-preserving semi-parallel logistic regression training with fully homomorphic encryption

New Results in Integer and Lattice Programming

Short Stickelberger Class Relations and Application to Ideal-SVP

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

Synthesis of Flexible Accelerators for Early Adoption of Ring-LWE Post-quantum Cryptography

EVA: An Encrypted Vector Arithmetic Language and Compiler for Efficient Homomorphic Computation

On compact representations of Voronoi cells of lattices

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

Byzantine machine learning

Protecting Privacy and Security of Genomic Data in i2b2 with Homomorphic Encryption and Differential Privacy