Sciweavers

3821 search results - page 396 / 765
» A Security Model for Aglets
Sort
View
SP
2009
IEEE
16 years 1 months ago
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008[...
Xiang Cai, Yuwei Gui, Rob Johnson
CSFW
2007
IEEE
16 years 1 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
16 years 1 months ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud
DSOM
2007
Springer
16 years 1 months ago
Botnets for Scalable Management
With an increasing number of devices that must be managed, the scalability of network and service management is a real challenge. A similar challenge seems to be solved by botnets ...
Jérôme François, Radu State, O...
ASIACRYPT
2004
Springer
16 years 6 days ago
Strong Conditional Oblivious Transfer and Computing on Intervals
We consider the problem of securely computing the Greater Than (GT) predicate and its generalization – securely determining membership in a union of intervals. We approach these ...
Ian F. Blake, Vladimir Kolesnikov