On the public citation graph

Probabilistic Anonymity

0 signed · 114 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1998.2740openalex-snapshot
A Calculus for Cryptographic Protocols: The Spi Calculus
inferredcites →https://doi.org/10.1007/11539452_16openalex-snapshot
Probabilistic Anonymity
inferredcites →https://doi.org/10.1007/3-540-44618-4_28openalex-snapshot
On the Reachability Problem in Cryptographic Protocols
inferredcites →https://doi.org/10.1007/3-540-46432-8_10openalex-snapshot
Probabilistic Asynchronous π-Calculus
inferredcites →https://doi.org/10.1007/3-540-48119-2_45openalex-snapshot
Group Principals and the Formalization of Anonymity
inferredcites →https://doi.org/10.1007/3-540-61770-1_38openalex-snapshot
CSP and anonymity
inferredcites →https://doi.org/10.1007/978-1-4684-6316-3_14openalex-snapshot
Coarsening at Random: Characterizations, Conjectures, Counter-Examples
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_14openalex-snapshot
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
inferredcites →https://doi.org/10.1007/bf00206326openalex-snapshot
The dining cryptographers problem: Unconditional sender and recipient untraceability
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/j.entcs.2005.05.047openalex-snapshot
Weak Probabilistic Anonymity
inferredcites →https://doi.org/10.1016/j.tcs.2003.12.023openalex-snapshot
Private authentication
inferredcites →https://doi.org/10.1016/j.tcs.2004.11.020openalex-snapshot
A randomized encoding of the π -calculus with mixed choice
inferredcites →https://doi.org/10.1063/1.2423258openalex-snapshot
Updating Probabilities
inferredcites →https://doi.org/10.1109/csfw.1995.518556openalex-snapshot
Modelling and verifying key-exchange protocols using CSP and FDR
inferredcites →https://doi.org/10.1109/csfw.1997.596779openalex-snapshot
Casper: a compiler for the analysis of security protocols
inferredcites →https://doi.org/10.1109/csfw.2003.1212706openalex-snapshot
Anonymity and information hiding in multiagent systems
inferredcites →https://doi.org/10.1109/secpri.1996.502680openalex-snapshot
Security properties and CSP
inferredcites →https://doi.org/10.1109/secpri.1997.601314openalex-snapshot
Anonymous connections and onion routing
inferredcites →https://doi.org/10.1145/290163.290168openalex-snapshot
Crowds
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1613/jair.1164openalex-snapshot
Updating Probabilities
inferredcites →https://doi.org/10.3233/jcs-1998-61-204openalex-snapshot
Casper: A compiler for the analysis of security protocols
inferredcites →https://doi.org/10.3233/jcs-2004-12102openalex-snapshot
Information hiding, anonymity and privacy: a modular approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/ett.3140openalex-snapshot
A new approach to decrease the computational complexity of e‐voting protocols
inferred← citeshttps://doi.org/10.1007/11679219_11openalex-snapshot
Probable Innocence Revisited
inferred← citeshttps://doi.org/10.1007/11888116_9openalex-snapshot
Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-03026-1_1openalex-snapshot
Practical Metrics for Evaluating Anonymous Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-05416-2_6openalex-snapshot
A Strand Space Approach to Provable Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-540-70630-4_6openalex-snapshot
Formalized Information-Theoretic Proofs of Privacy Using the HOL4 Theorem-Prover
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_26openalex-snapshot
Probabilistic Anonymity Via Coalgebraic Simulations
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_6openalex-snapshot
Analyzing an Electronic Cash Protocol Using Applied Pi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_4openalex-snapshot
Making Random Choices Invisible to the Scheduler
inferred← citeshttps://doi.org/10.1007/978-3-540-75227-1_5openalex-snapshot
Measuring Anonymity with Relative Entropy
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_18openalex-snapshot
Anonymity Protocols as Noisy Channels
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_19openalex-snapshot
A Framework for Automatically Checking Anonymity with μCRL
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_18openalex-snapshot
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_31openalex-snapshot
Compositional Methods for Information-Hiding
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_23openalex-snapshot
Formal Approaches to Information-Hiding (Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_12openalex-snapshot
Conditional Probabilities over Probabilistic and Nondeterministic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_13openalex-snapshot
On Automated Verification of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_17openalex-snapshot
Epistemic Strategies and Games on Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_23openalex-snapshot
Bisimulation for Demonic Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_3openalex-snapshot
Bounds on the Leakage of the Input’s Distribution in Information-Hiding Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-01465-9_12openalex-snapshot
Parameterised Anonymity
inferred← citeshttps://doi.org/10.1007/978-3-642-03741-2_15openalex-snapshot
Traces, Executions and Schedulers, Coalgebraically
inferred← citeshttps://doi.org/10.1007/978-3-642-10248-6_11openalex-snapshot
Architecting Security with Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-642-12459-4_11openalex-snapshot
Probable Innocence in the Presence of Independent Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-12980-3_13openalex-snapshot
Anonymity in Voting Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_15openalex-snapshot
The Optimum Leakage Principle for Analyzing Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_5openalex-snapshot
Safe Equivalences for Security Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-15640-3_7openalex-snapshot
Trust in Crowds: Probabilistic Behaviour in Anonymity Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-16074-5_2openalex-snapshot
Reasoning about Probabilistic Security Using Task-PIOAs
inferred← citeshttps://doi.org/10.1007/978-3-642-36976-6_13openalex-snapshot
Interpreted Systems Semantics for Process Algebra with Identity Annotations
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_13openalex-snapshot
Maximizing Entropy over Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-41157-1_12openalex-snapshot
Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability
inferred← citeshttps://doi.org/10.1007/978-3-642-41157-1_13openalex-snapshot
Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus
inferred← citeshttps://doi.org/10.1007/s00165-012-0268-xopenalex-snapshot
Verifying anonymity in voting systems using CSP
inferred← citeshttps://doi.org/10.1007/s00165-014-0315-xopenalex-snapshot
Formalizing provable anonymity in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10626-017-0259-4openalex-snapshot
Opacity for linear constraint Markov chains
inferred← citeshttps://doi.org/10.1007/s10703-012-0173-1openalex-snapshot
Algorithmic probabilistic game semantics
inferred← citeshttps://doi.org/10.1007/s11229-010-9765-8openalex-snapshot
To know or not to know: epistemic approaches to security protocol verification
inferred← citeshttps://doi.org/10.1007/s11432-012-4660-1openalex-snapshot
Behavioural equivalences of a probabilistic pi-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.043openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.047openalex-snapshot
Weak Probabilistic Anonymity
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.050openalex-snapshot
Probabilistic and Nondeterministic Aspects of Anonymity
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.094openalex-snapshot
Anonymity in Probabilistic and Nondeterministic Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.08.026openalex-snapshot
Epistemic Verification of Anonymity
inferred← citeshttps://doi.org/10.1016/j.ic.2007.07.003openalex-snapshot
Anonymity protocols as noisy channels
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.006openalex-snapshot
Making random choices invisible to the scheduler
inferred← citeshttps://doi.org/10.1016/j.ins.2015.06.018openalex-snapshot
Conditional anonymity with non-probabilistic adversary
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.03.013openalex-snapshot
Quantifying leakage in the presence of unreliable sources of information
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.05.001openalex-snapshot
Maximizing entropy over Markov processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.033openalex-snapshot
Probable innocence revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.008openalex-snapshot
Probabilistic and nondeterministic aspects of anonymity
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.031openalex-snapshot
Probabilistic anonymity via coalgebraic simulations
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.045openalex-snapshot
Information hiding in probabilistic concurrent systems
inferred← citeshttps://doi.org/10.1017/s0960129514000292openalex-snapshot
Compositional methods for information-hiding
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.4.1112openalex-snapshot
An Adversary Model for Simulation-Based Anonymity Proof
inferred← citeshttps://doi.org/10.1109/access.2019.2919322openalex-snapshot
A Survey on Measuring Anonymity in Anonymous Communication Systems
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00352openalex-snapshot
A Secure Mocking Approach towards Software Supply Chain Security
inferred← citeshttps://doi.org/10.1109/csf.2007.13openalex-snapshot
Committees
inferred← citeshttps://doi.org/10.1109/csf.2007.27openalex-snapshot
Probability of Error in Information-Hiding Protocols
inferred← citeshttps://doi.org/10.1109/csf.2013.18openalex-snapshot
AnoA: A Framework for Analyzing Anonymous Communication Protocols
inferred← citeshttps://doi.org/10.1109/csf.2016.13openalex-snapshot
Axioms for Information Leakage
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622868openalex-snapshot
Exploring Physical-Layer Anti-Privacy-Theft Capacity in Wireless Networks
inferred← citeshttps://doi.org/10.1109/iccae.2010.5451390openalex-snapshot
Text clustering based on term weights automatic partition
inferred← citeshttps://doi.org/10.1109/icece.2010.1441openalex-snapshot
Contour Error Based Variable Feedrate Contouring Control Structure for a Biaxial Linear Motor Stage
inferred← citeshttps://doi.org/10.1109/nswctc.2010.58openalex-snapshot
Privacy Protection in Secure Database Service
inferred← citeshttps://doi.org/10.1109/pccc.2008.4745079openalex-snapshot
Towards Mathematically Modeling the Anonymity Reasoning Ability of an Adversary
inferred← citeshttps://doi.org/10.1109/qest.2007.11openalex-snapshot
Symbolic Bisimulations for Probabilistic Systems
inferred← citeshttps://doi.org/10.1109/qest.2007.27openalex-snapshot
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
inferred← citeshttps://doi.org/10.1109/qest.2007.46openalex-snapshot
Fourth International Conference on the Quantitative Evaluation of Systems-Title
inferred← citeshttps://doi.org/10.1109/qest.2010.11openalex-snapshot
Information Hiding in Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1109/saci.2018.8440940openalex-snapshot
Privacy of Clients' Locations in Big Data and Cloud Computing
inferred← citeshttps://doi.org/10.1109/sp.2010.13openalex-snapshot
Reconciling Belief and Vulnerability in Information Flow
inferred← citeshttps://doi.org/10.1109/tse.2008.77openalex-snapshot
Model Checking Probabilistic and Stochastic Extensions of the π-Calculus
inferred← citeshttps://doi.org/10.1109/tse.2025.3567423openalex-snapshot
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
inferred← citeshttps://doi.org/10.1109/wodes.2016.7497866openalex-snapshot
Preserving opacity on Interval Markov Chains under simulation
inferred← citeshttps://doi.org/10.1145/1533057.1533087openalex-snapshot
Quantifying maximal loss of anonymity in protocols
inferred← citeshttps://doi.org/10.1145/2362355.2362356openalex-snapshot
Epistemic Strategies and Games on Concurrent Processes
inferred← citeshttps://doi.org/10.1145/3463676.3485605openalex-snapshot
Plausible Deniability for Anonymous Communication
inferred← citeshttps://doi.org/10.22028/d291-47418openalex-snapshot
AnoA: A Framework for Analyzing Anonymous Communication Protocols
inferred← citeshttps://doi.org/10.29012/jpc.v7i2.651openalex-snapshot
AnoA: A Framework for Analyzing Anonymous Communication Protocols
inferred← citeshttps://doi.org/10.3166/jancl.19.489-516openalex-snapshot
A quantitative doxastic logic for probabilistic processes and applications to information-hiding
inferred← citeshttps://doi.org/10.3233/jcs-2008-0333openalex-snapshot
On the Bayes risk in information-hiding protocols
inferred← citeshttps://doi.org/10.3233/jcs-2010-0362openalex-snapshot
Calibrating the power of schedulers for probabilistic polynomial-time calculus
inferred← citeshttps://doi.org/10.4204/eptcs.7.3openalex-snapshot
How to Work with Honest but Curious Judges? (Preliminary Report)
inferred← citeshttps://doi.org/10.48456/tr-785openalex-snapshot
Anonymity, information, and machine-assisted proof
inferred← citeshttps://doi.org/10.48550/arxiv.0706.1019openalex-snapshot
Probabilistic Anonymity and Admissible Schedulers
inferred← citeshttps://doi.org/10.48550/arxiv.1605.03828openalex-snapshot
Some Epistemic Extensions of Gödel Fuzzy Logic
inferred← citeshttps://doi.org/10.70675/f543aa64zda36z4153z878dz19507ac910e9openalex-snapshot
Approches formelles pour l'analyse de la performabilité des systèmes communicants mobiles : Applications aux réseaux de capteurs sans fil
showing the first 88 of 89 · page through all 89
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.