242 search results - page 23 / 49 » Randomness in Cryptography |
117
Voted
EUROCRYPT
2007
Springer
15 years 9 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...
129
click to vote
EUROCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
111
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
107
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
141
click to vote
PKC
2007
Springer
15 years 9 months ago
2007
Springer
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...