On the public citation graph
Building PRFs from PRPs
0 signed · 99 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_42openalex-snapshot
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
inferredcites →https://doi.org/10.1007/3-540-44750-4_1openalex-snapshot
MDx-MAC and Building Fast MACs from Hash Functions
inferredcites →https://doi.org/10.1007/3-540-44750-4_2openalex-snapshot
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
inferredcites →https://doi.org/10.1007/3-540-46766-1_25openalex-snapshot
New Results on Pseudorandom Permutation Generators Based on the Des Scheme
inferredcites →https://doi.org/10.1007/3-540-46877-3_12openalex-snapshot
How to Construct Pseudorandom Permutations from Single Pseudorandom Functions
inferredcites →https://doi.org/10.1007/3-540-46885-4_41openalex-snapshot
Impossibility and Optimality Results on Constructing Pseudorandom Permutations
inferredcites →https://doi.org/10.1007/3-540-47555-9_21openalex-snapshot
A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
inferredcites →https://doi.org/10.1007/3-540-47555-9_22openalex-snapshot
How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function
inferredcites →https://doi.org/10.1007/3-540-47555-9_23openalex-snapshot
A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function
inferredcites →https://doi.org/10.1007/3-540-48658-5_32openalex-snapshot
The Security of Cipher Block Chaining
inferredcites →https://doi.org/10.1007/3-540-57332-1_16openalex-snapshot
On necessary and sufficient conditions for the construction of super pseudorandom permutations
inferredcites →https://doi.org/10.1007/3-540-68339-9_27openalex-snapshot
Foiling Birthday Attacks in Length-Doubling Transformations
inferredcites →https://doi.org/10.1007/3-540-69710-1_8openalex-snapshot
About Feistel Schemes with Six (or More) Rounds
inferredcites →https://doi.org/10.1007/bfb0054132openalex-snapshot
Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible
inferredcites →https://doi.org/10.1007/pl00003817openalex-snapshot
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
inferredcites →https://doi.org/10.1109/sfcs.1996.548510openalex-snapshot
Pseudorandom functions revisited: the cascade construction and its concrete security
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1145/266420.266452openalex-snapshot
Improved security bounds for pseudorandom permutations
inferredcites →https://doi.org/10.1515/9780691206844openalex-snapshot
Pseudorandomness and Cryptographic Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11799313_20openalex-snapshot
New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_42openalex-snapshot
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_34openalex-snapshot
The Sum of PRPs Is a Secure PRF
inferred← citeshttps://doi.org/10.1007/3-540-45661-9_19openalex-snapshot
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit A New Construction
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_17openalex-snapshot
Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_9openalex-snapshot
Short Variable Length Domain Extenders with Beyond Birthday Bound Security
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_16openalex-snapshot
Linking Stam’s Bounds with Generalized Truncation
inferred← citeshttps://doi.org/10.1007/978-3-030-20951-3_11openalex-snapshot
The Advantage of Truncated Permutations
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_10openalex-snapshot
How to Build Pseudorandom Functions from Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-030-34578-5_7openalex-snapshot
Indifferentiability of Truncated Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_8openalex-snapshot
Mind the Composition: Birthday Bound Attacks on EWCDMD and SoKAC21
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot
On the Streaming Indistinguishability of a Random Permutation and a Random Function
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_7openalex-snapshot
The Summation-Truncation Hybrid: Reusing Discarded Bits for Free
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_8openalex-snapshot
Coupling of Random Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_25openalex-snapshot
How to Build Optimally Secure PRFs Using Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-030-77886-6_13openalex-snapshot
Leakage Resilient Value Comparison with Application to Message Authentication
inferred← citeshttps://doi.org/10.1007/978-3-030-92078-4_12openalex-snapshot
Luby-Rackoff Backwards with More Users and More Security
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_25openalex-snapshot
Quantum Attacks on PRFs Based on Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-22966-4_23openalex-snapshot
Multi-user Security of the Sum of Truncated Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-30634-1_16openalex-snapshot
Proof of Mirror Theory for a Wide Range of $$\xi _{\max }$$
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_23openalex-snapshot
Improved Multi-user Security Using the Squared-Ratio Method
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_21openalex-snapshot
Revisiting the Indifferentiability of the Sum of Permutations
inferred← citeshttps://doi.org/10.1007/978-3-031-58716-0_2openalex-snapshot
Tight Indistinguishability Bounds for the XOR of Independent Random Permutations by Fourier Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-68385-5_15openalex-snapshot
Information-Theoretic Security with Asymmetries
inferred← citeshttps://doi.org/10.1007/978-3-031-80308-6_8openalex-snapshot
Proving the Security of the Extended Summation-Truncation Hybrid
inferred← citeshttps://doi.org/10.1007/978-3-031-91095-1_1openalex-snapshot
Plinko: Single-Server PIR with Efficient Updates via Invertible PRFs
inferred← citeshttps://doi.org/10.1007/978-3-031-91107-1_8openalex-snapshot
ChiLow and ChiChi: New Constructions for Code Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-91107-1_9openalex-snapshot
Combining Outputs of a Random Permutation: New Constructions and Tight Security Bounds by Fourier Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-25333-0_13openalex-snapshot
Upper Bound on Information-Theoretic Security of Permutation-Based Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-25333-0_14openalex-snapshot
How to Build a Short-Input Random Oracle from Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_30openalex-snapshot
On the XOR of Multiple Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-319-39555-5_2openalex-snapshot
A Cryptographic Analysis of UMTS/LTE AKA
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_21openalex-snapshot
XOR of PRPs in a Quantum World
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_17openalex-snapshot
Information-Theoretic Indistinguishability via the Chi-Squared Method
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_19openalex-snapshot
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_17openalex-snapshot
Optimal Forgeries Against Polynomial-Based MACs and GCM
inferred← citeshttps://doi.org/10.1007/978-3-540-39887-5_26openalex-snapshot
Practical Symmetric On-Line Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_21openalex-snapshot
“Pseudorandom Intermixing”: A Tool for Shared Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-68914-0_25openalex-snapshot
On the Security of the CCM Encryption Mode and of a Slight Variant
inferred← citeshttps://doi.org/10.1007/978-3-540-77360-3_21openalex-snapshot
A Generic Method to Design Modes of Operation Beyond the Birthday Bound
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_22openalex-snapshot
A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-17401-8_6openalex-snapshot
Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-38980-1_10openalex-snapshot
Generic Attacks for the Xor of k Random Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_22openalex-snapshot
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_15openalex-snapshot
The Indistinguishability of the XOR of $$k$$ Permutations
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_18openalex-snapshot
Optimally Secure Block Ciphers from Ideal Primitives
inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_5openalex-snapshot
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
inferred← citeshttps://doi.org/10.1007/978-981-96-0957-4_1openalex-snapshot
Efficient Variants of TNT with BBB Security
inferred← citeshttps://doi.org/10.1007/s00145-017-9253-0openalex-snapshot
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
inferred← citeshttps://doi.org/10.1007/s10207-008-0075-9openalex-snapshot
Elastic block ciphers: method, security and instantiations
inferred← citeshttps://doi.org/10.1007/s10623-018-0470-9openalex-snapshot
Analysis of the single-permutation encrypted Davies–Meyer construction
inferred← citeshttps://doi.org/10.1007/s10623-018-0528-8openalex-snapshot
Beyond-birthday secure domain-preserving PRFs from a single permutation
inferred← citeshttps://doi.org/10.1007/s10623-025-01698-6openalex-snapshot
Forking sums of permutations for highly secure and efficient PRFs
inferred← citeshttps://doi.org/10.1007/s12095-017-0276-zopenalex-snapshot
A note on the chi-square method: A tool for proving cryptographic security
inferred← citeshttps://doi.org/10.1016/j.comcom.2020.05.022openalex-snapshot
Security definitions, entropy measures and constructions for implicitly detecting data corruption
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.029openalex-snapshot
The advantage of truncated permutations
inferred← citeshttps://doi.org/10.1109/iscc47284.2019.8969677openalex-snapshot
IVP: A Three Level Confusion-Diffusion Network Supporting Implicit Data Integrity
inferred← citeshttps://doi.org/10.1109/tifs.2023.3287412openalex-snapshot
A New Construction Method for Keystream Generators
inferred← citeshttps://doi.org/10.1145/1315245.1315303openalex-snapshot
Security under key-dependent inputs
inferred← citeshttps://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferred← citeshttps://doi.org/10.1145/2503778.2503784openalex-snapshot
Splittable pseudorandom number generators using cryptographic hashing
inferred← citeshttps://doi.org/10.1145/288090.288096openalex-snapshot
Key management for encrypted broadcast
inferred← citeshttps://doi.org/10.1145/354876.354879openalex-snapshot
Key management for encrypted broadcast
inferred← citeshttps://doi.org/10.1145/3704877openalex-snapshot
Approximate Relational Reasoning for Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.3390/e24040462openalex-snapshot
A Survey on Applications of H-Technique: Revisiting Security Analysis of PRP and PRF
inferred← citeshttps://doi.org/10.3390/sym11121485openalex-snapshot
Block Cipher in the Ideal Cipher Model: A Dedicated Permutation Modeled as a Black-Box Public Random Permutation
inferred← citeshttps://doi.org/10.4236/jis.2017.84024openalex-snapshot
Ambiguous Multi-Symmetric Scheme and Applications
inferred← citeshttps://doi.org/10.56553/popets-2024-0026openalex-snapshot
SocIoTy: Practical Cryptography in Smart Home Contexts
inferred← citeshttps://doi.org/10.62056/a3n59qgxqopenalex-snapshot
Twinkle: A family of Low-latency Schemes for Authenticated Encryption and Pointer Authentication
inferred← citeshttps://doi.org/10.62056/a3n59qxqiopenalex-snapshot
Sequential Indifferentiability of STH and EDM
inferred← citeshttps://doi.org/10.62056/a3waksuc2openalex-snapshot
On TRP-RF Switch in the Quantum Query Model
inferred← citeshttps://doi.org/10.62056/anxra6qiuopenalex-snapshot
Understanding and Simplifying the UK NCSC Modes GLEVIAN and VIGORNIAN
inferred← citeshttps://doi.org/10.62056/ayl5w4fe-3openalex-snapshot
Fault-tolerant Verifiable Dynamic SSE with Forward and Backward Privacy
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.