On the public citation graph
Alpha-Beta Privacy
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48660-7_29openalex-snapshot
Towards an Automatic Analysis of Security Protocols in First-Order Logic
inferredcites →https://doi.org/10.1007/978-0-387-09428-1_17openalex-snapshot
Automatic Verification of Privacy Properties in the Applied pi Calculus
inferredcites →https://doi.org/10.1007/978-1-4419-5906-5_874openalex-snapshot
Information Flow and Noninterference
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_26openalex-snapshot
Definability in the Monadic Second-Order Theory of Successor
inferredcites →https://doi.org/10.1007/978-3-319-25527-9_7openalex-snapshot
Alice and Bob: Reconciling Formal Models and Implementation
inferredcites →https://doi.org/10.1007/978-3-319-45741-3_13openalex-snapshot
When Are Three Voters Enough for Privacy Properties?
inferredcites →https://doi.org/10.1007/978-3-540-32275-7_24openalex-snapshot
A Formalization of Off-Line Guessing for Security Protocol Analysis
inferredcites →https://doi.org/10.1007/978-3-540-79228-4_1openalex-snapshot
Differential Privacy: A Survey of Results
inferredcites →https://doi.org/10.1007/978-3-642-45221-5_41openalex-snapshot
Defining Privacy Is Supposed to Be Easy
inferredcites →https://doi.org/10.1016/j.ic.2017.05.004openalex-snapshot
A procedure for deciding symbolic equivalence between sets of constraint systems
inferredcites →https://doi.org/10.1016/j.jlamp.2016.10.005openalex-snapshot
A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
inferredcites →https://doi.org/10.1016/j.jlamp.2017.03.001openalex-snapshot
Stateful applied pi calculus: Observational equivalence and labelled bisimilarity
inferredcites →https://doi.org/10.1016/j.jlap.2007.06.002openalex-snapshot
Automated Verification of Selected Equivalences for Security Protocols
inferredcites →https://doi.org/10.1016/s1571-0661(04)00245-2openalex-snapshot
Models for an Adversary-Centric Protocol Logic
inferredcites →https://doi.org/10.1109/69.971193openalex-snapshot
Protecting respondents identities in microdata release
inferredcites →https://doi.org/10.1109/csf.2011.22openalex-snapshot
Assumptions and Guarantees for Compositional Noninterference
inferredcites →https://doi.org/10.1109/csf.2015.19openalex-snapshot
Decidability of Trace Equivalence for Protocols with Nonces
inferredcites →https://doi.org/10.1109/csf.2017.15openalex-snapshot
SAT-Equiv: An Efficient Tool for Equivalence Properties
inferredcites →https://doi.org/10.1109/csfw.1999.779775openalex-snapshot
Process algebra and non-interference
inferredcites →https://doi.org/10.1109/csfw.2001.930138openalex-snapshot
An efficient cryptographic protocol verifier based on prolog rules
inferredcites →https://doi.org/10.1109/csfw.2002.1021802openalex-snapshot
Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15
inferredcites →https://doi.org/10.1109/csfw.2005.14openalex-snapshot
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
inferredcites →https://doi.org/10.1109/icde.2007.367856openalex-snapshot
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
inferredcites →https://doi.org/10.1109/secpri.1995.398914openalex-snapshot
Proceedings 1995 IEEE Symposium on Security and Privacy
inferredcites →https://doi.org/10.1109/sp.1982.10014openalex-snapshot
Security Policies and Security Models
inferredcites →https://doi.org/10.1142/s0218488502001648openalex-snapshot
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
inferredcites →https://doi.org/10.1145/2728816.2728823openalex-snapshot
Formal verification of e-voting
inferredcites →https://doi.org/10.1145/3133956.3133998openalex-snapshot
A Type System for Privacy Properties
inferredcites →https://doi.org/10.1145/360204.360213openalex-snapshot
Mobile values, new names, and secure communication
inferredcites →https://doi.org/10.17487/rfc2759openalex-snapshot
Microsoft PPP CHAP Extensions, Version 2
inferredcites →https://doi.org/10.2168/lmcs-3(3:2)2007openalex-snapshot
Relating two standard notions of secrecy
inferredcites →https://doi.org/10.2307/2271090openalex-snapshot
Definability in the monadic second-order theory of successor
inferredcites →https://doi.org/10.3233/jcs-15777openalex-snapshot
A formal analysis of the Norwegian E-voting protocol
inferredcites →https://doi.org/10.3233/jcs-2004-12104openalex-snapshot
Analysing protocols subject to guessing attacks
inferredcites →https://doi.org/10.3233/jcs-2009-0386openalex-snapshot
Guessing attacks and the computational soundness of static equivalence
inferredcites →https://doi.org/10.3233/jcs-2009-0395openalex-snapshot
Finite models for formal security proofs
inferredcites →https://doi.org/10.5555/1841962.1841969openalex-snapshot
Guessing attacks and the computational soundness of static equivalence
inferredcites →https://doi.org/10.5555/1891823.1891832openalex-snapshot
Finite models for formal security proofs
inferredcites →https://doi.org/10.5860/choice.43-6251openalex-snapshot
Encyclopedia of cryptography and security
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-29959-0_26openalex-snapshot
Formalizing and Proving Privacy Properties of Voting Protocols Using Alpha-Beta Privacy
inferred← citeshttps://doi.org/10.1007/978-3-030-91859-0_7openalex-snapshot
Deciding a Fragment of $$(\alpha , \beta )$$-Privacy
inferred← citeshttps://doi.org/10.1007/978-3-031-17140-6_9openalex-snapshot
One Vote Is Enough for Analysing Privacy
inferred← citeshttps://doi.org/10.1007/978-3-031-19756-7_19openalex-snapshot
A Refactoring for Data Minimisation Using Formal Verification
inferred← citeshttps://doi.org/10.1007/s41870-023-01460-yopenalex-snapshot
Lightweight micro-architecture for IoT & FPGA security
inferred← citeshttps://doi.org/10.1093/logcom/exaf028openalex-snapshot
A logical perspective on intending to keep a true secret
inferred← citeshttps://doi.org/10.1109/csf49147.2020.00020openalex-snapshot
A Method for Proving Unlinkability of Stateful Protocols
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919668openalex-snapshot
Privacy as Reachability
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00011openalex-snapshot
A Decision Procedure for Alpha-Beta Privacy for a Bounded Number of Transitions
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00020openalex-snapshot
Epistemic Model Checking for Privacy
inferred← citeshttps://doi.org/10.1177/0926227x251335296openalex-snapshot
Is one vote really enough? Vote privacy with re-voting and a dishonest ballot box
inferred← citeshttps://doi.org/10.1177/0926227x251378716openalex-snapshot
A decision procedure and typing result for alpha-beta privacy
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.