Sciweavers

403 search results - page 21 / 81
» An algebra for commitment protocols
Sort
View
ATAL
2006
Springer
15 years 3 months ago
Specifying and resolving preferences among agent interaction patterns
A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent ...
Ashok U. Mallya, Munindar P. Singh
JWSR
2008
99views more  JWSR 2008»
14 years 11 months ago
A Reservation-based Extended Transaction Protocol for Coordination of Web Services
: Web Services can be used to automate business activities that span multiple enterprises over the Internet. Such business activities require a coordination protocol to reach consi...
Wenbing Zhao, Firat Kart, Louise E. Moser, P. M. M...
EUROCRYPT
1999
Springer
15 years 4 months ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail
SOSP
2007
ACM
15 years 8 months ago
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
This paper describes the design, implementation, and evaluation of a replication scheme to handle Byzantine faults in transaction processing database systems. The scheme compares ...
Ben Vandiver, Hari Balakrishnan, Barbara Liskov, S...
ESAW
2006
Springer
15 years 3 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney