1716 search results - page 117 / 344 » Proving Conditional Termination |
ASIACRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. It is almost a folklore-knowledge that hash-based time-stamping schemes are secure if the underlying hash function is collisionresistant but still no rigorous proofs have...
APN
2000
Springer
14 years 1 months ago
2000
Springer
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
ECML
1993
Springer
14 years 1 months ago
1993
Springer
It is empirically known that most incremental learning systems are order dependent, i.e. provide results that depend on the particular order of the data presentation. This paper ai...
ASPDAC
2007
ACM
14 years 27 days ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
ESOP
2007
Springer
14 years 23 days ago
2007
Springer
Abstract. While a rigorous information flow analysis is a key step in obtaining meaningful end-to-end confidentiality guarantees, one must also permit possibilities for declassific...