Sciweavers

1089 search results - page 218 / 218
» Randomness and Reducibility
Sort
View
IACR
2011
132views more  IACR 2011»
12 years 5 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
ASPLOS
2012
ACM
12 years 2 months ago
Relyzer: exploiting application-level fault equivalence to analyze application resiliency to transient faults
Future microprocessors need low-cost solutions for reliable operation in the presence of failure-prone devices. A promising approach is to detect hardware faults by deploying low-...
Siva Kumar Sastry Hari, Sarita V. Adve, Helia Naei...
TMC
2012
11 years 8 months ago
Mobile Data Offloading through Opportunistic Communications and Social Participation
—3G networks are currently overloaded, due to the increasing popularity of various applications for smartphones. Offloading mobile data traffic through opportunistic communicatio...
Bo Han, Pan Hui, V. S. Anil Kumar, Madhav V. Marat...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
13 years 12 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...