Accés ràpid intranet

Més informació...

a a a
Inici

Deiminari

Títol

Complete Fairness in Secure Two-Party Computation

Conferenciant

Nikolaos Makriyannis

Professor/a organitzador/a

Oriol Farrs

Institució

UPF-URV

Data

19-02-2014 12:00

Resum

Suppose parties P1, P2 wish to jointly compute some function f(x, y) where P1 and P2 hold inputs x and y respectively. Furthermore, assume that parties only wish to reveal what the output suggests. Secure Two-Party Computation (2PC) is the subfield of Cryptography that deals with these types of problems. An interesting security requirement in 2PC is complete fairness. Loosely speaking, function f is computable with complete fairness (or f is fair for short) if there exists a protocol computing f such that whenever one of the parties obtains the correct output, then both of them do. Ever since Cleve's seminal paper (1986), fair computation is known not to be possible in general and it was long thought that there are no non-trivial functions that are computable with complete fairness. Surprisingly, Gordon et al. recently (2008) showed that the folklore is false and that some functions are in fact fair. In this talk, we focus on finite Boolean functions. We will be presenting which functions are known to be fair in the literature (and which are provably not), as well as our own results.

Lloc

105

Idioma

Angls