2237 search results - page 67 / 448 » On the Security of Random Sources |
105
click to vote
MST
2008
15 years 4 months ago
2008
Abstract The transformation protocol can allow two players to share an unconditionally secure secret key using a random deal of cards. A sufficient condition on the number of cards...
138
click to vote
FSE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
143
Voted
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
170
Voted
VEE
2006
ACM
15 years 11 months ago
2006
ACM
One of the most common forms of security attacks involves exploiting a vulnerability to inject malicious code into an executing application and then cause the injected code to be ...
141
click to vote
ACISP
2008
Springer
15 years 6 months ago
2008
Springer
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...