Sciweavers

65 search results - page 10 / 13
» Efficient Set Operations in the Presence of Malicious Advers...
Sort
View
102
Voted
CHES
2006
Springer
131views Cryptology» more  CHES 2006»
15 years 3 months ago
Why One Should Also Secure RSA Public Key Elements
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault induc...
Eric Brier, Benoît Chevallier-Mames, Mathieu...
90
Voted
MST
2000
101views more  MST 2000»
14 years 11 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
ASIACRYPT
2009
Springer
15 years 6 months ago
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...
SIGMETRICS
2005
ACM
102views Hardware» more  SIGMETRICS 2005»
15 years 5 months ago
A statistical framework for efficient monitoring of end-to-end network properties
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures ...
David B. Chua, Eric D. Kolaczyk, Mark Crovella
SPAA
2009
ACM
16 years 5 days ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...