105 search results - page 2 / 21 » Simple, Black-Box Constructions of Adaptively Secure Protoco... |
CRYPTO
2007
Springer
13 years 11 months 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...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
We describe a new encryption technique that is secure in the standard model against adaptive chosen ciphertext (CCA2) attacks. We base our method on two very efficient Identity-Ba...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...