2237 search results - page 36 / 448 » On the Security of Random Sources |
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
TC
2008
14 years 9 months ago
2008
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some server...
104
click to vote
CCS
2005
ACM
15 years 3 months ago
2005
ACM
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
ACISP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...