GTACS

A Greater Tel-Aviv Area Seminar

Yuval Ishai: How to Garble Arithmetic Circuits

Abstract:

Yao's garbled circuit construction transforms a boolean circuit C : {0,1}^n --> {0,1}^m into a "garbled circuit" C' along with n pairs of k-bit keys, one for each input bit, such that C' together with the n keys corresponding to an input x reveal C(x) and no additional information about x. The garbled circuit construction is a central tool for constant-round secure computation and has several other applications.

06/01/2011 - 12:00

Adi Akavia: Cryptography Resilient to Memory Attacks

Cryptography Resilient to Memory Attacks

Adi Akavia, Weizmann Institute

The security of various cryptosystems in common use has been completely
compromised by "side channel attacks", namely, by attacks exploiting
leakage of information on the underlying secret keys. Such information
leakage typically emanates from physical characteristics inevitably
involved in real-world implementations of cryptographic protocols (say,
power consumption, timing, or electro-magnetic radiation).

03/03/2011 - 13:00