On the public citation graph
Many-to-one trapdoor functions and their relation to public-key cryptosystems
0 signed · 69 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/bfb0052255openalex-snapshot
Towards realizing random oracles: Hash functions that hide all partial information
inferredcites →https://doi.org/10.1007/bfb0055735openalex-snapshot
Many-to-one trapdoor functions and their relation to public-key cryptosystems
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1109/sfcs.1977.18openalex-snapshot
On taking roots in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1982.45openalex-snapshot
Theory and application of trapdoor functions
inferredcites →https://doi.org/10.1109/sfcs.1989.63483openalex-snapshot
One-way functions are essential for complexity based cryptography
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/100216.100273openalex-snapshot
Public-key cryptosystems provably secure against chosen ciphertext attacks
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/276698.276741openalex-snapshot
The random oracle methodology, revisited (preliminary version)
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot
Limits on the provable consequences of one-way permutations
inferredcites →https://doi.org/10.2307/2004849openalex-snapshot
Factoring Polynomials Over Large Finite Fields
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.717openalex-snapshot
Efficient three‐party encrypted key exchange using trapdoor functions
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_7openalex-snapshot
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_9openalex-snapshot
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_7openalex-snapshot
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_16openalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1007/978-3-030-25510-7_13openalex-snapshot
Tighter Security Proofs for Generic Key Encapsulation Mechanism in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-26954-8_2openalex-snapshot
CCA Security and Trapdoor Functions via Key-Dependent-Message Security
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_28openalex-snapshot
Chosen Ciphertext Security from Injective Trapdoor Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-30122-3_5openalex-snapshot
A New Class of Trapdoor Verifiable Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-10879-7_8openalex-snapshot
Publicly Evaluable Pseudorandom Functions and Their Applications
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-76953-0_26openalex-snapshot
Regularly Lossy Functions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_13openalex-snapshot
Trapdoor Functions from the Computational Diffie-Hellman Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-30191-2_1openalex-snapshot
On the Minimal Assumptions of Group Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_24openalex-snapshot
Towards a Separation of Semantic and CCA Security for Public Key Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-78524-8_24openalex-snapshot
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
inferred← citeshttps://doi.org/10.1007/978-3-642-04846-3_8openalex-snapshot
Reducing Complexity Assumptions for Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_34openalex-snapshot
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
inferred← citeshttps://doi.org/10.1007/978-3-642-13708-2_3openalex-snapshot
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-18178-8_25openalex-snapshot
One-Time Trapdoor One-Way Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_15openalex-snapshot
Identity-Based (Lossy) Trapdoor Functions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_13openalex-snapshot
Building Lossy Trapdoor Functions from Lossy Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_15openalex-snapshot
Non-Malleable Functions and Their Applications
inferred← citeshttps://doi.org/10.1007/s00145-005-0317-1openalex-snapshot
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/s00145-017-9254-zopenalex-snapshot
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption
inferred← citeshttps://doi.org/10.1007/s00145-021-09405-zopenalex-snapshot
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
inferred← citeshttps://doi.org/10.1007/s00145-022-09422-6openalex-snapshot
Non-Malleable Functions and their Applications
inferred← citeshttps://doi.org/10.1007/s11432-011-4370-0openalex-snapshot
IK-CPA security implies IE-CCA security in the random oracle model
inferred← citeshttps://doi.org/10.1016/j.csi.2003.12.001openalex-snapshot
A novel three-party encrypted key exchange protocol
inferred← citeshttps://doi.org/10.1016/j.csi.2007.08.010openalex-snapshot
Security enhancement for a three-party encrypted key exchange protocol against undetectable on-line password guessing attacks
inferred← citeshttps://doi.org/10.1016/j.csi.2007.08.018openalex-snapshot
Improving the novel three-party encrypted key exchange protocol
inferred← citeshttps://doi.org/10.1016/j.csi.2009.03.002openalex-snapshot
Cryptanalysis of two three-party encrypted key exchange protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.043openalex-snapshot
Regular lossy functions and their applications in leakage-resilient cryptography
inferred← citeshttps://doi.org/10.1109/bwcca.2011.86openalex-snapshot
A Time Constraint Three-Party Encrypted Key Exchange Protocol
inferred← citeshttps://doi.org/10.1109/csf.2018.00015openalex-snapshot
Backdoored Hash Functions: Immunizing HMAC and HKDF
inferred← citeshttps://doi.org/10.1109/icmtma.2014.108openalex-snapshot
Password Authentication Scheme Preserving Identity Privacy
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043205openalex-snapshot
Trade-offs in Cryptosystems by Boolean and Quantum Circuits
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892119openalex-snapshot
Lower bounds on the efficiency of generic cryptographic constructions
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892121openalex-snapshot
The relationship between public key encryption and oblivious transfer
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959887openalex-snapshot
On the impossibility of basing trapdoor functions on trapdoor predicates
inferred← citeshttps://doi.org/10.1109/tifs.2019.2937634openalex-snapshot
A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers
inferred← citeshttps://doi.org/10.1109/tit.2021.3087425openalex-snapshot
Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization
inferred← citeshttps://doi.org/10.1145/2832987.2833072openalex-snapshot
QoS web service Security Access Control case study using HTTP Secured Socket Layer Approach
inferred← citeshttps://doi.org/10.1145/3340037.3340064openalex-snapshot
Computation-Efficient Three-Party Encrypted Key Exchange for Telecare Medicine Information Systems
inferred← citeshttps://doi.org/10.1155/2014/475678openalex-snapshot
Preimage Selective Trapdoor Function: How to Repair an Easy Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0320697openalex-snapshot
Inverse reconstruction of model cells: Extracting structural and molecular insights through infrared spectroscopic cytology
inferred← citeshttps://doi.org/10.1631/fitee.1700005openalex-snapshot
Double-authentication-preventing signatures revisited: new definition and construction from chameleon hash
showing the first 49 of 50 · page through all 50
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.