Approximately Fair and Secure Protocols for Multiple
نویسندگان
چکیده
Multi-issue negotiation has been studied widely. Our work focuses on the important special case of negotiation with multiple interdependent issues, in which agent utility functions are nonlinear. In this paper, we propose a Distributed Mediator Protocol (DMP) for securely finding Pareto optimal agreements . We also propose a measure for selecting final agreements from the set of Pareto-optimal contracts, based on “approximated fairness” and the “rate of Nash bargaining solution”. We demonstrate that the DMP finds the Nash bargaining solution better than previous work in this area.
منابع مشابه
Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کاملEfficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness
We study the problem of constructing secure multi-party computation (MPC) protocols that are completely fair — meaning that either all the parties learn the output of the function, or nobody does — even when a majority of the parties are corrupted. We first propose a framework for fair multi-party computation, within which we formulate a definition of secure and fair protocols. The definition f...
متن کاملOptimistic Fair Exchange with Multiple Arbiters
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates from the protocol, either both of them get the desired content, or neither of them do. It is known that no twoparty protocol can guarantee fairn...
متن کاملA Secure and Fair Protocol that Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation
Negotiation with multiple interdependent issues is an important problem since much of real-world negotiation falls into this category. This paper examines the problem that, in such domains, agent utility functions are nonlinear, and thereby can create nonconvex Pareto frontiers. This in turn implies that the Nash Bargaining Solution, which has been viewed as the gold standard for identifying a ...
متن کاملSecure Routing Protocol: Affection on MANETs Performance
In mobile ad hoc networks, the absence ofinfrastructure and the consequent absence of authorizationfacilities impede the usual practice of establishing a practicalcriterion to distinguishing nodes as trusted and distrusted.Since all nodes in the MANETs would be used as router inmulti-hop applications, secure routing protocols have vital rulein the security of the network. So evaluating the perf...
متن کامل