Communicating sequential processes
Communicating sequential processes
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Elements of information theory
Elements of information theory
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
A Practical Secret Voting Scheme for Large Scale Elections
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Covert channels and anonymizing networks
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Anonymity vs. Information Leakage in Anonymity Systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
CONCUR 2005 - Concurrency Theory
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Theoretical Computer Science - Automated reasoning for security protocol analysis
Probability of Error in Information-Hiding Protocols
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Quantified Interference for a While Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Compositional methods for information-hiding
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Quantifying information leakage in process calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Hi-index | 0.00 |
In this survey paper we consider the class of protocols for information-hiding which use randomization to obfuscate the link between the observables and the information to be protected. We focus on the problem of formalizing the notion of information hiding, and verifying that a given protocol achieves the intended degree of protection. Without the pretense of being omni-comprehensive, we review the main approaches that have been explored in literature: possibilistic, probabilistic, information-theoretic, and statistical.