58 search results - page 5 / 12 » Multiparty Computation from Somewhat Homomorphic Encryption |
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
DEXAW
2009
IEEE
14 years 2 months ago
2009
IEEE
Secure Multiparty Computation (SMC) has gained tremendous importance with the growth of the Internet and E-commerce, where mutually untrusted parties need to jointly compute a fun...
PKC
2012
Springer
11 years 10 months ago
2012
Springer
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...