On the public citation graph
A language for probabilistically oblivious computation
0 signed · 54 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/11734727_14openalex-snapshot
The Program Counter Security Model: Automatic Detection and Removal of Control-Flow Side Channel Attacks
inferredcites →https://doi.org/10.1007/3-540-68697-5_9openalex-snapshot
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_17openalex-snapshot
Abstract Interpretation of Probabilistic Semantics
inferredcites →https://doi.org/10.1007/978-3-642-38874-3_1openalex-snapshot
Automation of Quantitative Information-Flow Analysis
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.021openalex-snapshot
VPHL: A Verified Partial-Correctness Logic for Probabilistic Programs
inferredcites →https://doi.org/10.1016/j.entcs.2016.09.031openalex-snapshot
A Monad for Randomized Algorithms
inferredcites →https://doi.org/10.1109/csf.2013.11openalex-snapshot
Memory Trace Oblivious Program Execution
inferredcites →https://doi.org/10.1109/hpca.2014.6835932openalex-snapshot
Suppressing the Oblivious RAM timing channel while making information leakage and program efficiency trade-offs
inferredcites →https://doi.org/10.1109/sfcs.1979.38openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1109/sp.1982.10014openalex-snapshot
Security Policies and Security Models
inferredcites →https://doi.org/10.1137/1.9781611975482.150openalex-snapshot
Foundations of Differentially Oblivious Algorithms
inferredcites →https://doi.org/10.1145/1255329.1255341openalex-snapshot
Fast probabilistic simulation, nontermination, and secure information flow
inferredcites →https://doi.org/10.1145/1452044.1452048openalex-snapshot
A probabilistic language based on sampling functions
inferredcites →https://doi.org/10.1145/1805974.1805977openalex-snapshot
Security of multithreaded programs by compilation
inferredcites →https://doi.org/10.1145/1869790.1869796openalex-snapshot
Privacy-preserving data-oblivious geometric algorithms for geographic data
inferredcites →https://doi.org/10.1145/1932681.1863568openalex-snapshot
Distance makes the types grow stronger
inferredcites →https://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
inferredcites →https://doi.org/10.1145/2484313.2484341openalex-snapshot
Data-oblivious graph algorithms for secure computation and outsourcing
inferredcites →https://doi.org/10.1145/2485922.2485971openalex-snapshot
Design space exploration and optimization of path oblivious RAM in secure processors
inferredcites →https://doi.org/10.1145/2492061openalex-snapshot
Probabilistic Relational Reasoning for Differential Privacy
inferredcites →https://doi.org/10.1145/2535838.2535847openalex-snapshot
Probabilistic relational verification for cryptographic implementations
inferredcites →https://doi.org/10.1145/2804302.2804317openalex-snapshot
Practical probabilistic programming with monads
inferredcites →https://doi.org/10.1145/28395.28416openalex-snapshot
Towards a theory of software protection and simulation by oblivious RAMs
inferredcites →https://doi.org/10.1145/3009837.3009884openalex-snapshot
LightDP: towards automating differential privacy proofs
inferredcites →https://doi.org/10.1145/3009837.3009896openalex-snapshot
Coupling proofs are probabilistic product programs
inferredcites →https://doi.org/10.1145/3158154openalex-snapshot
RustBelt: securing the foundations of the Rust programming language
inferredcites →https://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferredcites →https://doi.org/10.1145/378995.379237openalex-snapshot
Architectural support for copy and tamper resistant software
inferredcites →https://doi.org/10.1145/503272.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferredcites →https://doi.org/10.1145/996566.996771openalex-snapshot
Security as a new dimension in embedded system design
inferredcites →https://doi.org/10.29007/vz48openalex-snapshot
Proving uniformity and independence by self-composition and coupling
inferredcites →https://doi.org/10.3233/jcs-130492openalex-snapshot
Effective verification of confidentiality for multi-threaded programs
inferredcites →https://doi.org/10.5555/353629.353648openalex-snapshot
A sound type system for secure flow analysis
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-53288-8_11openalex-snapshot
Verification of Quantitative Hyperproperties Using Trace Enumeration Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_10openalex-snapshot
Combining Classical and Probabilistic Independence Reasoning to Verify the Security of Oblivious Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_11openalex-snapshot
SMT-Boosted Security Types for Low-Level MPC
inferred← citeshttps://doi.org/10.1109/csf54842.2022.9919638openalex-snapshot
Adversary Safety by Construction in a Language of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1109/tifs.2022.3155274openalex-snapshot
NeuralD: Detecting Indistinguishability Violations of Oblivious RAM With Neural Distinguishers
inferred← citeshttps://doi.org/10.1145/3563768.3565547openalex-snapshot
Proving Obliviousness of Probabilistic Algorithms with Formal Verification
inferred← citeshttps://doi.org/10.1145/3591261openalex-snapshot
Taype: A Policy-Agnostic Language for Oblivious Computation
inferred← citeshttps://doi.org/10.1145/3649861openalex-snapshot
Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation
inferred← citeshttps://doi.org/10.14722/laser-ndss.2021.23056openalex-snapshot
On Building the Data-Oblivious Virtual Environment
inferred← citeshttps://doi.org/10.14722/ndss.2021.23056openalex-snapshot
DOVE: A Data-Oblivious Virtual Environment
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.