5084 search results - page 351 / 1017 » Proving Possibility Properties |
160
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
196
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a secure and flexible Mix-net that has the following properties; it efficiently handles long plaintexts that exceed the modulus size of underlying public-key e...
153
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
We establish, for the first time, an explicit and simple lower bound on the nonlinearity Nf of a Boolean function f of n variables satisfying the avalanche criterion of degree p, ...
149
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
We add an operation of group creation to the typed π-calculus, where a group is a type for channels. Creation of fresh groups has the effect of statically preventing certain com...
167
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...