Speaker: Aggelos Kiayias
Day:  Wednesday, 9/5/2007
Room: ITEB 336
Time: 2:00-3:00pm

Title: Secure Two Party Computation with a Deck of Cards

Abstract. Alice and Bob want to compute the value of a function
f(x,y) on their private inputs a,b respectively, without revealing
their inputs to each other or using a trusted party. Is it possible
to do that with just a deck of cards? Two-party secure 
computation is one of the most fundamental problems
in modern cryptography with many applications in cryptographic
protocol design.

Related Reading :
Anton Stiglic, Computations with a deck of cards, Theoretical
Computer Science, 259(1-2): 671-678 (2001).