13 search results - page 2 / 3 » Amortizing Randomness in Private Multiparty Computations |
CRYPTO
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
EUROCRYPT
2004
Springer
13 years 10 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...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
CRYPTO
1997
Springer
13 years 10 months ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
SIAMCOMP
1998
13 years 5 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...