Skip to main content
SpringerLink
Log in

Finding Pareto-Optimal Set of Distributed Vectors with Minimum Disclosure

  • Conference paper
Distributed Computing - IWDC 2004 (IWDC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3326))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: 1st ACM Conference on Electronic Commerce, Colorado, pp. 78–86 (1999)

    Google Scholar 

  2. Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: 2003 ACM SIGMOD International Conference on Management of Data, pp. 86–97. ACM Press, New York (2003)

    Chapter  Google Scholar 

  3. Deb, K.: Multi-Objective Optimization using Evolutionary Algorithms. John Wiley & Sons Ltd., Chichester (2001)

    MATH  Google Scholar 

  4. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Seventeenth International Conference on Data Engineering, Heidelberg, Germany (2001)

    Google Scholar 

  5. Madore, D.A.: A method of free speech on the Internet: random pads (2000) (June 11, 2004), http://www.eleves.ens.fr:8080/home/madore/misc/freespeech.html

  6. Atallah, M.J., Du, W.: A multi-dimensional Yao’s millionaire protocol (2001) (February 17, 2004), http://dependability.cs.virginia.edu/bibliography/2001-09.ps

  7. Du, W.: A Study of Several Specific Secure Two-Party Computation Problems. PhD thesis, Purdue University (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Management Calcutta, Kolkata, India

    Satish K. Sehgal & Asim K. Pal

Authors
  1. Satish K. Sehgal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Asim K. Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Informatics, Arizona State University, 85287, Tempe, AZ,  

    Arunabha Sen

  2. Indian Statistical Institute, Kolkata,  

    Nabanita Das

  3. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, 76019, Arlington, TX, USA

    Sajal K. Das

  4. ACM Unit, Indian Statistical Institute, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sehgal, S.K., Pal, A.K. (2004). Finding Pareto-Optimal Set of Distributed Vectors with Minimum Disclosure. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30536-1_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24076-1

  • Online ISBN: 978-3-540-30536-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation