On the public citation graph
Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness
0 signed · 43 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/11535218_8openalex-snapshot
Unconditional Characterizations of Non-interactive Zero-Knowledge
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-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/bf00196774openalex-snapshot
Bit commitment using pseudorandomness
inferredcites →https://doi.org/10.1007/bfb0052231openalex-snapshot
Public-key cryptosystems from lattice reduction problems
inferredcites →https://doi.org/10.1016/0020-0190(87)90232-8openalex-snapshot
Does co-NP have short interactive proofs?
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1093/logcom/12.3.543-aopenalex-snapshot
Foundations of Cryptography: Basic Tools
inferredcites →https://doi.org/10.1109/focs.2004.72openalex-snapshot
Worst-Case to Average-Case Reductions Based on Gaussian Measures
inferredcites →https://doi.org/10.1109/sct.1995.514853openalex-snapshot
A personal view of average-case complexity
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.2003.1238205openalex-snapshot
On Worst‐Case to Average‐Case Reductions for NP Problems
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/0222069openalex-snapshot
On the Existence of Pseudorandom Generators
inferredcites →https://doi.org/10.1137/s0097539703433511openalex-snapshot
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
inferredcites →https://doi.org/10.1137/s0097539791220688openalex-snapshot
On the Composition of Zero-Knowledge Proof Systems
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/1132516.1132614openalex-snapshot
On basing one-way functions on NP-hardness
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/12130.12137openalex-snapshot
Private coins versus public coins in interactive proof systems
inferredcites →https://doi.org/10.1145/258533.258604openalex-snapshot
A public-key cryptosystem with worst-case/average-case equivalence
inferredcites →https://doi.org/10.1145/780542.780603openalex-snapshot
New lattice based cryptographic constructions
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-032-35367-2_7openalex-snapshot
Unique SNARGs with Adaptive Security: Constructions and Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_23openalex-snapshot
Structure vs. Hardness Through the Obfuscation Lens
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_20openalex-snapshot
On the Security of Classic Protocols for Unique Witness Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_14openalex-snapshot
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-14712-8_12openalex-snapshot
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_35openalex-snapshot
Towards Non-Black-Box Lower Bounds in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_19openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/s00037-016-0122-2openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1109/ccc.2010.17openalex-snapshot
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
inferred← citeshttps://doi.org/10.1109/focs.2019.00044openalex-snapshot
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs
inferred← citeshttps://doi.org/10.1145/1993636.1993652openalex-snapshot
Limits of provable security from standard assumptions
inferred← citeshttps://doi.org/10.1145/2422436.2422480openalex-snapshot
On the power of nonuniformity in proofs of security
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.