403 search results - page 19 / 81 » An algebra for commitment protocols |
TCC
2007
Springer
15 years 5 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
AAMAS
2007
Springer
14 years 12 months ago
2007
Springer
We propose an operational model that combines message meaning and conversational structure in one comprehensive approach. Our long-term research goal is to lay down principles unit...
AAMAS
2005
Springer
15 years 5 months ago
2005
Springer
We report on an investigation of the learning of coordination in cooperative multi-agent systems. Specifically, we study solutions that are applicable to independent agents i.e. ...
DAGSTUHL
2006
15 years 1 months ago
2006
It is well known that unconditionally secure bit commitment is impossible even in the quantum world. In this paper a weak variant of quantum bit commitment, introduced independent...
PKC
2010
Springer
15 years 1 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...