GTACS  | March 31 2022 | The upcoming GTACS will be held at Tel Aviv University

Where: The EcoBuilding (Porter School of Environmental Science), Auditorium.

You can park in The Museum of Natural History, we can provide parking stickers.

Register here.


Rafael Pass (Cornell University and Cornell Tech, IAS Distinguished Scholar)

Benny Pinkas (Bar Ilan University)

Analysis of the Apple CSAM detection system

Noam Mazor (Tel Aviv University)

On the Complexity of Two-Party Differential Privacy

Elette Boyle (Reichman University)

Secure Multiparty Computation with Sublinear Preprocessing



The 12th BIU Winter School on Cryptography - Advances in Secure Computation | January 23-26, 2022

link to event: 

School Lecturers:

GTACS  | May 30 2021 | Efi Arazi School of Computer Science


Tal RabinYou Only Speak Once -- Secure MPC with Stateless Ephemeral Roles

Lior RotemGeneric Delay Functions: Equivalence to Factoring in RSA Groups and an Impossibility Result in Known-Order Groups

Guy RothblumOutcome Indistinguishability

Yael KalaiThe Fiat-Shamir Protocol for Succinct Protocols

Hemanta MajiComputational Hardness of Optimal Fair Computation (On the big screen, with accompanying snacks)

Event website:

Blockchain Research Day  IDC | June 2021


Eli Ben-Sasson (StarkWare), Ittay Eyal (Technion), Tal Moran (IDC)

Blockchain research touches on several different areas of computer science, inluding: distributed computation, algorithmic game theory, cryptography and network theory. 

The Israel Blockchain Research day is meant to be a periodic meeting place for students and researchers interested in blockchain research within computer science. 



Gilad Stern, HUJI: Reaching Consensus for Asynchronous Distributed Key Generation

Shir Cohen, Technion: Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP

Shahar Papini, StarkWare: Cairo - A Turing complete CPU AIR for efficient ZK-STARKs

Aviv Yaish, HUJI: Correct Cryptocurrency ASIC Pricing: Are Miners Overpaying?

Maya Dotan, HUJI: Efficient multi dimensional approximate consensus

 Roi Bar Zur,Technion: Efficient MDP Analysis for Selfish-Mining in Blockchains

Yaron Kaner, IDC Herzliya: Bitcoin+: Cheap Support for Complex Spending Conditions in a UTXO Ledger

Itay Tsabary, Technion: MAD-HTLC: Because HTLC is Crazy-Cheap to Attack

Saar Tochner, HUJI: Differentially-Private Payment Channels with Twilight

link to event:

The 9th BIU Winter School on Cryptography: Zero Knowledge | February 18-21, 2019

School overview:

Zero knowledge is a fundamental tool of cryptography, in both theory and practice. It enables a party to prove an assertion without revealing anything but the fact that it is indeed true. The theory of zero-knowledge proofs has beautiful connections to complexity and is used to prove many basic theoretical results of cryptography. In addition, efficient zero-knowledge proofs have many applications, including efficient secure computation, advanced authentication schemes like anonymous credentials, transaction validation, and more.

In the 9th BIU Winter School on Cryptography, we will study the theory and practice of zero-knowledge proofs. The program will cover definitional issues and constructions.

School Lecturers 

  • Eli Ben-Sasson, Technion, Israel
  • Jens Groth, Dfinity Foundation-Zug, Switzerland
  • Carmit Hazay, Bar-Ilan University, Israel
  • Yuval Ishai, Technion, Israel
  • Yehuda Lindell, Bar-Ilan University, Israel
  • Benny Pinkas, Bar-Ilan University, Israel
  • Alon Rosen, IDC Herzliya, Israel
  • Ron Rothblum, Technion, Israel

Cryptography Workshop: Theory-Fest 2019-2020 | December 31 2019 | Organizers: Elette Boyle, IDC Herzliya and Tal Rabin, Algorand Foundation

Speakers: Vinod Vaikuntanathan, MIT, Shai Halevi, Algorand Foundation, Jens Groth, Dfinity, Yael Kalai, MSR New England, Hugo Krawczyk, Algorand Foundation, Tal Malkin, Columbia University, Moni Naor, Weizmann Inst, Yuval Ishai, Technion

Event website: 

GTACS  | October 29 2019 | Efi Arazi School of Computer Science


Niv GilboaFully Linear PCPs and their Cryptographic Applications

Gilad AsharovOptORAMa: Optimal Oblivious RAM

Hayim ShaulHow to Trade Efficiency and Accuracy using Fault-Tolerant Computation

Iftach HaitnerA Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments

Noga Ron-ZewiLocal Proofs Approaching the Witness Length      

Event website: 

GTACS  | November 21 2018 | Efi Arazi School of Computer Science


 Ron Rothblum,  Fiat Shamir, from Practice to Theory

  Mor Weiss,  Private Anonymous Data Access

 Gil Kalai,  Analysis of Boolean Functions, Influence, and Noise

 Noam Mazor,  On the Communication Complexity of Key-Agreement Protocols

Cryptography Seminar:
Event website: