860 search results - page 25 / 172 » Completeness in two-party secure computation: a computationa... |
153
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
180
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
Classical distributed protocols like broadcast or multi-party computation provide security as long as the number of malicious players f is bounded by some given threshold t, i.e., ...
144
click to vote
SP
2003
IEEE
15 years 11 months ago
2003
IEEE
Many recent large-scale distributed computing applications utilize spare processor cycles of personal computers that are connected to the Internet. The resulting distributed compu...
161
click to vote
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A contract signing protocol lets two parties exchange digital signatures on a pre-agreed text. Optimistic contract signing protocols enable the signers to do so without i...
155
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use t...