Sciweavers

876 search results - page 30 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
IPSN
2004
Springer
14 years 4 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
INFOCOM
2010
IEEE
13 years 9 months ago
Joint Power and Secret Key Queue Management for Delay Limited Secure Communication
—In recent years, the famous wiretap channel has been revisited by many researchers and information theoretic secrecy has become an active area of research in this setting. In th...
Onur Güngör 0002, Jian Tan, Can Emre Kok...
ASIACRYPT
2003
Springer
14 years 4 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
DKE
2002
107views more  DKE 2002»
13 years 10 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
CN
2007
137views more  CN 2007»
13 years 10 months ago
Defending against hitlist worms using network address space randomization
Worms are self-replicating malicious programs that represent a major security threat for the Internet, as they can infect and damage a large number of vulnerable hosts at timescal...
Spyros Antonatos, Periklis Akritidis, Evangelos P....