58 search results - page 2 / 12 » Coding Constructions for Blacklisting Problems without Compu... |
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
PKC
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and ...
ECCC
1998
13 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
IACR
2011
12 years 4 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...