Sciweavers

876 search results - page 61 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
WWW
2006
ACM
16 years 7 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
ISCA
2010
IEEE
284views Hardware» more  ISCA 2010»
15 years 11 months ago
Security refresh: prevent malicious wear-out and increase durability for phase-change memory with dynamically randomized address
Phase change memory (PCM) is an emerging memory technology for future computing systems. Compared to other non-volatile memory alternatives, PCM is more matured to production, and...
Nak Hee Seong, Dong Hyuk Woo, Hsien-Hsin S. Lee
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
16 years 21 days ago
DCMA: yet another derandomization in covariance-matrix-adaptation
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
Olivier Teytaud, Sylvain Gelly
ASIACRYPT
2004
Springer
15 years 12 months ago
New Approaches to Password Authenticated Key Exchange Based on RSA
We investigate efficient protocols for password-authenticated key exchange based on the RSA public-key cryptosystem. To date, most of the published protocols for password-authentic...
Muxiang Zhang
CCS
2006
ACM
15 years 10 months ago
Deniable authentication and key exchange
We extend the definitional work of Dwork, Naor and Sahai from deniable authentication to deniable key-exchange protocols. We then use these definitions to prove the deniability fe...
Mario Di Raimondo, Rosario Gennaro, Hugo Krawczyk