Secure Multi-Party Protocols
- Tools, Implementations, and Applications.
Students:
One of the most attractive contributions of modern cryptogrpahy is
secure computation, which allows multiple participants, each with its
own private input,
to communicate without the help of any trusted party, and
compute any
function of their inputs without revealing any information about the
inputs (except for
the value of the function). A classic example of such a computation is
the “millionaires problem”, in which two millionaires want to find out
who is richer, without revealing their actual worth.
Thus far, secure computation
techniques have rarely been applied in practice, and are typically
considered to have mostly theoretical significance. Our research
aims to build tools that translate these theoretical
results into practical applications. Our goal is that
secure
computation solutions, which today are usually stated as mathematical
theorems, will be available as tools usable by non-experts, similar to
state-of-the-art tools for technologies such as public key encryption,
linear programming, or data compression.
This research project proceeds
in
two directions:
- We develop generic tools
(essentially
compilers) which translate functions, defined in a high-level
language, to distributed programs that implement a secure computation
of
the defined functions. We also expect that this effort will unearth
many questions of theoretical interest, which we will investigate. The Fairplay and
FairplayMP software packages are a result of this research,
as well as papers [2,3,5,6] listed below.
- The
other research direction is the design of specialized, and highly
efficient, solutions to key tasks which have conflicting goals of
respecting privacy and enabling legitimate usage of data. Our recent
research results focused on computing functions based on the Hamming
distance [1], computing numerical fucntions in p2p networks [4], as
well as secure computation systems for face recognition and document
similarity.
Software:
Recent Publications:
- A.
Jarrous and B. Pinkas
Secure Hamming
Distance Based
Computation and its Applications
Applied Cryptography and
Network Security Conference (ACNS), 2009. (Awarded best paper award).
- Assaf
Ben-David, Noam Nisan and Benny Pinkas
FairplayMP - A System for Secure Multi-Party Computation
Proceedings of the ACM Computer and
Communications Security Conference (ACM CCS), October 2008.
Available files: [
pdf, web
site ]
- Yehuda
Lindell, Benny Pinkas and Nigel Smart
Implementing two-party computation efficiently with
security
against malicious adversaries
Proceedings of the Sixth
Conference on Security and Cryptography for Networks (SCN),
Amalfi, Italy, September 2008.
Available files: [ pdf
]
- D. Bickson, D. Dolev,
G. Bezman and B. Pinkas
Secure Multi-party Peer-to-Peer Numerical Computation
Proceedings of the
8th
IEEE Peer-to-Peer Computing (P2P'08), Sept. 2008,
September 2008.
Available files: [ pdf
]
- Y.
Lindell and B. Pinkas
Secure Multiparty Computation for Privacy-Preserving Data
Mining
Journal of Privacy and Confidentiality, Vol. 1,
No. 1, pp. 59-98, 2009.
Available files: [ eprint
]
- Y. Lindell and B. Pinkas
An Efficient
Protocol
for Secure Two-Party Computation in the Presence of Malicious
Adversaries
Advances in
Cryptology -- Eurocrypt '2007 Proceedings, LNCS
4515, Springer-Verlag, pp. 52-78, May 2007.