Sciweavers

90 search results - page 15 / 18
» Schemes for deterministic polynomial factoring
Sort
View
ASIACRYPT
2009
Springer
14 years 4 days ago
PSS Is Secure against Random Fault Attacks
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
Jean-Sébastien Coron, Avradip Mandal
ESORICS
2004
Springer
14 years 26 days ago
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor dep...
Seyit Ahmet Çamtepe, Bülent Yener
MOBIHOC
2003
ACM
14 years 7 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
TMM
2010
151views Management» more  TMM 2010»
13 years 2 months ago
SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
Tammy Kam-Hung Chan, Shueng-Han Gary Chan, Ali C. ...
ASIACRYPT
2011
Springer
12 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer