On the public citation graph

Bounded-Communication Leakage Resilience via Parity-Resilient Circuits

0 signed · 59 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.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1openalex-snapshot
Tiny families of functions with random properties: A quality-size trade-off for hashing
inferredcites →https://doi.org/10.1002/rsa.3240050203openalex-snapshot
Random Cayley graphs and expanders
inferredcites →https://doi.org/10.1007/11681878_11openalex-snapshot
Intrusion-Resilience Via the Bounded-Storage Model
inferredcites →https://doi.org/10.1007/11681878_12openalex-snapshot
Perfectly Secure Password Protocols in the Bounded Retrieval Model
inferredcites →https://doi.org/10.1007/978-3-540-30576-7_30openalex-snapshot
Entropic Security and the Encryption of High Entropy Messages
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-78524-8_26openalex-snapshot
Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_29openalex-snapshot
Isolated Proofs of Knowledge and Isolated Zero Knowledge
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_17openalex-snapshot
Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_23openalex-snapshot
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
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-15317-4_9openalex-snapshot
Leakage-Resilient Storage
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-28914-9_15openalex-snapshot
Leakage-Tolerant Interactive Protocols
inferredcites →https://doi.org/10.1007/978-3-642-54242-8_14openalex-snapshot
On the Cryptographic Complexity of the Worst Functions
inferredcites →https://doi.org/10.1007/978-3-662-44381-1_22openalex-snapshot
Non-Interactive Secure Multiparty Computation
inferredcites →https://doi.org/10.1007/978-3-662-44381-1_9openalex-snapshot
Leakage-Tolerant Computation with Input-Independent Preprocessing
inferredcites →https://doi.org/10.1007/978-3-662-46803-6_5openalex-snapshot
Leakage-Resilient Circuits Revisited – Optimal Number of Computing Components Without Leak-Free Hardware
inferredcites →https://doi.org/10.1007/978-3-662-53015-3_21openalex-snapshot
Bounded Indistinguishability and the Complexity of Recovering Secrets
inferredcites →https://doi.org/10.1007/bfb0052229openalex-snapshot
Deniable Encryption
inferredcites →https://doi.org/10.1007/s00037-007-0237-6openalex-snapshot
On Pseudorandom Generators with Linear Stretch in NC0
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
inferredcites →https://doi.org/10.1109/focs.2007.35openalex-snapshot
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
inferredcites →https://doi.org/10.1109/focs.2007.63openalex-snapshot
Intrusion-Resilient Secret Sharing
inferredcites →https://doi.org/10.1109/focs.2009.56openalex-snapshot
Extracting Correlations
inferredcites →https://doi.org/10.1109/focs.2012.34openalex-snapshot
How to Compute in the Presence of Leakage
inferredcites →https://doi.org/10.1109/focs.2013.13openalex-snapshot
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
inferredcites →https://doi.org/10.1109/focs.2016.10openalex-snapshot
Bounded-Communication Leakage Resilience via Parity-Resilient Circuits
inferredcites →https://doi.org/10.1137/060651380openalex-snapshot
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
inferredcites →https://doi.org/10.1145/100216.100244openalex-snapshot
Small-bias probability spaces: efficient constructions and applications
inferredcites →https://doi.org/10.1145/1060590.1060688openalex-snapshot
Correcting errors without leaking partial information
inferredcites →https://doi.org/10.1145/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
inferredcites →https://doi.org/10.1145/237814.238015openalex-snapshot
Adaptively secure multi-party computation
inferredcites →https://doi.org/10.1145/2591796.2591825openalex-snapshot
How to use indistinguishability obfuscation
inferredcites →https://doi.org/10.7146/brics.v7i6.20134openalex-snapshot
Improved Non-Committing Encryption Schemes based on a General Complexity Assumption

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-26951-7_14openalex-snapshot
Unconditionally Secure Computation Against Low-Complexity Leakage
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_17openalex-snapshot
Leakage Resilient Secret Sharing and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_21openalex-snapshot
Non-malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering
inferred← citeshttps://doi.org/10.1007/978-3-030-77886-6_14openalex-snapshot
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_7openalex-snapshot
Short Leakage Resilient and Non-malleable Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_8openalex-snapshot
Leakage-Tolerant Circuits
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_15openalex-snapshot
NIZK Amplification via Leakage-Resilient Secure Computation
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_8openalex-snapshot
Bypassing the Random-Probing Model in Masking Security Proofs
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-96878-0_15openalex-snapshot
Private Circuits: A Modular Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_18openalex-snapshot
On the Local Leakage Resilience of Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/s00145-021-09375-2openalex-snapshot
On the Local Leakage Resilience of Linear Secret Sharing Schemes
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-022-09426-2openalex-snapshot
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
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.2019.00045openalex-snapshot
Leakage-Resilient Secret Sharing Against Colluding Parties
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00117openalex-snapshot
Extractors and Secret Sharing Against Bounded Collusion Protocols
inferred← citeshttps://doi.org/10.1109/tit.2022.3193848openalex-snapshot
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free
inferred← citeshttps://doi.org/10.1145/3717823.3718200openalex-snapshot
Protecting Computations against Continuous Bounded-Communication Leakage
showing the first 21 of 22 · page through all 22
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.