A Greater Tel-Aviv Area Seminar
Title:
Charm: A framework for Rapidly Prototyping Cryptographic Systems with Special Applications to Electronic Health Records.
Speaker: Avi Rubin, JHU
Nerus - A Model for Self-Restrictive Native Code
Itay Itzhaky, TAU
From Point Obfuscation To Three Round Zero Knowledge
Omer Paneth, TAU
Leakage-Tolerant Protocols & Obfuscation with Leaky Hardware
Nir Bitansky, TAU
The talk will be divided into two parts. (I might deviate from this plan according to time constraints).
Title: Leakage-Resilient Zero-Knowledge
Speaker: Sanjam Garg, UCLA
We present an algorithm for implementing a secure oblivious
RAM where the access pattern is perfectly hidden in the information
theoretic sense, without assuming that the CPU has access to a random
oracle. In addition we prove a lower bound on the amount of
randomness needed for implementing an information theoretically secure
oblivious RAM.
Joint work with Ivan Damgård and Jesper Buus Nielsen
http://eprint.iacr.org/2010/108
We revisit the problem of reliable interactive communication over a noisy channel, and obtain the first fully explicit (randomized) efficient constant-rate emulation procedure for reliable interactive communication. Our protocol works for any discrete memoryless noisy channel with constant capacity, and fails with exponentially small probability in the total length of the protocol.
It is well known (c.f., Impagliazzo and Luby [FOCS '89]) that the existence of almost all ``interesting" cryptographic applications, i,e., ones that cannot hold information theoretically, implies one-way functions. An important exception where the above implication is not known, however, is the case of coin-flipping protocols. Such protocols allow honest parties to mutually flip an unbiased coin, while guaranteeing that even a cheating (efficient) party cannot bias the output of the protocol by much.
Motivated by the classical problem of privacy amplification, Dodis and
Wichs (STOC '09) introduced the notion of a non-malleable extractor,
significantly strengthening the notion of a strong extractor.
Title: From Cryptography to Algorithms and Back Again
Abstract: For more than 30 years cryptography has been enjoying rich and fertile interactions with a wide variety of other research areas. These include number theory, complexity theory, learning theory, and more, each of which has had a major effect on the development of modern cryptography. This talk will review my recent work on a somewhat less obvious and insufficiently explored interaction between cryptography and fundamental problems in the design and analysis of algorithms.
