1274 search results - page 63 / 255 » New Proofs for |
ACSW
2003
13 years 9 months ago
2003
We promote an engineering approach to design of provably secure key exchange protocols. Using the model of Canetti and Krawczyk we present a systematic method to arrive at efficie...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
COMBINATORICS
2006
13 years 7 months ago
2006
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
CAV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
SYNASC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...