On the public citation graph
Non-malleable extractors and symmetric key cryptography from weak secrets
0 signed · 151 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.1002/(sici)1098-2418(199712)11:4<345::aid-rsa4>3.0.co;2-zopenalex-snapshot
Randomness-optimal oblivious sampling
inferredcites →https://doi.org/10.1002/j.1538-7305.1975.tb02040.xopenalex-snapshot
The Wire-Tap Channel
inferredcites →https://doi.org/10.1007/11426639_24openalex-snapshot
Universally Composable Password-Based Key Exchange
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/11818175_14openalex-snapshot
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
inferredcites →https://doi.org/10.1007/3-540-38424-3_31openalex-snapshot
On the Impossibility of Private Key Cryptography with Weakly Random Keys
inferredcites →https://doi.org/10.1007/3-540-39200-9_33openalex-snapshot
A Framework for Password-Based Authenticated Key Exchange
inferredcites →https://doi.org/10.1007/3-540-44647-8_24openalex-snapshot
Session-Key Generation Using Human Passwords Only
inferredcites →https://doi.org/10.1007/3-540-44987-6_29openalex-snapshot
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
inferredcites →https://doi.org/10.1007/3-540-45539-6_11openalex-snapshot
Authenticated Key Exchange Secure against Dictionary Attacks
inferredcites →https://doi.org/10.1007/3-540-45539-6_12openalex-snapshot
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
inferredcites →https://doi.org/10.1007/3-540-48071-4_32openalex-snapshot
Protocols for Secret Key Agreement by Public Discussion Based on Common Information
inferredcites →https://doi.org/10.1007/978-3-540-24638-1_16openalex-snapshot
Physically Observable Cryptography
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-24676-3_7openalex-snapshot
The Exact Price for Unconditionally Secure Asymmetric Cryptography
inferredcites →https://doi.org/10.1007/978-3-540-45146-4_5openalex-snapshot
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
inferredcites →https://doi.org/10.1007/978-3-540-70936-7_1openalex-snapshot
Does Privacy Require True Randomness?
inferredcites →https://doi.org/10.1007/978-3-540-70936-7_26openalex-snapshot
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_27openalex-snapshot
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
inferredcites →https://doi.org/10.1007/978-3-540-85855-3_11openalex-snapshot
An Improved Robust Fuzzy Extractor
inferredcites →https://doi.org/10.1007/978-3-642-00457-5_28openalex-snapshot
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
inferredcites →https://doi.org/10.1007/978-3-642-01001-9_12openalex-snapshot
Key Agreement from Close Secrets over Unsecured Channels
inferredcites →https://doi.org/10.1007/s00145-003-0237-xopenalex-snapshot
Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model
inferredcites →https://doi.org/10.1016/j.tcs.2014.05.025openalex-snapshot
Quantum cryptography: Public key distribution and coin tossing
inferredcites →https://doi.org/10.1109/ccc.2007.38openalex-snapshot
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
inferredcites →https://doi.org/10.1109/focs.2004.44openalex-snapshot
On the (Im)possibility of Cryptography with Imperfect Randomness
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/sfcs.2002.1181962openalex-snapshot
On the (non)universality of the one-time pad
inferredcites →https://doi.org/10.1109/tit.2003.809559openalex-snapshot
Secret-key agreement over unauthenticated public channels-part III: privacy amplification
inferredcites →https://doi.org/10.1137/0217014openalex-snapshot
Privacy Amplification by Public Discussion
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/1151414.1151418openalex-snapshot
A framework for password-based authenticated key exchange 1
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.3217/jucs-019-16-2420openalex-extracted
A Security Real-time Privacy Amplification Scheme in QKD System
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-3-030-03332-3_17openalex-snapshot
Robustly Reusable Fuzzy Extractor from Standard Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_19openalex-snapshot
Correlated-Source Extractors and Cryptography with Correlated-Random Tapes
inferred← citeshttps://doi.org/10.1007/978-3-030-17656-3_16openalex-snapshot
A Quantum-Proof Non-malleable Extractor
inferred← citeshttps://doi.org/10.1007/978-3-030-35423-7_16openalex-snapshot
Privacy Amplification from Non-malleable Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_9openalex-snapshot
Interactive Non-malleable Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_14openalex-snapshot
Low Error Efficient Computational Extractors in the CRS Model
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_4openalex-snapshot
Non-malleability Against Polynomial Tampering
inferred← citeshttps://doi.org/10.1007/978-3-030-57878-7_7openalex-snapshot
Same Point Composable and Nonmalleable Obfuscated Point Functions
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-84252-9_26openalex-snapshot
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_24openalex-snapshot
Computational Robust (Fuzzy) Extractors for CRS-Dependent Sources with Minimal Min-entropy
inferred← citeshttps://doi.org/10.1007/978-3-031-15985-5_14openalex-snapshot
A New Approach to Efficient Non-Malleable Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_13openalex-snapshot
Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model
inferred← citeshttps://doi.org/10.1007/978-3-031-30872-7_26openalex-snapshot
Wireless-Channel Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_19openalex-snapshot
Extractors: Low Entropy Requirements Colliding with Non-malleability
inferred← citeshttps://doi.org/10.1007/978-3-031-44807-2_6openalex-snapshot
Information-Theoretic Cryptography: Life Cycle, Ecosystem, and the Promise of Quantum-Inspired AI
inferred← citeshttps://doi.org/10.1007/978-3-031-54770-6_6openalex-snapshot
Non-malleable Fuzzy Extractors
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_19openalex-snapshot
Uniform Black-Box Separations via Non-malleable Extractors
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_22openalex-snapshot
Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_25openalex-snapshot
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_16openalex-snapshot
Non-malleable Extractors with Shorter Seeds and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_10openalex-snapshot
Inception Makes Non-malleable Codes Stronger
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_11openalex-snapshot
Four-State Non-malleable Codes with Explicit Constant Rate
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_12openalex-snapshot
Key Agreement from Close Secrets over Unsecured Channels
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_27openalex-snapshot
A Leakage-Resilient Mode of Operation
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_3openalex-snapshot
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
inferred← citeshttps://doi.org/10.1007/978-3-642-14496-7_1openalex-snapshot
Survey: Leakage Resilience and the Bounded Retrieval Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_15openalex-snapshot
Secure Authentication from a Weak Key, without Leaking Information
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_16openalex-snapshot
Secret Keys from Channel Noise
inferred← citeshttps://doi.org/10.1007/978-3-642-25243-3_12openalex-snapshot
Ideal Secret Sharing Schemes with Share Selectability
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_1openalex-snapshot
Overcoming Weak Expectations
inferred← citeshttps://doi.org/10.1007/978-3-642-36818-9_50openalex-snapshot
A Real-Time Privacy Amplification Scheme in Quantum Key Distribution
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-42033-7_10openalex-snapshot
Computational Fuzzy Extractors
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_19openalex-snapshot
Non-malleable Coding against Bit-Wise and Split-State Tampering
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_7openalex-snapshot
Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_11openalex-snapshot
Amplifying Privacy in Privacy Amplification
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_21openalex-snapshot
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification
inferred← citeshttps://doi.org/10.1007/978-3-662-48051-9_1openalex-snapshot
On the Malleability of Bitcoin Transactions
inferred← citeshttps://doi.org/10.1007/978-981-95-5125-5_14openalex-snapshot
Almost-Total Puzzles and Their Applications
inferred← citeshttps://doi.org/10.1007/s00145-013-9174-5openalex-snapshot
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
inferred← citeshttps://doi.org/10.1007/s00145-015-9219-zopenalex-snapshot
Non-malleable Coding Against Bit-Wise and Split-State Tampering
inferred← citeshttps://doi.org/10.1007/s00453-023-01150-yopenalex-snapshot
Algebraic Restriction Codes and Their Applications
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104602openalex-snapshot
Computational fuzzy extractors
inferred← citeshttps://doi.org/10.1103/revmodphys.94.025008openalex-snapshot
Security in quantum cryptography
inferred← citeshttps://doi.org/10.1109/access.2020.3009917openalex-snapshot
Input-Dependent Error Sketching Model Enabled Information Theoretical Secure Sketch
inferred← citeshttps://doi.org/10.1109/ccc.2012.21openalex-snapshot
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification
inferred← citeshttps://doi.org/10.1109/focs.2011.67openalex-snapshot
Privacy Amplification and Non-malleable Extractors via Character Sums
inferred← citeshttps://doi.org/10.1109/focs.2012.26openalex-snapshot
Non-malleable Extractors, Two-Source Extractors and Privacy Amplification
inferred← citeshttps://doi.org/10.1109/focs.2013.19openalex-snapshot
Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy
inferred← citeshttps://doi.org/10.1109/focs.2014.40openalex-snapshot
Non-malleable Codes against Constant Split-State Tampering
inferred← citeshttps://doi.org/10.1109/focs.2015.57openalex-snapshot
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
inferred← citeshttps://doi.org/10.1109/focs.2015.58openalex-snapshot
Three-Source Extractors for Polylogarithmic Min-Entropy
inferred← citeshttps://doi.org/10.1109/focs.2016.25openalex-snapshot
Explicit Non-malleable Extractors, Multi-source Extractors, and Almost Optimal Privacy Amplification Protocols
inferred← citeshttps://doi.org/10.1109/focs.2016.26openalex-snapshot
Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy
inferred← citeshttps://doi.org/10.1109/focs.2016.27openalex-snapshot
Extractors for Near Logarithmic Min-Entropy
inferred← citeshttps://doi.org/10.1109/focs.2016.28openalex-snapshot
Making the Most of Advice: New Correlation Breakers and Their Applications
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.00122openalex-snapshot
A constant rate non-malleable code in the split-state model
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00067openalex-snapshot
Affine Extractors for Almost Logarithmic Entropy
inferred← citeshttps://doi.org/10.1109/icaict.2010.5612050openalex-snapshot
Application of biometric methods in cryptography
inferred← citeshttps://doi.org/10.1109/ines46365.2019.9109491openalex-snapshot
Creating Randomness with Games
inferred← citeshttps://doi.org/10.1109/isit.2016.7541832openalex-snapshot
Affine-malleable extractors, spectrum doubling, and application to privacy amplification
inferred← citeshttps://doi.org/10.1109/isit.2018.8437594openalex-snapshot
Secure Key Agreement over Partially Corrupted Channels
inferred← citeshttps://doi.org/10.1109/itw.2012.6404636openalex-snapshot
Overcoming weak expectations
inferred← citeshttps://doi.org/10.1109/itw.2017.8278016openalex-snapshot
Tighter bounds on entropy of secret keys in authentication codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2200290openalex-snapshot
Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets
inferred← citeshttps://doi.org/10.1109/tit.2014.2323246openalex-snapshot
Separation of Reliability and Secrecy in Rate-Limited Secret-Key Generation
inferred← citeshttps://doi.org/10.1109/tit.2016.2613919openalex-snapshot
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
inferred← citeshttps://doi.org/10.1109/tit.2019.2946896openalex-snapshot
An Entropy Lower Bound for Non-Malleable Extractors
inferred← citeshttps://doi.org/10.1109/tit.2022.3167404openalex-snapshot
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
inferred← citeshttps://doi.org/10.1109/tit.2023.3313149openalex-snapshot
Quantum Measurement Adversary
inferred← citeshttps://doi.org/10.1137/120868414openalex-snapshot
Privacy Amplification and Nonmalleable Extractors Via Character Sums
inferred← citeshttps://doi.org/10.1137/18m1176622openalex-snapshot
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions
inferred← citeshttps://doi.org/10.1145/1806689.1806796openalex-snapshot
Privacy amplification with asymptotically optimal entropy loss
inferred← citeshttps://doi.org/10.1145/2213977.2214052openalex-snapshot
Design extractors, non-malleable condensers and privacy amplification
inferred← citeshttps://doi.org/10.1145/2488608.2488708openalex-snapshot
New independent source extractors with exponential improvement
inferred← citeshttps://doi.org/10.1145/2591796.2591804openalex-snapshot
Non-malleable codes from additive combinatorics
inferred← citeshttps://doi.org/10.1145/2630064openalex-snapshot
Privacy amplification with asymptotically optimal entropy loss
inferred← citeshttps://doi.org/10.1145/2746539.2746544openalex-snapshot
Non-malleable Reductions and Applications
inferred← citeshttps://doi.org/10.1145/2897518.2897528openalex-snapshot
Explicit two-source extractors and resilient functions
inferred← citeshttps://doi.org/10.1145/2897518.2897547openalex-snapshot
Non-malleable extractors and codes, with their many tampered extensions
inferred← citeshttps://doi.org/10.1145/2897518.2897643openalex-snapshot
Extractors for sumset sources
inferred← citeshttps://doi.org/10.1145/3055399.3055429openalex-snapshot
Towards optimal two-source extractors and Ramsey graphs
inferred← citeshttps://doi.org/10.1145/3055399.3055483openalex-snapshot
Non-malleable codes and extractors for small-depth circuits, and affine functions
inferred← citeshttps://doi.org/10.1145/3055399.3055486openalex-snapshot
Improved non-malleable extractors, non-malleable codes and independent source extractors
inferred← citeshttps://doi.org/10.1145/3717823.3718272openalex-snapshot
Leakage-Resilient Extractors against Number-on-Forehead Protocols
inferred← citeshttps://doi.org/10.1145/3798129.3800844openalex-snapshot
Extractors for Samplable Distributions from the Two-Source Extractor Recipe
inferred← citeshttps://doi.org/10.11575/prism/27097openalex-snapshot
New Notions of Secrecy and User Generated Randomness in Cryptography
inferred← citeshttps://doi.org/10.22331/q-2025-03-05-1652openalex-snapshot
Device independent security of quantum key distribution from monogamy-of-entanglement games
inferred← citeshttps://doi.org/10.23919/isita.2018.8664348openalex-snapshot
Privacy Amplification: Recent Developments and Applications
inferred← citeshttps://doi.org/10.3233/fi-2015-1279openalex-snapshot
On Computing Discrete Logarithms in Bulk and Randomness Extractors
inferred← citeshttps://doi.org/10.3390/e24020266openalex-snapshot
The Odyssey of Entropy: Cryptography
inferred← citeshttps://doi.org/10.3390/e24070880openalex-snapshot
Recent Advances in Randomness Extraction
inferred← citeshttps://doi.org/10.3390/e24081038openalex-snapshot
Non-Malleable Code in the Split-State Model
inferred← citeshttps://doi.org/10.37055/sbn/135232openalex-snapshot
NON-MALLEABLE RANDOMNESS EXTRACTORS
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.380-384.2892openalex-snapshot
Protocols for Message Authentication from a Weak Secret
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.692openalex-snapshot
Space Pseudorandom Generators by Communication Complexity Lower Bounds
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.28openalex-snapshot
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
inferred← citeshttps://doi.org/10.4230/lipics.itc.2020.7openalex-snapshot
Leakage-Resilient Non-Malleable Secret Sharing in Non-compartmentalized Models
inferred← citeshttps://doi.org/10.46298/theoretics.22.1openalex-snapshot
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1011.2551openalex-snapshot
On the Problem of Local Randomness in Privacy Amplification with an Active Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5415openalex-snapshot
Privacy Amplification and Non-Malleable Extractors Via Character Sums
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2205openalex-snapshot
A Cryptographic Treatment of the Wiretap Channel
inferred← citeshttps://doi.org/10.48550/arxiv.1605.04194openalex-snapshot
Quantum-Proof Extractors: Optimal up to Constant Factors
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06318openalex-snapshot
Privacy Amplification Against Active Quantum Adversaries
inferred← citeshttps://doi.org/10.48550/arxiv.1701.01091openalex-snapshot
Quantum hashing is maximally secure against classical leakage
inferred← citeshttps://doi.org/10.48550/arxiv.1911.10201openalex-snapshot
Secure Sketch for All Noisy Sources (Noisy)
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03097openalex-snapshot
Quantum secure non-malleable-extractors
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00673openalex-snapshot
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
inferred← citeshttps://doi.org/10.7916/d8-debr-bw49openalex-snapshot
On Resilience to Computable Tampering
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.