1401 search results - page 27 / 281 » Randomness in Interactive Proofs |
173
click to vote
AFRICACRYPT
2010
Springer
15 years 10 months ago
2010
Springer
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
141
click to vote
CPC
2007
15 years 3 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...
121
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
118
click to vote
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...