A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
A calculus of mobile processes, I
Information and Computation
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Casper: a compiler for the analysis of security protocols
Journal of Computer Security
Communication and Concurrency
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Probabilistic Asynchronous pi-Calculus
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Group Principals and the Formalization of Anonymity
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Modelling and verifying key-exchange protocols using CSP and FDR
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Journal of Artificial Intelligence Research
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Analysis of an electronic voting protocol in the applied pi calculus
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science - Automated reasoning for security protocol analysis
Anonymity protocols as noisy channels
Information and Computation
Formalized Information-Theoretic Proofs of Privacy Using the HOL4 Theorem-Prover
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
On the Bayes risk in information-hiding protocols
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Epistemic Strategies and Games on Concurrent Processes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An Adversary Model for Simulation-Based Anonymity Proof
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Bisimulation for Demonic Schedulers
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Quantifying maximal loss of anonymity in protocols
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Bounds on the Leakage of the Input's Distribution in Information-Hiding Protocols
Trustworthy Global Computing
Formal Aspects in Security and Trust
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Probabilistic anonymity via coalgebraic simulations
ESOP'07 Proceedings of the 16th European conference on Programming
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Anonymity protocols as noisy channels
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
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
Conditional probabilities over probabilistic and nondeterministic systems
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
On automated verification of probabilistic programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
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
Formal approaches to information-hiding (Tutorial)
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Calibrating the power of schedulers for probabilistic polynomial-time calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Making random choices invisible to the scheduler
Information and Computation
Traces, executions and schedulers, coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
The optimum leakage principle for analyzing multi-threaded programs
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Trust in crowds: probabilistic behaviour in anonymity protocols
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Analysing the MUTE anonymous file-sharing system using the pi-calculus
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Probable innocence in the presence of independent knowledge
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Towards Trustworthy Elections
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 0.00 |
The concept of anonymity comes into play in a wide range of situations, varying from voting and anonymous donations to postings on bulletin boards and sending mails. The systems for ensuring anonymity often use random mechanisms which can be described probabilistically, while the agents' interest in performing the anonymous action may be totally unpredictable, irregular, and hence expressable only nondeterministically.Formal definitions of the concept of anonymity have been investigated in the past either in a totally nondeterministic framework, or in a purely probabilistic one. In this paper, we investigate a notion of anonymity which combines both probability and nondeterminism, and which is suitable for describing the most general situation in which both the systems and the user can have both probabilistic and nondeterministic behavior. We also investigate the properties of the definition for the particular cases of purely nondeterministic users and purely probabilistic users.We formulate our notions of anonymity in terms of observables for processes in the probabilistic π-calculus, whose semantics is based on Probabilistic Automata. We illustrate our ideas by using the example of the dining cryptographers.