Sciweavers

80 search results - page 5 / 16
» Attacking and fixing PKCS
Sort
View
USS
2004
13 years 8 months ago
Fixing Races for Fun and Profit: How to Use access(2)
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
Drew Dean, Alan J. Hu
JAR
2006
107views more  JAR 2006»
13 years 7 months ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 1 months ago
Fixed-Period Packet Sampling and its Application to Flow Rate Estimation
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...
Sadayoshi Ito, Kousuke Uchiyama, Shigeo Shioda
CADE
2004
Springer
14 years 7 months ago
Attacking a Protocol for Group Key Agreement by Refuting Incorrect Inductive Conjectures
Abstract. Automated tools for finding attacks on flawed security protocols often struggle to deal with protocols for group key agreement. Systems designed for fixed 2 or 3 party pr...
Graham Steel, Alan Bundy, Monika Maidl
DCC
2001
IEEE
14 years 7 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...