On the public citation graph

How to Compute in the Presence of Leakage

0 signed · 90 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.1007/978-3-540-24676-3_31openalex-snapshot
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_27openalex-snapshot
Private Circuits: Securing Hardware against Probing Attacks
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_3openalex-snapshot
One-Time Programs
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_7openalex-snapshot
Circular-Secure Encryption from Decision Diffie-Hellman
inferredcites →https://doi.org/10.1007/978-3-642-01001-9_27openalex-snapshot
A Leakage-Resilient Mode of Operation
inferredcites →https://doi.org/10.1007/978-3-642-03356-8_2openalex-snapshot
Public-Key Cryptosystems Resilient to Key Leakage
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_19openalex-snapshot
Founding Cryptography on Tamper-Proof Hardware Tokens
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_21openalex-snapshot
Leakage-Resilient Signatures
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_7openalex-snapshot
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_3openalex-snapshot
Protecting Cryptographic Keys against Continual Leakage
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_4openalex-snapshot
Securing Computation against Continuous Leakage
inferredcites →https://doi.org/10.1007/978-3-642-19571-6_6openalex-snapshot
Achieving Leakage Resilience through Dual System Encryption
inferredcites →https://doi.org/10.1007/978-3-642-19571-6_8openalex-snapshot
After-the-Fact Leakage in Public-Key Encryption
inferredcites →https://doi.org/10.1007/978-3-642-25385-0_39openalex-snapshot
Program Obfuscation with Leaky Hardware
inferredcites →https://doi.org/10.1007/978-3-642-28914-9_13openalex-snapshot
Leakage-Resilient Circuits without Computational Assumptions
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_32openalex-snapshot
How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
inferredcites →https://doi.org/10.1109/focs.2008.56openalex-snapshot
Leakage-Resilient Cryptography
inferredcites →https://doi.org/10.1109/focs.2010.55openalex-snapshot
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
inferredcites →https://doi.org/10.1109/focs.2010.56openalex-snapshot
Cryptography against Continuous Memory Attacks
inferredcites →https://doi.org/10.1109/focs.2011.35openalex-snapshot
Storing Secrets on Continually Leaky Devices
inferredcites →https://doi.org/10.1109/sffcs.1999.814630openalex-snapshot
Non-interactive cryptocomputing for NC/sup 1/
inferredcites →https://doi.org/10.1137/0217015openalex-snapshot
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
inferredcites →https://doi.org/10.1137/100813464openalex-snapshot
Public-Key Cryptosystems Resilient to Key Leakage
inferredcites →https://doi.org/10.1145/1993636.1993731openalex-snapshot
Secure computation with information leaking to an adversary
inferredcites →https://doi.org/10.1145/1993636.1993732openalex-snapshot
How to leak on key updates
inferredcites →https://doi.org/10.1145/2160158.2160159openalex-snapshot
On the (im)possibility of obfuscating programs
inferredcites →https://doi.org/10.1145/2213977.2214087openalex-snapshot
Multiparty computation secure against continual memory leakage
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/237814.238015openalex-snapshot
Adaptively secure multi-party computation

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-03329-3_19openalex-snapshot
How to Securely Compute with Noisy Leakage in Quasilinear Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_14openalex-snapshot
Unconditionally Secure Computation Against Low-Complexity Leakage
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_14openalex-snapshot
Leakage-Resilient Key Exchange and Two-Seed Extractors
inferred← citeshttps://doi.org/10.1007/978-3-030-77222-2_4openalex-snapshot
SCA Countermeasures
inferred← citeshttps://doi.org/10.1007/978-3-032-35415-0_10openalex-snapshot
Secure Computation Against $$\mathsf {NC^1}$$ Leakage Without Secure Hardware
inferred← citeshttps://doi.org/10.1007/978-3-032-35415-0_9openalex-snapshot
Leakage-Tolerant Circuits Against $$\textsf{AC}^0$$ Leakage
inferred← citeshttps://doi.org/10.1007/978-3-319-04268-8_13openalex-snapshot
Leakage Resilience of the Blom’s Key Distribution Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_17openalex-snapshot
Efficient Leakage Resilient Circuit Compilers
inferred← citeshttps://doi.org/10.1007/978-3-319-17470-9_6openalex-snapshot
On the Orthogonal Vector Problem and the Feasibility of Unconditionally Secure Leakage-Resilient Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_32openalex-snapshot
Leakage-Resilient Cryptography over Large Finite Fields: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-39555-5_17openalex-snapshot
Deterministic Public-Key Encryption Under Continual Leakage
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_7openalex-snapshot
How to Construct a Leakage-Resilient (Stateless) Trusted Party
inferred← citeshttps://doi.org/10.1007/978-3-319-70694-8_25openalex-snapshot
Consolidating Inner Product Masking
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_14openalex-snapshot
A Turing Machine Resisting Isolated Bursts of Faults
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_31openalex-snapshot
Securing Circuits against Constant-Rate Tampering
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_32openalex-snapshot
How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_13openalex-snapshot
Practical Leakage-Resilient Symmetric Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_45openalex-snapshot
Theory and Practice of a Leakage Resilient Masking Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_10openalex-snapshot
Leakage-Resilient Cryptography from Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_9openalex-snapshot
Masking against Side-Channel Attacks: A Formal Security Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_49openalex-snapshot
Robust Pseudorandom Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_18openalex-snapshot
Secure Computation against Adaptive Auxiliary Information
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_14openalex-snapshot
Non-malleable Codes from Two-Source Extractors
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_21openalex-snapshot
On Continual Leakage of Discrete Log Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_2openalex-snapshot
Obfuscation for Evasive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_24openalex-snapshot
Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_26openalex-snapshot
On the Impossibility of Cryptography with Tamperable Randomness
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_9openalex-snapshot
Leakage-Tolerant Computation with Input-Independent Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_26openalex-snapshot
A Tamper and Leakage Resilient von Neumann Architecture
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_17openalex-snapshot
Leakage-Resilient Non-malleable Codes
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_18openalex-snapshot
Locally Decodable and Updatable Non-malleable Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_5openalex-snapshot
Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_6openalex-snapshot
Noisy Leakage Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_7openalex-snapshot
Impossibility of Black-Box Simulation Against Leakage Attacks
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_1openalex-snapshot
Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
inferred← citeshttps://doi.org/10.1007/978-3-662-49099-0_11openalex-snapshot
Optimal Amplification of Noisy Leakages
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_21openalex-snapshot
Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_19openalex-snapshot
Fine-Grained Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-54455-6_13openalex-snapshot
Compositional Synthesis of Leakage Resilient Programs
inferred← citeshttps://doi.org/10.1007/s00145-015-9200-xopenalex-snapshot
Leakage-Resilient Cryptography from Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/s00145-018-9284-1openalex-snapshot
Unifying Leakage Models: From Probing Attacks to Noisy Leakage
inferred← citeshttps://doi.org/10.1007/s00145-018-9306-zopenalex-snapshot
Locally Decodable and Updatable Non-malleable Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/s00145-019-09310-6openalex-snapshot
Classical Leakage Resilience from Fault-Tolerant Quantum Computation
inferred← citeshttps://doi.org/10.1007/s00145-021-09402-2openalex-snapshot
Unconditionally Secure Computation Against Low-Complexity Leakage
inferred← citeshttps://doi.org/10.1007/s00145-021-09417-9openalex-snapshot
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage
inferred← citeshttps://doi.org/10.1007/s00145-024-09524-3openalex-snapshot
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more
inferred← citeshttps://doi.org/10.1109/focs.2016.10openalex-snapshot
Bounded-Communication Leakage Resilience via Parity-Resilient Circuits
inferred← citeshttps://doi.org/10.1109/focs.2016.39openalex-snapshot
The Multiparty Communication Complexity of Interleaved Group Products
inferred← citeshttps://doi.org/10.1137/120880343openalex-snapshot
Protecting Circuits from Computationally Bounded and Noisy Leakage
inferred← citeshttps://doi.org/10.1145/2213977.2214087openalex-snapshot
Multiparty computation secure against continual memory leakage
inferred← citeshttps://doi.org/10.1145/2422436.2422451openalex-snapshot
Barriers in cryptography with weak, correlated and leaky sources
inferred← citeshttps://doi.org/10.1145/2488608.2488640openalex-snapshot
Shielding circuits with groups
inferred← citeshttps://doi.org/10.1145/2554797.2554822openalex-snapshot
Iterated group products and leakage resilience against NC1
inferred← citeshttps://doi.org/10.1145/2746539.2746560openalex-snapshot
The communication complexity of interleaved group products
inferred← citeshttps://doi.org/10.17760/d20005081openalex-snapshot
Towards bridging theory and implementation of cryptographic primitives
inferred← citeshttps://doi.org/10.17863/cam.26636openalex-snapshot
Interleaved Group Products
inferred← citeshttps://doi.org/10.4086/cjtcs.2013.003openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1209.4820openalex-snapshot
Efficient Refreshing Protocol for Leakage-Resilient Storage Based on the Inner-Product Extractor
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3193openalex-snapshot
Iterated group products and leakage resilience against NC^1
inferred← citeshttps://doi.org/10.5075/epfl-thesis-6807openalex-snapshot
Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography
inferred← citeshttps://doi.org/10.70675/aeee6852z6dfaz4882zb6ecz15ba60e59e1dopenalex-snapshot
Optimisations des attaques par canaux cachés
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.