Ideal lattice

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

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

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

A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù, Eleonora Testa, Heinz Riener

Logic synthesis is a fundamental step in the realization of modern integrated circuits. It has traditionally been employed for the optimization of CMOS-based designs, as well as for emerging technologies and quantum computing. Recently, it found applicatio ...

IEEE2020

Timed-Release Encryption With Master Time Bound Key

Serge Vaudenay, Gwangbae Choi

Timed-release encryption allows senders to send a message to a receiver which cannot decrypt until a server releases a time bound key at the release time. The release time usually supposed to be known to the receiver, the ciphertext therefore cannot be dec ...

2019

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

UnLynx: A Decentralized System for Privacy-Conscious Data Sharing

Jean-Pierre Hubaux, Bryan Alexander Ford, David Jules Froelicher, Jean Louis Raisaro, Zhicong Huang, Christian Vincent Mouchet, Joao André Gomes de Sá e Sousa, Patricia Egger

Current solutions for privacy-preserving data sharing among multiple parties either depend on a centralized authority that must be trusted and provides only weakest-link security (e.g., the entity that manages private/secret cryptographic keys), or leverag ...

De Gruyter2017

Piezoelectric softening by Nb substitution in (Ba,Pb)ZrO

Dragan Damjanovic, Nava Setter, Nicola Marzari, Alberto Biancoli, David Bahati

Donor doping is commonly applied for softening of the piezoelectric and dielectric properties and facilitation of polarization switching in the ubiquitous Pb(Zr,Ti)O-3 [PZT] ceramics. The origin of the donor-dopant effects is not entirely clear. (Pb,Ba)ZrO ...

Wiley-Blackwell2017

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

Computational Aspects of Jacobians of Hyperelliptic Curves

Alina Dudeanu

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...

EPFL2016

Page 2 sur 2