Publication

CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes

Related publications (19)

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.

Recovering the 3D shape of a nonrigid surface from a single viewpoint is known to be both ambiguous and challenging. Resolving the ambiguities typically requires prior knowledge about the most likely deformations that the surface may undergo. It often take ...

2011

, ,

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer2010

Algebraic Structures of B-series

Gilles Vilmart

B-series are a fundamental tool in practical and theoretical aspects of numerical integrators for ordinary differential equations. A composition law for B-series permits an elegant derivation of order conditions, and a substitution law gives much insight i ...

Springer-Verlag2010

This work deals with the study of projective Mackey functors. Mackey functors are algebraic structures with operations which behave like induction, restriction and conjugation in group representation theory. These objects have properties which generalize m ...

EPFL2008

This work is dedicated to developing algebraic methods for channel coding. Its goal is to show that in different contexts, namely single-antenna Rayleigh fading channels, coherent and non-coherent MIMO channels, algebraic techniques can provide useful tool ...

EPFL2005

Design Validations for Discrete Logarithm Based Signature Schemes

Serge Vaudenay

A number of signature schemes and standards have been recently designed, based on the discrete logarithm problem. Examples of standards are the DSA and the KCDSA. Very few formal design/security validations have already been conducted for both the KCDSA an ...

2000

We quantitatively study the effect of growth-induced reduction of long range structural order on the superconducting transition in epitaxial YBa2Cu3O6.9 films. The corresponding reduction of structural coherence length r(c) is determined from the width of ...

1999

Deciding properties of number fields without factoring

Mohammad Amin Shokrollahi

The polynomial time algorithm of Lenstra, Lenstra, and Lovász [15] for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the p ...

1997

Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers

Arjen Lenstra

It is shown that the binary expansions of algebraic numbers do not form secure pseudorandom sequences, given sufficiently many initial bits of an algebraic number, its minimal polynomial can be reconstructed, and therefore the further bits of the algebraic ...

1988