On the public citation graph

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique

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.
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/0-387-34805-0_3openalex-snapshot
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/0-387-34805-0_46openalex-snapshot
Zero Knowledge Proofs of Knowledge in Two Rounds
inferredcites →https://doi.org/10.1007/3-540-39200-9_10openalex-snapshot
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition
inferredcites →https://doi.org/10.1007/3-540-44647-8_1openalex-snapshot
On the (Im)possibility of Obfuscating Programs
inferredcites →https://doi.org/10.1007/3-540-44987-6_23openalex-snapshot
Min-round Resettable Zero-Knowledge in the Public-Key Model
inferredcites →https://doi.org/10.1007/978-3-642-01001-9_3openalex-snapshot
Resettably Secure Computation
inferredcites →https://doi.org/10.1007/978-3-642-25385-0_21openalex-snapshot
Resettable Cryptography in Constant Rounds – The Case of Zero Knowledge
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/s00145-008-9036-8openalex-snapshot
A Proof of Security of Yao’s Protocol for Two-Party Computation
inferredcites →https://doi.org/10.1109/ccc.2002.1004355openalex-snapshot
Universal Arguments and their Applications
inferredcites →https://doi.org/10.1109/focs.2009.59openalex-snapshot
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
inferredcites →https://doi.org/10.1109/focs.2011.74openalex-snapshot
Stateless Cryptographic Protocols
inferredcites →https://doi.org/10.1109/sfcs.2001.959885openalex-snapshot
How to go beyond the black-box simulation barrier
inferredcites →https://doi.org/10.1109/sfcs.2001.959886openalex-snapshot
Resettably-sound zero-knowledge and its applications
inferredcites →https://doi.org/10.1109/sfcs.2002.1181957openalex-snapshot
Constant-round coin-tossing with a man in the middle or realizing the shared random string model
inferredcites →https://doi.org/10.1109/sfcs.2002.1181961openalex-snapshot
Concurrent zero knowledge with logarithmic round-complexity
inferredcites →https://doi.org/10.1109/sfcs.2003.1238214openalex-snapshot
Bounded-concurrent secure two-party computation in a constant number of rounds
inferredcites →https://doi.org/10.1109/sfcs.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/060661880openalex-snapshot
Concurrent Nonmalleable Commitments
inferredcites →https://doi.org/10.1137/060671553openalex-snapshot
New and Improved Constructions of Nonmalleable Cryptographic Protocols
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1137/s0097539792230010openalex-snapshot
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
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
inferredcites →https://doi.org/10.1145/2160158.2160159openalex-snapshot
On the (im)possibility of obfuscating programs
inferredcites →https://doi.org/10.1145/335305.335334openalex-snapshot
Resettable zero-knowledge (extended abstract)
inferredcites →https://doi.org/10.1145/509907.509979openalex-snapshot
Strict polynomial-time in simulation and extraction

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-03807-6_16openalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1007/978-3-030-17253-4_18openalex-snapshot
Upper and Lower Bounds for Continuous Non-Malleable Codes
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_5openalex-snapshot
Black-Box Constructions of Bounded-Concurrent Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_3openalex-snapshot
Post-quantum Resettably-Sound Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_16openalex-snapshot
Notions of Black-Box Reductions, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_9openalex-snapshot
4-Round Resettably-Sound Zero Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_22openalex-snapshot
Structure-Preserving Signatures from Type II Pairings
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_13openalex-snapshot
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_4openalex-snapshot
From Weak to Strong Zero-Knowledge and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-46497-7_25openalex-snapshot
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_14openalex-snapshot
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
inferred← citeshttps://doi.org/10.1007/978-3-662-49096-9_4openalex-snapshot
Indistinguishability Obfuscation: From Approximate to Exact
inferred← citeshttps://doi.org/10.1007/978-3-662-53641-4_3openalex-snapshot
3-Message Zero Knowledge Against Human Ignorance
inferred← citeshttps://doi.org/10.1007/s00145-018-09309-5openalex-snapshot
Non-black-box Simulation in the Fully Concurrent Setting, Revisited
inferred← citeshttps://doi.org/10.1007/s00145-021-09405-zopenalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1109/focs.2013.14openalex-snapshot
Constant-Round Concurrent Zero Knowledge from P-Certificates
inferred← citeshttps://doi.org/10.1109/focs.2013.15openalex-snapshot
Simultaneous Resettability from One-Way Functions
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00086openalex-snapshot
Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably
inferred← citeshttps://doi.org/10.1109/incos.2013.15openalex-snapshot
Secure Obfuscation of Conditional Re-encryption with Keyword Search
inferred← citeshttps://doi.org/10.1109/incos.2013.54openalex-snapshot
On Obfuscating Set-Membership Predicate Functions
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/2488608.2488637openalex-snapshot
Non-black-box simulation in the fully concurrent setting
inferred← citeshttps://doi.org/10.1145/2488608.2488638openalex-snapshot
Non-black-box simulation from one-way functions and applications to resettable security
inferred← citeshttps://doi.org/10.1145/2488608.2488639openalex-snapshot
On the impossibility of approximate obfuscation and applications to resettable cryptography
inferred← citeshttps://doi.org/10.12700/aph.11.07.2014.07.11openalex-snapshot
An Intermediate Level Obfuscation Method
inferred← citeshttps://doi.org/10.21236/ada582583openalex-snapshot
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security
inferred← citeshttps://doi.org/10.26083/tuprints-00004000openalex-snapshot
Cryptographic Reductions: Classification and Applications to Ideal Models
inferred← citeshttps://doi.org/10.62056/ayfhp2w9popenalex-snapshot
Quantum Black-Box Separations: Succinct Non-Interactive Arguments from Falsifiable Assumptions
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.