1087 search results - page 10 / 218 » Distributed Oblivious Transfer |
103
click to vote
MMMACNS
2001
Springer
15 years 6 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
111
click to vote
ASIACRYPT
2007
Springer
15 years 8 months ago
2007
Springer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
112
Voted
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
126
Voted
EUROCRYPT
2005
Springer
15 years 8 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...