On the public citation graph
Tight Bounds on Information Leakage from Repeated Independent Runs
0 signed · 42 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-68697-5_9openalex-snapshot
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
inferredcites →https://doi.org/10.1007/978-1-4612-5110-1_36openalex-snapshot
A Remark on Stirling’s Formula
inferredcites →https://doi.org/10.1007/978-3-642-00596-1_21openalex-snapshot
On the Foundations of Quantitative Information Flow
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_19openalex-snapshot
Compositional Closure for Bayes Risk in Probabilistic Noninterference
inferredcites →https://doi.org/10.1007/978-3-642-19805-2_27openalex-snapshot
Asymptotic Information Leakage under One-Try Attacks
inferredcites →https://doi.org/10.1007/978-3-642-23822-2_32openalex-snapshot
Quantitative Information Flow, with a View
inferredcites →https://doi.org/10.1007/978-3-642-54792-8_5openalex-snapshot
Abstract Channels and Their Robust Information-Leakage Ordering
inferredcites →https://doi.org/10.1016/0377-0427(93)e0258-nopenalex-snapshot
On Ramanujan's Q-function
inferredcites →https://doi.org/10.1016/j.comnet.2005.01.010openalex-snapshot
Remote timing attacks are practical
inferredcites →https://doi.org/10.1016/j.entcs.2009.07.085openalex-snapshot
Quantitative Notions of Leakage for One-try Attacks
inferredcites →https://doi.org/10.1090/s0002-9939-1989-0949878-9openalex-snapshot
A Recurrence Related to Trees
inferredcites →https://doi.org/10.1093/logcom/exi009openalex-snapshot
Quantitative Information Flow, Relations and Polymorphic Types
inferredcites →https://doi.org/10.1109/csf.2009.21openalex-snapshot
A Provably Secure and Efficient Countermeasure against Timing Attacks
inferredcites →https://doi.org/10.1109/csf.2010.11openalex-snapshot
Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks
inferredcites →https://doi.org/10.1109/csf.2012.26openalex-snapshot
Measuring Information Leakage Using Generalized Gain Functions
inferredcites →https://doi.org/10.1109/csf.2014.29openalex-snapshot
Additive and Multiplicative Notions of Leakage, and Their Capacities
inferredcites →https://doi.org/10.1109/csf.2015.39openalex-snapshot
Rational Protection against Timing Attacks
inferredcites →https://doi.org/10.1109/lics.2015.13openalex-snapshot
Recent Developments in Quantitative Information Flow (Invited Tutorial)
inferredcites →https://doi.org/10.1145/1190215.1190251openalex-snapshot
Assessing security threats of looping constructs
inferredcites →https://doi.org/10.1145/1190216.1190251openalex-snapshot
Assessing security threats of looping constructs
inferredcites →https://doi.org/10.1145/1315245.1315282openalex-snapshot
An information-theoretic model for adaptive side-channel attacks
inferredcites →https://doi.org/10.37236/3032openalex-snapshot
A Simple Proof of an Identity of Lacasse
inferredcites →https://doi.org/10.37236/3309openalex-snapshot
An Identity Conjectured by Lacasse via the Tree Function
inferredcites →https://doi.org/10.48550/arxiv.1209.0824openalex-snapshot
Proof of a Combinatorial Conjecture Coming from the PAC-Bayesian Machine Learning Theory
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-18419-3_12openalex-snapshot
A Comparative Study Across Static and Dynamic Side-Channel Countermeasures
inferred← citeshttps://doi.org/10.1007/978-3-319-99828-2_23openalex-snapshot
An Evaluation of Bucketing in Systems with Non-deterministic Timing Behavior
inferred← citeshttps://doi.org/10.1109/csf.2019.00036openalex-snapshot
Deterministic Channel Design for Minimum Leakage
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00021openalex-snapshot
Concavity, Core-concavity, Quasiconcavity: A Generalizing Framework for Entropy Measures
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174456openalex-snapshot
Strong Asymptotic Composition Theorems for Sibson Mutual Information
inferred← citeshttps://doi.org/10.1109/tit.2022.3228519openalex-snapshot
Strong Asymptotic Composition Theorems for Mutual Information Measures
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase.2019.00035openalex-snapshot
Distributed Quantitative Information Flow Evaluation for Service Composition in Clouds
inferred← citeshttps://doi.org/10.1109/vizsec53666.2021.00008openalex-snapshot
Decision Support for Sharing Data using Differential Privacy
inferred← citeshttps://doi.org/10.3390/e21080753openalex-snapshot
Secure Service Composition with Quantitative Information Flow Evaluation in Mobile Computing Environments
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01387openalex-snapshot
A combinatorial conjecture from PAC-Bayesian machine learning
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.