Finding pareto-optimal set of distributed vectors with minimum disclosure

Authors:
Satish K. Sehgal;Asim K. Pal
Affiliations:
Indian Institute of Management Calcutta, Kolkata, India;Indian Institute of Management Calcutta, Kolkata, India
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 5
Cited 1

Enhancing privacy and trust in electronic communities

Proceedings of the 1st ACM conference on Electronic commerce
Multi-Objective Optimization Using Evolutionary Algorithms

Multi-Objective Optimization Using Evolutionary Algorithms
The Skyline Operator

Proceedings of the 17th International Conference on Data Engineering
Information sharing across private databases

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A study of several specific secure two-party computation problems

A study of several specific secure two-party computation problems

Privacy preserving decentralized method for computing a pareto-optimal solution

IWDC'05 Proceedings of the 7th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of alternatives along with their associated values is available with individual parties who do not want to share it with others. Algorithms to find the feasible set (i.e. common subset) X and the pareto-optimal subset of X with minimum disclosure in presence or absence of a third party are explored. These are useful in multiparty negotiations.