| |
MissionStatement
|
|
RISC Seminar
Upcoming Events
Recent Events
RISC Seminar, in collaboration with the Intercity Number Theory Seminar, on ``Fully Homomorphic Encryption''.
| Date: | Friday April 27, 2012 |
| Location: | CWI (Room L016) |
| 12:00 -
12:45 h |
Vadim Lyubashevsky (ENS Rue d'Ulm):
Ideal Lattices and FHE
(Part I) [Slides: PDF Powerpoint ]
|
| 13:45 -
14:30 h |
Vadim Lyubashevsky (ENS Rue d'Ulm):
Ideal Lattices and FHE
(Part II)
Abstract:
In the first part of the talk, I will cover the Ring-LWE problem, its
hardness, the equivalence of its search and decision versions, and explain
what little is known about the hardness of problems in ideal lattices. In
the second part, I will present two (similar) constructions of cpa-secure
encryption schemes based on Ring-LWE. Then I will present the NTRU
cryptosystem and sketch how it can be easily modified to become a
"somewhat-homomorphic" encryption scheme that supports several additions
and multiplications, and then finally present the "bootstrapping" technique
that converts "somewhat-homomorphic" schemes that meet certain requirements
into fully-homomorphic ones. (NB: the NTRU-based scheme that I will
present does not meet these requirements, but can be modified to meet them
using recent techniques.)
[↑]
|
| 14:45 -
15:30 h |
Erwin Torreao Dassen (CWI):
Brakerski's scale invariant homomorphic scheme
Abstract:
In a recent pre-print, Brakerski introduced what he called a "scale invariant" homomorphic scheme. The name comes from the fact that, contrary to other schemes, its homomorphic properties depend only on the modulus-to-noise ratio. Furthermore, while in previous works noise would grow quadratically with each multiplication, here it grows linearly. The aim of the talk is to describe this scheme in detail.
[↑]
|
| 15:45 -
16:30 h |
Alice Silverberg (University of California, Irvine) :
Some Remarks on Lattice-based Fully Homomorphic Encryption
Abstract:
The talk will include an overview of some lattice-based Fully Homomorphic Encryption schemes such as those proposed by Smart-Vercauteren and Gentry-Halevi. We will also discuss balancing cryptographic security with ease of decryption, for lattice-based FHE schemes.
[↑]
|
Talk by Prof. Kenny Paterson
| Date: | Monday April 2, 2012, 16:00-17:00 |
| Location: | Room L017, CWI |
|
Prof. Kenny Paterson (Royal Holloway, University of London):
TLS and DTLS: A Tale of Two Protocols
(click to see abstract)
Abstract:
TLS is the de facto protocol of choice for securing Internet communications, while DTLS is an increasingly important variant of TLS that was designed for use in lightweight applications. In this talk, I will provide an overview of what is known about the security of the TLS and DTLS protocols. I'll discuss the BEAST attack on TLS and what its implications are. I'll also talk about a recently discovered vulnerability in TLS 1.2, as well as what we know about the provable security of the protocol. I'll then explain how and why DTLS implementations turn out to be more vulnerable than TLS to padding oracle attacks. The talk will assume knowledge of basic cryptography and networking, but will be as self-contained as possible.
[↑]
|
Talk by Prof. Ivan Bjerre Damgaard.
| Date: | January 30, 2012, 16:00-17:00 |
| Location: | Room L017, CWI |
|
Prof. Ivan Damgaard (Aarhus University):
Secure Computation in the Preprocessing Model
(click to see abstract)
Abstract:
Secure Multiparty Computation for the case of dishonest majority
has previously been known as the case where no efficient solution
was possible, since here one cannot avoid using expensive public-key
machinery. However, in a recent of line of research it has been shown
that all the hard work can be pushed into a preprocessing phase
that is independent of the function to be computed. Then, in an
on-line phase, one can compute the function very efficiently
using only cheap information theoretic primitives.
In this talk we survey some of the latest results in this line on research.
For instance, we now have protocols in the preprocessing model that
have complexity linear in both size of circuit to compute and the number
of players, yet tolerate corruption of all but one player.
Joint work with Rikke Bendlin, Claudio Orlandi, Valerio Pastro, Nigel
Smart and Sarah Zakarias.
[↑]
|
See Archive for past years events
|
|
