Concept

Computational hardness assumption

Related publications (53)

TFHE: Fast Fully Homomorphic Encryption Over the Torus

This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary ...

SPRINGER2020

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

On the Security of Two-Round Multi-Signatures

Bryan Alexander Ford, Manu Drijvers

A multi-signature scheme allows a group of signers to collaboratively sign a message, creating a single signature that convinces a verifier that every individual signer approved the message. The increased interest in technologies to decentralize trust has ...

IEEE COMPUTER SOC2019

Heterogeneous Target Assignment to Robotic Fiber Positioner Systems

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian

The target assignment methods applied to robotic fiber positioners are only applicable to homogeneous sets of targets to be observed. However, different batches of robotic fiber positioners available at the focal plane of a telescope can be simultaneously ...

IEEE2019

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

Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward

Michael Christoph Gastpar, Saeid Sahraei

A particular instance of the shortest vector problem (SVP) appears in the context of compute-and-forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order O(nψlog(nψ)) , where ψ=sqrt(P ||h||^2+1) ...

Institute of Electrical and Electronics Engineers2017

Avalanches in dry and saturated disordered media at fracture in shear and mixed mode scenarios

Jean-François Molinari, Enrico Milanese, Okan Yilmaz

We investigate shear and mixed mode fracture scenarios in inhomogeneous dry and fully saturated porous media with a 2D central force lattice model. For the fully saturated case we adopt the extended Biot's theory. The bars of the lattice break only under t ...

Elsevier2017

Improved hardness results for unique shortest vector problem

Divesh Aggarwal

The unique shortest vector problem on a rational lattice is the problem of finding the shortest non-zero vector under the promise that it is unique (up to multiplication by -1). We give several incremental improvements on the known hardness of the unique s ...

Elsevier2016

Signature Schemes Secure Against Hard-to-Invert Leakage

Sebastian Faust

Side-channel attacks allow the adversary to gain partial knowledge of the secret key when cryptographic protocols are implemented in real-world hardware. The goal of leakage resilient cryptography is to design cryptosystems that withstand such attacks. In ...

Springer2016

First-principles Hubbard U approach for small molecule binding in metal-organic frameworks

Berend Smit, Matteo Cococcioni

We apply first-principles approaches with Hubbard U corrections for calculation of small molecule binding energetics to open-shell transition metal atoms in metal-organic frameworks (MOFs). Using density functional theory with van derWaals dispersion-corre ...

American Institute of Physics2016

Graph Chatbot

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.