Sciweavers

8009 search results - page 1263 / 1602
» cans 2005
Sort
View
ESEM
2007
ACM
15 years 10 months ago
A Replicate Empirical Comparison between Pair Development and Software Development with Inspection
In 2005, we studied the development effort and effect of quality comparisons between software development with Fagan's inspection and pair development. Three experiments were...
Monvorath Phongpaibul, Barry W. Boehm
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 10 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
ASIACRYPT
2006
Springer
15 years 10 months ago
Improved Collision Search for SHA-0
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although t...
Yusuke Naito, Yu Sasaki, Takeshi Shimoyama, Jun Ya...
ASIACRYPT
2006
Springer
15 years 10 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
ESAS
2006
Springer
15 years 10 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
« Prev « First page 1263 / 1602 Last » Next »