32 search results - page 1 / 7 » Robuster Combiners for Oblivious Transfer |
100
click to vote
TCC
2007
Springer
15 years 7 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...
111
click to vote
EUROCRYPT
2005
Springer
15 years 6 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...
130
click to vote
CRYPTO
2006
Springer
15 years 4 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...
ESORICS
1994
Springer
15 years 5 months ago
1994
Springer
Abstract. An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out o...
117
click to vote
PKC
2009
Springer
16 years 1 months ago
2009
Springer
In this work, we consider the task of allowing a content provider to enforce complex access control policies on oblivious protocols conducted with anonymous users. As our primary ...