A Greater Tel-Aviv Area Seminar
Title: An equational approach to secure multiparty computation
Speaker: Daniele Micciancio, UCSD
In this week's seminar, I will present the CRYPTO 2013 paper by Bellare-Hoang-Keelveedhi on "Instantiating Random Oracles via UCEs", where UCE stands for Universal Computational Extractor. This is a very interesting work (in my opinion) which formalizes what it means for a concrete function to behave like a random oracle. There have been some attempts at this in the past. However, this is the first attempt to achieve wide applicability. Specifically, many classic random-oracle constructions (but not all) can be proven secure using UCEs.
On Sunday, 2.2, we will hold the Lightweight Crypto Day 2014, dedicated to lightweight cryptography at the Caesarea Rothschild Institute at the University of Haifa.
The day will cover various aspects of lightweight cryptography (covering both academic and industrial view points to the matter), discuss the challenges that lightweight cryptography faces, and will serve as a meeting point for international and local experts from academia, industry, and standardization bodies.
We hereby invite you to the I-CORE (Center of Excellence in Algorithms) Day, which will be held in the Hebrew University of Jerusalem and will have four parallel tracks, on the following research topics:
Cryptography and Security
Algorithmic Game Theory
Algorithms and Computation
In addition we will have the following joint Plenary Speakers:
Prof. Chris Umans, California Institute of Technology
Prof. Luca Trevisan, Stanford University
On Monday 7/4/2014 we will hold the second CYBERDAY workshop on Cyber
and Computer Security in the Computer Science department at the
Technion together with the Technion computer engineering center. The
program, abstracts, and directions are available in
The workshop will be held in Hebrew.
will describe an obfuscator for all circuits based on graded encoding schemes (a generalization of multilinear maps). This construction inspired by the previous work of Garg et al. (FOCS 13) and by our previous obfuscators for more restricted function classes. I will show that the security of this obfuscator, either as an indistinguishability obfuscator (iO) or even as a virtual black box obfuscator (VBB), can be proven in a generic model.
In their seminal work on non-malleability, Dolev, Dwork and Naor, showed how to construct a non-malleable commitment protocol with logarithmically-many "rounds"/"slots", the idea being that any adversary may successfully maul in some slots but would fail in at least one. Since then new ideas have been introduced, ultimately resulting in constant-round protocols based on any one-way function. Yet, in spite of this remarkable progress,
each of the known constructions leaves something to be desired.
title: Communication-less Secure Multiparty Computations over Public Clouds: the Accumulating Cascading Equations Automata
speaker: Shlomi Dolev (Ben-Gurion University of the Negev)