Sciweavers

1059 search results - page 208 / 212
» Modeling Security Protocols as Games
Sort
View
RSA
2000
170views more  RSA 2000»
13 years 7 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 7 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
INFOCOM
2005
IEEE
14 years 1 months ago
Reduction of quality (RoQ) attacks on Internet end-systems
— Current computing systems depend on adaptation mechanisms to ensure that they remain in quiescent operating regions. These regions are often defined using efficiency, fairnes...
Mina Guirguis, Azer Bestavros, Ibrahim Matta, Yuti...
CCS
2005
ACM
14 years 1 months ago
On deriving unknown vulnerabilities from zero-day polymorphic and metamorphic worm exploits
Vulnerabilities that allow worms to hijack the control flow of each host that they spread to are typically discovered months before the worm outbreak, but are also typically disc...
Jedidiah R. Crandall, Zhendong Su, Shyhtsun Felix ...
EUROCRYPT
2005
Springer
14 years 1 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...