Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Loosely Coupling Ontological Reasoning with an Efficient Middleware for Context-awareness
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Composition and Generalization of Context Data for Privacy Preservation
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
Efficient profile aggregation and policy evaluation in a middleware for adaptive mobile applications
Pervasive and Mobile Computing
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Enforcing access control in Web-based social networks
ACM Transactions on Information and System Security (TISSEC)
A firm foundation for private data analysis
Communications of the ACM
A Framework for Computing the Privacy Scores of Users in Online Social Networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Coprivacy: towards a theory of sustainable privacy
PSD'10 Proceedings of the 2010 international conference on Privacy in statistical databases
Rational privacy disclosure in social networks
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
On the discriminability of keystroke feature vectors used in fixed text keystroke authentication
Pattern Recognition Letters
Show Me How You Move and I Will Tell You Who You Are
Transactions on Data Privacy
A parallel decision tree-based method for user authentication based on keystroke patterns
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
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.