On the Complexity of Aggregating Information for Authentication and Profiling

  • Christian A. Duncan
  • Vir V. Phoha
Conference paper

DOI: 10.1007/978-3-642-28879-1_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7122)
Cite this paper as:
Duncan C.A., Phoha V.V. (2012) On the Complexity of Aggregating Information for Authentication and Profiling. In: Garcia-Alfaro J., Navarro-Arribas G., Cuppens-Boulahia N., de Capitani di Vimercati S. (eds) Data Privacy Management and Autonomous Spontaneus Security. Lecture Notes in Computer Science, vol 7122. Springer, Berlin, Heidelberg

Abstract

Motivated by applications in online privacy, user authentication and profiling, we discuss the complexity of various problems generalized from the classic 0-1 knapsack problem. In our scenarios, we assume the existence of a scoring function that evaluates the confidence in the personal online profile or authenticity of an individual based on a subset of acquired credentials and facts about an individual and show how the specific properties of that function affect the computational complexity of the problem, providing both NP-completeness proofs under certain conditions as well as pseudo-polynomial-time solutions under others.

Keywords

user profiling computational complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Christian A. Duncan
    • 1
  • Vir V. Phoha
    • 1
  1. 1.Center for Secure Cyberspace, Computer ScienceLouisiana Tech UniversityRustonUSA

Personalised recommendations