GTACS

In recent years there has been a fantastic boom of increasingly sophisticated “cryptographic objects” — identity-based encryption, fully-homomorphic encryption, functional encryption, and most recently, various forms of obfuscation. These objects often come in various flavors of security, and as these constructions have grown in number, complexity and inter-connectedness, the relationships between them have become increasingly confusing.

Universally-Composable or UC-Security, introduced by Canetti gives the strongest definition of concurrent security. Achieving UC-security for most functionalities is impossible without assuming some trusted setup or relaxed security notions. In this work, we present a unified approach for realizing any functionality with Adaptive-UC-security under minimal setup. Conceptually, our approach can be viewed as an adaptive analogue to the recent work of Lin, Pass and Venkitasubramaniam [STOC ‘09], who considered only static (i.e. non-adaptive) adversaries.

Event webpage

Where: Tel Aviv Yaffo College, Weston Bld, room 007

Program

9:00--9:30Coffee + Gathering

9:30--10:30Zvika Brakerski (Weizmann), Obfuscating Circuits via Composite-Order Graded Encoding

10:30--10:45Coffee Break

10:45--11:45 Alon Rosen (IDC), The SPRING Family of Pseudorandom Functions

11:45--12:00Coffee Break

12:00--13:00 Pavel Hubacek (Weizmann), On the Communication Complexity of Secure Function Evaluation with Long Output

Event webpage.

Program

9:00--9:30: Coffee + Gathering

9:30--11:10: Stefan Dziembowski on Introduction to Bitcoin

11:10--11:30: Coffee

11:30--12:30 Alessandro Chiesa on Scalable Zero Knowledge via Cycles of Elliptic Curves

12:30--1:00: Eran Tromer on Zerocash: improving Bitcoin using SNARKs

12:00--14:00: Lunch (served by us)

14:00--14:50 Rita Vald on An Algebraic Approach to Non-Malleability

14:50--15:00 Break

Event webpage.

Please register here.

Event website

Schedule:

09:30 - 09:45 Coffee and Registration

09:45 - 10:15 Cryptography and Beyond: Taking Advantage of Correlations / Shafi Goldwasser (MIT and Weizmann Institute of Science)

10:15 - 11:15 The Power of Negations in Cryptography / Siyao GUO (The Chinese University of Hong Kong)

11:15 - 11:40 Coffee Break

11:40 - 12:40 How to Privately Find Double Acquisitions in Biometric Databases / Orr Dunkelman (Haifa University)

Event webpage.

Event webpage.

Non-interactive zero-knowledge proofs for general NP statements are a powerful cryptographic primitive. Recent work has achieved theoretical constructions and working implementations of zero-knowledge proofs that are short and easy to verify.

Alas, all prior implementations suffer from severe scalability limitations: the proving key's size and the prover's space complexity grow with the size of the computation being proved.