On the public citation graph
Non-black-box Techniques in Cryptography
0 signed · 100 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/0-387-34805-0_21openalex-snapshot
A Certified Digital Signature
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/11685654_2openalex-snapshot
Concurrent Zero-Knowledge with Timing, Revisited
inferredcites →https://doi.org/10.1007/3-540-39568-7_23openalex-snapshot
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
inferredcites →https://doi.org/10.1007/3-540-44448-3_34openalex-snapshot
Zero-Knowledge and Code Obfuscation
inferredcites →https://doi.org/10.1007/3-540-44598-6_26openalex-snapshot
Efficient Non-malleable Commitment Schemes
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-44647-8_10openalex-snapshot
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
inferredcites →https://doi.org/10.1007/3-540-44647-8_2openalex-snapshot
Universally Composable Commitments
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-44647-8_33openalex-snapshot
Robust Non-interactive Zero Knowledge
inferredcites →https://doi.org/10.1007/3-540-44987-6_4openalex-snapshot
Efficient and Non-interactive Non-malleable Commitment
inferredcites →https://doi.org/10.1007/3-540-46885-4_21openalex-snapshot
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
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/3-540-48071-4_28openalex-snapshot
On Defining Proofs of Knowledge
inferredcites →https://doi.org/10.1007/3-540-48910-x_29openalex-snapshot
On the Concurrent Composition of Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/3-540-49162-7_14openalex-snapshot
How to Copyright a Function?
inferredcites →https://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferredcites →https://doi.org/10.1007/978-3-642-22670-0_21openalex-snapshot
Notes on Levin’s Theory of Average-Case Complexity
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/bf02620230openalex-snapshot
A uniform-complexity treatment of encryption and zero-knowledge
inferredcites →https://doi.org/10.1016/0022-0000(88)90005-0openalex-snapshot
Minimum disclosure proofs of knowledge
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.1109/ccc.2002.1004355openalex-snapshot
Universal Arguments and their Applications
inferredcites →https://doi.org/10.1109/fscs.1990.89518openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1109/sfcs.1987.49openalex-snapshot
Random self-reducibility and zero knowledge interactive proofs of possession of information
inferredcites →https://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
inferredcites →https://doi.org/10.1109/sfcs.1997.646134openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferredcites →https://doi.org/10.1109/sfcs.1998.743499openalex-snapshot
Lower bounds for zero knowledge on the Internet
inferredcites →https://doi.org/10.1109/sfcs.2000.892119openalex-snapshot
Lower bounds on the efficiency of generic cryptographic constructions
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.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferredcites →https://doi.org/10.1109/sffcs.1999.814628openalex-snapshot
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
inferredcites →https://doi.org/10.1109/sffcs.1999.814630openalex-snapshot
Non-interactive cryptocomputing for NC/sup 1/
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tse.2002.1027797openalex-snapshot
Watermarking, tamper-proofing, and obfuscation - tools for software protection
inferredcites →https://doi.org/10.1137/0217013openalex-snapshot
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
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.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/1007352.1007393openalex-snapshot
Bounded-concurrent secure multi-party computation with a dishonest majority
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
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/129712.129782openalex-snapshot
A note on efficient zero-knowledge proofs and arguments (extended abstract)
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/258533.258590openalex-snapshot
P = BPP if E requires exponential circuits
inferredcites →https://doi.org/10.1145/276698.276722openalex-snapshot
Non-interactive and non-malleable commitment
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/41840.41862openalex-snapshot
Achieving independence in logarithmic number of rounds
inferredcites →https://doi.org/10.1145/509978.509979openalex-snapshot
Strict polynomial-time in simulation and extraction
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/780542.780641openalex-snapshot
Bounded-concurrent secure two-party computation without setup assumptions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_12openalex-snapshot
On Round-Efficient Argument Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_17openalex-snapshot
On the Non-tightness of Measurement-Based Reductions for Key Encapsulation Mechanism in the Quantum Random Oracle Model
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-20712-9_1openalex-snapshot
The Equivalence of Sampling and Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_27openalex-snapshot
On the Complexity of Computational Problems Regarding Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_15openalex-snapshot
Secure Database Commitments and Universal Arguments of Quasi Knowledge
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/978-3-662-46803-6_18openalex-snapshot
Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_7openalex-snapshot
Impossibility of Black-Box Simulation Against Leakage Attacks
inferred← citeshttps://doi.org/10.1007/s00224-013-9527-3openalex-snapshot
The Equivalence of Sampling and Searching
inferred← citeshttps://doi.org/10.1007/s11432-008-0013-5openalex-snapshot
Existence of 3-round zero-knowledge proof systems for NP
inferred← citeshttps://doi.org/10.1007/s11432-010-0071-3openalex-snapshot
On constant-round zero-knowledge proofs of knowledge for NP-relations
inferred← citeshttps://doi.org/10.1007/s12204-008-0574-xopenalex-snapshot
Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
inferred← citeshttps://doi.org/10.1109/ares.2007.40openalex-snapshot
Applications for Provably Secure Intent Protection with Bounded Input-Size Programs
inferred← citeshttps://doi.org/10.1109/coginfocom.2014.7020512openalex-snapshot
Cognitive evaluation of intermediate level obfuscator
inferred← citeshttps://doi.org/10.1109/ecbs.2012.20openalex-snapshot
Complexity of a Special Deobfuscation Problem
inferred← citeshttps://doi.org/10.1109/ic3i61595.2024.10828818openalex-snapshot
Robustness Analysis of Zero-Knowledge Proofs Technique using Subset Sum Problem
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5563935openalex-snapshot
Certificateless encryption scheme with non-black-box technology
inferred← citeshttps://doi.org/10.1109/ictacs56270.2022.9988299openalex-snapshot
Robustness Analysis of Zero Knowledge Proofs using Diffie Hellman Problem
inferred← citeshttps://doi.org/10.1109/sfcs.2005.43openalex-snapshot
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
inferred← citeshttps://doi.org/10.1109/sp.2019.00050openalex-snapshot
On the Security of Two-Round Multi-Signatures
inferred← citeshttps://doi.org/10.12700/aph.11.07.2014.07.11openalex-snapshot
An Intermediate Level Obfuscation Method
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.1390openalex-snapshot
A Constant-Round Resettably-Sound Resettable Zero-Knowledge Argument in the BPK Model
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.23919/indiacom49435.2020.9083721openalex-snapshot
Robust Comparative Analysis of Zero-Knowledge Proofs using Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.23919/indiacom54597.2022.9763232openalex-snapshot
Robustness of Zero-Knowledge Proofs using RSA Problem
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.