On the public citation graph

Stateless Cryptographic Protocols

0 signed · 46 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/3-540-44647-8_32openalex-snapshot
Soundness in the Public-Key Model
inferredcites →https://doi.org/10.1007/978-0-387-73821-5openalex-snapshot
Network Security
inferredcites →https://doi.org/10.1007/978-3-540-72540-4openalex-snapshot
Advances in Cryptology - EUROCRYPT 2007
inferredcites →https://doi.org/10.1007/978-3-540-72540-4_8openalex-snapshot
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
inferredcites →https://doi.org/10.1007/978-3-540-72540-4_9openalex-snapshot
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_31openalex-snapshot
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
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-03356-8_10openalex-snapshot
On the Composition of Public-Coin Zero-Knowledge Protocols
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_19openalex-snapshot
Founding Cryptography on Tamper-Proof Hardware Tokens
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.1016/j.jcss.2005.06.010openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferredcites →https://doi.org/10.1017/cbo9780511721656openalex-snapshot
Foundations of Cryptography
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/sfcs.1982.38openalex-snapshot
Protocols for secure computations
inferredcites →https://doi.org/10.1109/sfcs.1982.88openalex-snapshot
Protocols for secure computations
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.2003.1238212openalex-snapshot
Lower bounds for non-black-box zero knowledge
inferredcites →https://doi.org/10.1109/sfcs.2005.27openalex-snapshot
Concurrent Non-Malleable Commitments
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.1145/1007352.1007393openalex-snapshot
Bounded-concurrent secure multi-party computation with a dishonest majority
inferredcites →https://doi.org/10.1145/1060590.1060670openalex-snapshot
New and improved constructions of non-malleable cryptographic protocols
inferredcites →https://doi.org/10.1145/1806689.1806717openalex-snapshot
On the round complexity of covert computation
inferredcites →https://doi.org/10.1145/233551.233553openalex-snapshot
Software protection and simulation on oblivious RAMs
inferredcites →https://doi.org/10.1145/28395.28420openalex-snapshot
How to play ANY mental game

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-17653-2_19openalex-snapshot
Correlated-Source Extractors and Cryptography with Correlated-Random Tapes
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-031-38557-5_7openalex-snapshot
Additive Randomized Encodings and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-68397-8_4openalex-snapshot
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-26059-4_2openalex-snapshot
From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_14openalex-snapshot
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_7openalex-snapshot
Non-Interactive Multiparty Computation Without Correlated Randomness
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_27openalex-snapshot
Counterexamples to Hardness Amplification beyond Negligible
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_30openalex-snapshot
Simultaneously Resettable Arguments of Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_25openalex-snapshot
Impossibility Results for Static Input Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_36openalex-snapshot
Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
inferred← citeshttps://doi.org/10.1007/978-3-662-46494-6_14openalex-snapshot
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
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-48000-7_2openalex-snapshot
Concurrent Secure Computation via Non-Black Box Simulation
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/pst65910.2025.11268826openalex-snapshot
Stateless Decentralized Authentication Using Segmented ZKPs for Microservices Architectures
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.2488639openalex-snapshot
On the impossibility of approximate obfuscation and applications to resettable cryptography
inferred← citeshttps://doi.org/10.14273/unisa-84openalex-snapshot
Secure computation under network and physical attacks
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.