Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Theoretical Computer Science - Special issue: Foundations of wide area network computing
CONCUR 2005 - Concurrency Theory
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Proceedings of the second ACM workshop on Digital identity management
Data Anonymity in the FOO Voting Scheme
Electronic Notes in Theoretical Computer Science (ENTCS)
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science - Automated reasoning for security protocol analysis
Theorem-proving anonymity of infinite-state systems
Information Processing Letters
Probabilistic analysis of onion routing in a black-box model
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Anonymity protocols as noisy channels
Information and Computation
Secure collaborations over message boards
International Journal of Security and Networks
Perfect Matching Disclosure Attacks
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Refinement of Kripke Models for Dynamics
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
On Backward-Style Anonymity Verification
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Formal Aspects in Security and Trust
Epistemic Logic for the Applied Pi Calculus
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
A Combinatorial Approach for an Anonymity Metric
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Visibility: a novel concept for characterising provable network digital evidences
International Journal of Security and Networks
Probabilistic and Nondeterministic Aspects of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
A framework for automatically checking anonymity with µCRL
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Formal approaches to information-hiding (Tutorial)
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Complexity of anonymity for security protocols
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Relations among privacy notions
ACM Transactions on Information and System Security (TISSEC)
Modeling identity-related properties and their privacy strength
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
A survey on privacy in mobile participatory sensing applications
Journal of Systems and Software
"Super nodes" in Tor: existence and security implication
Proceedings of the 27th Annual Computer Security Applications Conference
Proceedings of the 11th international conference on Security Protocols
A framework for quantification of linkability within a privacy-enhancing identity management system
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
Towards modeling wireless location privacy
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
A novel framework for preserving privacy of data using correlation analysis
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Epistemic Strategies and Games on Concurrent Processes
ACM Transactions on Computational Logic (TOCL)
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
On the security of an improved password authentication scheme based on ECC
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Reasoning about minimal anonymity in security protocols
Future Generation Computer Systems
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
On the limits of provable anonymity
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Hi-index | 0.00 |
We propose a new specification framework for information hiding properties such as anonymity and privacy. The framework is based on the concept of a function view, which is a concise representation of the attacker's partial knowledge about a function. We describe system behavior as a set of functions, and formalize different information hiding properties in terms of views of these functions. We present an extensive case study, in which we use the function view framework to systematically classify and rigorously define a rich domain of identity-related properties, and to demonstrate that privacy and anonymity are independent. The key feature of our approach is its modularity. It yields precise, formal specifications of information hiding properties for any protocol formalism and any choice of the attacker model as long as the latter induce an observational equivalence relation on protocol instances. In particular, specifications based on function views are suitable for any cryptographic process calculus that defines some form of indistinguishability between processes. Our definitions of information hiding properties take into account any feature of the security model, including probabilities, random number generation, timing, etc., to the extent that it is accounted for by the formalism in which the system is specified. Partially supported by ONR grants N00014-02-1-0109 and N00014-01-1-0837 and DARPA contract N66001-00-C-8015.