403 search results - page 4 / 81 » An algebra for commitment protocols |
ICMAS
1998
13 years 10 months ago
1998
In automated negotiation systems consisting of selfinterested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents...
DALT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Agent interaction protocols are usually specified in terms of permissible sequences of messages. This representation is, unfortunately, brittle and does not allow for ...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract. Distributed transactional systems require an atomic commitment protocol to preserve atomicity of the ACID properties. However, the industry leading standard, 2PC, is slow...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they d...