1274 search results - page 110 / 255 » New Proofs for |
101
click to vote
SACRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The XCB mode of operation was outlined in 2004 as a contribution to the IEEE Security in Storage effort, but no security analysis was provided. In this paper, we provide...
107
click to vote
TCC
2004
Springer
15 years 6 months ago
2004
Springer
In a paper from EuroCrypt’99, Damg˚ard, Kilian and Salvail show various positive and negative results on constructing Bit Commitment (BC) and Oblivious Transfer (OT) from Unfair...
107
click to vote
SIAMCOMP
2002
15 years 12 days ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
114
Voted
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
109
Voted
PODC
1999
ACM
15 years 5 months ago
1999
ACM
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...