On the public citation graph

Magic Functions

0 signed · 113 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_1openalex-snapshot
On the (Im)possibility of Obfuscating Programs
inferredcites →https://doi.org/10.1007/3-540-45253-2openalex-snapshot
Algorithms - ESA 2000
inferredcites →https://doi.org/10.1007/3-540-46035-7_28openalex-snapshot
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security
inferredcites →https://doi.org/10.1007/3-540-46416-6_20openalex-snapshot
Distributed Provers with Applications to Undeniable Signatures
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-49162-7_7openalex-snapshot
A Relationship between One-Wayness and Correlation Intractability
inferredcites →https://doi.org/10.1007/3-540-68339-9_33openalex-snapshot
Security Proofs for Signature Schemes
inferredcites →https://doi.org/10.1007/978-3-642-79235-9openalex-snapshot
Structural Complexity I
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/bf02351717openalex-snapshot
Zero-knowledge proofs of identity
inferredcites →https://doi.org/10.1007/bf02620230openalex-snapshot
A uniform-complexity treatment of encryption and zero-knowledge
inferredcites →https://doi.org/10.1007/bfb0052229openalex-snapshot
Deniable Encryption
inferredcites →https://doi.org/10.1007/bfb0055717openalex-snapshot
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
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(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.1109/71.722223openalex-snapshot
Access control and signatures via quorum secret sharing
inferredcites →https://doi.org/10.1109/sfcs.1987.43openalex-snapshot
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
inferredcites →https://doi.org/10.1109/sfcs.1995.492584openalex-snapshot
Hard-core distributions for somewhat hard problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548509openalex-snapshot
Incoercible multiparty computation
inferredcites →https://doi.org/10.1109/sfcs.1997.646126openalex-snapshot
Does parallel repetition lower the error in computationally sound 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.2003.1238185openalex-snapshot
On the (In)security of the Fiat-Shamir paradigm
inferredcites →https://doi.org/10.1137/0217017openalex-snapshot
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
inferredcites →https://doi.org/10.1137/0217025openalex-snapshot
The Notion of Security for Probabilistic Cryptosystems
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/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1137/s0097539795291562openalex-snapshot
Nonmalleable Cryptography
inferredcites →https://doi.org/10.1145/100216.100272openalex-snapshot
Witness indistinguishable and witness hiding protocols
inferredcites →https://doi.org/10.1145/103418.103474openalex-snapshot
Non-malleable cryptography
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/237814.238015openalex-snapshot
Adaptively secure multi-party computation
inferredcites →https://doi.org/10.1145/276698.276741openalex-snapshot
The random oracle methodology, revisited (preliminary version)
inferredcites →https://doi.org/10.1145/276698.276853openalex-snapshot
Concurrent zero-knowledge
inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot
Pseudo-random generation from one-way functions

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-17253-4_2openalex-snapshot
Lossy Algebraic Filters with Short Tags
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_23openalex-snapshot
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
inferred← citeshttps://doi.org/10.1007/978-3-030-64375-1_10openalex-snapshot
Can a Public Blockchain Keep a Secret?
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_27openalex-snapshot
Individual Simulations
inferred← citeshttps://doi.org/10.1007/978-3-030-75248-4_6openalex-snapshot
On Selective-Opening Security of Deterministic Primitives
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-84242-0_12openalex-snapshot
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_2openalex-snapshot
On Communication-Efficient Asynchronous MPC with Adaptive Security
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_13openalex-snapshot
Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_19openalex-snapshot
On Expected Polynomial Runtime in Cryptography
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-319-10879-7_33openalex-snapshot
On Selective-Opening Attacks against Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-27659-5_4openalex-snapshot
Encrypted Secret Sharing and Analysis by Plaintext Randomization
inferred← citeshttps://doi.org/10.1007/978-3-319-52153-4_24openalex-snapshot
Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_12openalex-snapshot
Magic Adversaries Versus Individual Reduction: Science Wins Either Way
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_12openalex-snapshot
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-75160-3_5openalex-snapshot
From Attack on Feige-Shamir to Construction of Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_4openalex-snapshot
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_10openalex-snapshot
Adaptive Security of Symbolic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_2openalex-snapshot
Tackling Adaptive Corruptions in Multicast Encryption Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_6openalex-snapshot
Lower Bounds for Non-interactive Zero-Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_40openalex-snapshot
Adaptive Soundness of Static Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_20openalex-snapshot
P-signatures and Noninteractive Anonymous Credentials
inferred← citeshttps://doi.org/10.1007/978-3-540-78663-4_24openalex-snapshot
Computational Soundness of Equational Theories (Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_7openalex-snapshot
Towards Key-Dependent Message Security in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_12openalex-snapshot
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_1openalex-snapshot
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
inferred← citeshttps://doi.org/10.1007/978-3-642-03459-6_13openalex-snapshot
Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_20openalex-snapshot
Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_23openalex-snapshot
The Fiat–Shamir Transform for Group and Ring Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_15openalex-snapshot
Identity-Based Encryption Secure against Selective Opening Attack
inferred← citeshttps://doi.org/10.1007/978-3-642-19571-6_33openalex-snapshot
(Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_33openalex-snapshot
Deniable Encryption with Negligible Detection Probability: An Interactive Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_30openalex-snapshot
Bi-Deniable Public-Key Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_4openalex-snapshot
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_38openalex-snapshot
Standard Security Does Not Imply Security against Selective-Opening
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_24openalex-snapshot
Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_22openalex-snapshot
Fully Leakage-Resilient Signatures with Auxiliary Inputs
inferred← citeshttps://doi.org/10.1007/978-3-642-33272-2_8openalex-snapshot
On the (Non-)Equivalence of UC Security Notions
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_31openalex-snapshot
Revisiting Lower and Upper Bounds for Selective Decommitments
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_40openalex-snapshot
Errata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_5openalex-snapshot
Efficient Cryptosystems from 2 k -th Power Residue Symbols
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_19openalex-snapshot
Enhanced Chosen-Ciphertext Security and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_14openalex-snapshot
Secret-Sharing for NP
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_1openalex-snapshot
Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_3openalex-snapshot
How Secure is Deterministic Encryption?
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-48797-6_19openalex-snapshot
Selective Opening Security for Receivers
inferred← citeshttps://doi.org/10.1007/978-3-662-53644-5_2openalex-snapshot
Interactive Oracle Proofs
inferred← citeshttps://doi.org/10.1007/978-981-96-0891-1_1openalex-snapshot
Non-malleable Subvector Commitments
inferred← citeshttps://doi.org/10.1007/978-981-99-8724-5_5openalex-snapshot
Weak Zero-Knowledge via the Goldreich-Levin Theorem
inferred← citeshttps://doi.org/10.1007/s00145-008-9021-2openalex-snapshot
General Composition and Universal Composability in Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/s00145-010-9066-xopenalex-snapshot
Possibility and Impossibility Results for Selective Decommitments
inferred← citeshttps://doi.org/10.1007/s00145-015-9226-0openalex-snapshot
Secret-Sharing for NP
inferred← citeshttps://doi.org/10.1007/s00145-016-9229-5openalex-snapshot
Efficient Cryptosystems From $$\mathbf{2}^{{\varvec{k}}}$$ 2 k -th Power Residue Symbols
inferred← citeshttps://doi.org/10.1007/s00145-016-9241-9openalex-snapshot
The Hunting of the SNARK
inferred← citeshttps://doi.org/10.1007/s00145-018-9276-1openalex-snapshot
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
inferred← citeshttps://doi.org/10.1007/s10207-023-00779-8openalex-snapshot
Enhancing security in Fiat–Shamir transformation-based non-interactive zero-knowledge protocols for IoT authentication
inferred← citeshttps://doi.org/10.1109/csf.2007.23openalex-snapshot
Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles
inferred← citeshttps://doi.org/10.1109/csf.2011.25openalex-snapshot
Security for Key Management Interfaces
inferred← citeshttps://doi.org/10.1109/csf.2013.15openalex-snapshot
Cryptographically Enforced RBAC
inferred← citeshttps://doi.org/10.1137/14100124xopenalex-snapshot
Multikey Fully Homomorphic Encryption and Applications
inferred← citeshttps://doi.org/10.1137/20m1319565openalex-snapshot
Weak Zero-Knowledge beyond the Black-Box Barrier
inferred← citeshttps://doi.org/10.1145/1008731.1008734openalex-snapshot
The random oracle methodology, revisited
inferred← citeshttps://doi.org/10.1145/1039488.1039489openalex-snapshot
Concurrent zero-knowledge
inferred← citeshttps://doi.org/10.1145/1315245.1315268openalex-snapshot
Robust computational secret sharing and a unified account of classical secret-sharing goals
inferred← citeshttps://doi.org/10.1145/1346330.1346331openalex-snapshot
Security analysis of cryptographically controlled access to XML documents
inferred← citeshttps://doi.org/10.1145/1374376.1374396openalex-snapshot
Delegating computation
inferred← citeshttps://doi.org/10.1145/1400751.1400856openalex-snapshot
Mobile proactive secret sharing
inferred← citeshttps://doi.org/10.1145/1880022.1880028openalex-snapshot
MPSS
inferred← citeshttps://doi.org/10.1145/1993636.1993652openalex-snapshot
Limits of provable security from standard assumptions
inferred← citeshttps://doi.org/10.1145/2160158.2160159openalex-snapshot
On the (im)possibility of obfuscating programs
inferred← citeshttps://doi.org/10.1145/2699436openalex-snapshot
Delegating Computation
inferred← citeshttps://doi.org/10.1145/3188745.3188870openalex-snapshot
Multi-collision resistance: a paradigm for keyless hash functions
inferred← citeshttps://doi.org/10.3233/jcs-2008-0332openalex-snapshot
Key-dependent message security under active attacks – BRSIM/UC-soundness of Dolev–Yao-style encryption with key cycles
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.