64 search results - page 6 / 13 » crypto 2006 |
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We consider the problem of random selection, where p players follow a protocol to jointly select a random element of a universe of size n. However, some of the players ma...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...