Sciweavers

1342 search results - page 104 / 269
» Attacks are Protocols Too
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
ASPLOS
1994
ACM
15 years 10 months ago
Reactive Synchronization Algorithms for Multiprocessors
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
Beng-Hong Lim, Anant Agarwal
DSE
1998
72views more  DSE 1998»
15 years 6 months ago
Construction and management of highly available services in open distributed systems
The paper addresses the problem of the construction and management of highly available services in large, open distributed systems. A novel replication protocol is proposed to sat...
Christos T. Karamanolis, Jeff Magee
WETICE
2003
IEEE
15 years 11 months ago
Practical Anonymity for the Masses with Mix-Networks
Designing mix-networks for low-latency applications that offer acceptable performance and provide good resistance against attacks without introducing too much overhead is very dif...
Marc Rennhard, Bernhard Plattner
TON
2008
89views more  TON 2008»
15 years 6 months ago
Probabilistic packet marking for large-scale IP traceback
This article presents an approach to IP traceback based on the probabilistic packet marking paradigm. Our approach, which we call randomize-and-link, uses large checksum cords to &...
Michael T. Goodrich