23 search results - page 1 / 5 » On Robust Combiners for Oblivious Transfer and Other Primiti... |
93
Voted
EUROCRYPT
2005
Springer
15 years 3 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...
107
click to vote
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
TCC
2007
Springer
15 years 3 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...
TCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of password-authenticated key exchange (PAK) also known as session-key generation using passwords: constructing session-key generation protocols t...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
Oblivious transfer is a fundamental primitive in cryptography. While perfect information theoretic security is impossible, quantum oblivious transfer protocols can limit the disho...