Sciweavers

989 search results - page 97 / 198
» Pebbling and Proofs of Work
Sort
View
ASIACRYPT
2006
Springer
13 years 12 months ago
Finding SHA-1 Characteristics: General Results and Applications
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
Christophe De Cannière, Christian Rechberge...
DEXAW
2004
IEEE
124views Database» more  DEXAW 2004»
13 years 12 months ago
PAC-MEN: Personal Autonomic Computing Monitoring Environment
The overall goal of this research is to improve the `environment awareness' aspect of personal autonomic computing. Personal Computing offers unique challenges for self-manag...
Roy Sterritt, David F. Bantz
CONCUR
2006
Springer
13 years 12 months ago
Weak Bisimulation Up to Elaboration
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
Damien Pous
DGCI
2006
Springer
13 years 11 months ago
On Minimal Perimeter Polyminoes
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z2 , and its geometric meaning. Pictorially, we discuss ways to place a maxima...
Yaniv Altshuler, Vladimir Yanovski, Daniel Vainsen...
EUROCRYPT
2006
Springer
13 years 11 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai