On the public citation graph
New and Improved Constructions of Nonmalleable Cryptographic Protocols
0 signed · 55 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/bf00195207openalex-snapshot
Definitions and properties of zero-knowledge proof systems
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bf00208001openalex-snapshot
How To Construct Constant-Round Zero-Knowledge Proof Systems for NP
inferredcites →https://doi.org/10.1007/s001459900026openalex-snapshot
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
inferredcites →https://doi.org/10.1007/s001459900037openalex-snapshot
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/s0097539792230010openalex-snapshot
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539795284959openalex-snapshot
Computationally Sound Proofs
inferredcites →https://doi.org/10.1145/116825.116852openalex-snapshot
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
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-03810-6_21openalex-snapshot
The Security of Lazy Users in Out-of-Band Authentication
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_18openalex-snapshot
Non-interactive Non-malleability from Quantum Supremacy
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_8openalex-snapshot
Super-Perfect Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_16openalex-snapshot
Post-Quantum Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-77883-5_6openalex-snapshot
Black-Box Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-77883-5_7openalex-snapshot
Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-90456-2_14openalex-snapshot
Non-malleable Vector Commitments via Local Equivocability
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_11openalex-snapshot
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-30545-0_7openalex-snapshot
On Non-uniform Security for Black-Box Non-interactive CCA Commitments
inferred← citeshttps://doi.org/10.1007/978-3-031-68400-5_14openalex-snapshot
Black-Box (and Fast) Non-malleable Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_5openalex-snapshot
Four-Round Statistical Non-malleable Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_5openalex-snapshot
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_24openalex-snapshot
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_21openalex-snapshot
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_3openalex-snapshot
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_45openalex-snapshot
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_49openalex-snapshot
An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_23openalex-snapshot
Position Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_18openalex-snapshot
Non-malleable Statistically Hiding Commitment from Any One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_12openalex-snapshot
Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_32openalex-snapshot
Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_12openalex-snapshot
A Multi-trapdoor Commitment Scheme from the RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_59openalex-snapshot
Concurrent Knowledge Extraction in the Public-Key Model
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_8openalex-snapshot
Adaptively Secure Multi-Party Computation with Dishonest Majority
inferred← citeshttps://doi.org/10.1007/978-3-642-34883-9_16openalex-snapshot
A Note on Constant-Round Concurrent Zero-Knowledge Arguments of Knowledge for NP
inferred← citeshttps://doi.org/10.1007/s00145-011-9110-5openalex-snapshot
Public-Coin Parallel Zero-Knowledge for NP
inferred← citeshttps://doi.org/10.1007/s00145-020-09348-xopenalex-snapshot
Statistical Concurrent Non-Malleable Zero-Knowledge from One-Way Functions
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-023-09480-4openalex-snapshot
Non-malleable Vector Commitments via Local Equivocability
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.003openalex-snapshot
Concurrent non-malleable statistically hiding commitment
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.010openalex-snapshot
Post-challenge leakage in public-key encryption
inferred← citeshttps://doi.org/10.1109/focs.2012.40openalex-snapshot
From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique
inferred← citeshttps://doi.org/10.1109/sp.2014.31openalex-snapshot
ANONIZE: A Large-Scale Anonymous Survey System
inferred← citeshttps://doi.org/10.1137/060661880openalex-snapshot
Concurrent Nonmalleable Commitments
inferred← citeshttps://doi.org/10.1137/130928236openalex-snapshot
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
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/3377849openalex-snapshot
The Security of Lazy Users in Out-of-Band Authentication
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.176openalex-snapshot
A Multi-Trapdoor Commitment Scheme from the RSA Assumption
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2016.31openalex-snapshot
Block-Wise Non-Malleable Codes
inferred← citeshttps://doi.org/10.48550/arxiv.0908.2476openalex-snapshot
Concurrent Knowledge-Extraction in the Public-Key Model
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12904openalex-snapshot
Post-Quantum Multi-Party Computation
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.