Secure algorithm for finding K nearest neighbors in distributed databases

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Secure algorithm for finding K nearest neighbors in distributed databases

Source

PST; Vol. 380 archive
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services table of contents

Markham, Ontario, Canada

SESSION: Short papers: Security applications table of contents

Article No. 68

Year of Publication: 2006

ISBN:1-59593-604-1

Authors

Barrington Young
Raj Bhatnagar

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 0

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1501434.1501514 What is a DOI?

Collaborative Colleagues:

Barrington Young: colleagues

Raj Bhatnagar: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player