On the public citation graph

https://doi.org/10.2139/ssrn.4601530

0 signed · 32 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.1002/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-popenalex-extracted
Tight Bounds on Quantum Searching
inferredcites →https://doi.org/10.1007/3-540-48405-1_34openalex-extracted
Secure Integration of Asymmetric and Symmetric Encryption Schemes
inferredcites →https://doi.org/10.1007/978-3-030-17659-4_7openalex-extracted
On Finding Quantum Multi-collisions
inferredcites →https://doi.org/10.1007/978-3-030-26951-7_9openalex-extracted
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
inferredcites →https://doi.org/10.1007/978-3-319-29360-8_6openalex-extracted
Quantum Collision-Resistance of Non-uniformly Distributed Functions
inferredcites →https://doi.org/10.1007/978-3-319-78375-8_5openalex-extracted
Multi-Collision Resistant Hash Functions and Their Applications
inferredcites →https://doi.org/10.1007/978-3-319-79063-3_22openalex-extracted
Quantum Collision-Finding in Non-uniform Random Functions
inferredcites →https://doi.org/10.1007/978-3-540-74143-5_13openalex-extracted
Security-Amplifying Combiners for Collision-Resistant Hash Functions
inferredcites →https://doi.org/10.1007/978-3-662-53008-5_8openalex-extracted
Breaking Symmetric Cryptosystems Using Quantum Period Finding
inferredcites →https://doi.org/10.1007/978-3-662-53644-5_8openalex-extracted
Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
inferredcites →https://doi.org/10.1007/978-3-662-53887-6_10openalex-extracted
When Are Fuzzy Extractors Possible?
inferredcites →https://doi.org/10.1007/s00453-022-01092-xopenalex-extracted
Near-Optimal Quantum Algorithms for String Problems
inferredcites →https://doi.org/10.1109/focs.2004.54openalex-extracted
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1109/focs.2012.37openalex-extracted
How to Construct Quantum Random Functions
inferredcites →https://doi.org/10.1109/focs.2014.31openalex-extracted
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
inferredcites →https://doi.org/10.1109/focs.2014.57openalex-extracted
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-extracted
New directions in cryptography
inferredcites →https://doi.org/10.1137/090745854openalex-extracted
Search via Quantum Walk
inferredcites →https://doi.org/10.1137/1.9781611973105.106openalex-extracted
Nested Quantum Walks with Quantum Data Structures
inferredcites →https://doi.org/10.1137/s0036144598347011openalex-extracted
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-extracted
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/1008731.1008735openalex-extracted
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1145/237814.237866openalex-extracted
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/261342.261346openalex-extracted
Quantum cryptanalysis of hash and claw-free functions
inferredcites →https://doi.org/10.1145/335305.335394openalex-extracted
Quantum lower bounds by quantum arguments
inferredcites →https://doi.org/10.1145/357980.358017openalex-extracted
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-extracted
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.26421/qic14.13-14-2openalex-extracted
A quantum lower bound for distinguishing random functions from random permutations
inferredcites →https://doi.org/10.26421/qic15.7-8-2openalex-extracted
A note on the quantum collision and set equality problems
inferredcites →https://doi.org/10.26421/qic18.15-16-4openalex-extracted
Quantum collision-resistance of non-uniformly distributed functions: upper and lower bounds
inferredcites →https://doi.org/10.4086/toc.2005.v001a002openalex-extracted
inferredcites →https://doi.org/10.4086/toc.2005.v001a003openalex-extracted
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.