On the public citation graph

Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible

https://doi.org/10.1007/bfb0054132
0 signed · 126 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/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
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-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-48658-5_1openalex-snapshot
The First Experimental Cryptanalysis of the Data Encryption Standard
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_17openalex-snapshot
A construction of a cipher from a single pseudorandom permutation
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-68697-5_20openalex-snapshot
How to Protect DES Against Exhaustive Key Search
inferredcites →https://doi.org/10.1007/3-540-68697-5_24openalex-snapshot
On Fast and Provably Secure Message Authentication Based on Universal Hashing
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/s001459900025openalex-snapshot
A construction of a cipher from a single pseudorandom permutation
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
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.1109/sfcs.1997.646128openalex-snapshot
A concrete security treatment of symmetric encryption
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1145/258533.258581openalex-snapshot
On the construction of pseudo-random permutations
inferredcites →https://doi.org/10.1145/266420.266452openalex-snapshot
Improved security bounds for pseudorandom permutations
inferredcites →https://doi.org/10.1145/6490.6503openalex-snapshot
How to construct random functions
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_24openalex-snapshot
Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography
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-46035-7_24openalex-snapshot
A Practice-Oriented Treatment of Pseudorandom Number Generators
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-00434-7_9openalex-snapshot
The Relation Between CENC and NEMO
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-17653-2_16openalex-snapshot
Tight Time-Memory Trade-Offs for Symmetric Encryption
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-56784-2_7openalex-snapshot
The Summation-Truncation Hybrid: Reusing Discarded Bits for Free
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4openalex-snapshot
Advances in Cryptology – ASIACRYPT 2020
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_21openalex-snapshot
Beyond Birthday Bound Secure Fresh Rekeying: Application to Authenticated Encryption
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-92078-4_12openalex-snapshot
Luby-Rackoff Backwards with More Users and More Security
inferred← citeshttps://doi.org/10.1007/978-3-030-92078-4_18openalex-snapshot
Categorization of Faulty Nonce Misuse Resistant Message Authentication
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-30872-7_22openalex-snapshot
Keyed Sum of Permutations: A Simpler RP-Based PRF
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-58411-4_21openalex-snapshot
A Sponge-Based PRF with Good Multi-user Security
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-91107-1_1openalex-snapshot
Towards Optimally Secure Deterministic Authenticated Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-91107-1_3openalex-snapshot
Efficient Instances of Docked Double Decker with AES, and Application to Authenticated 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-08124-7_3openalex-snapshot
The Multi-user Security of GCM-SST and Further Enhancements
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-27239-9_5openalex-snapshot
Tweak-Length Extension for Tweakable Blockciphers
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-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-63715-0_24openalex-snapshot
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_15openalex-snapshot
Full Indifferentiable Security of the Xor of Two or More Random Permutations Using the $$\chi ^2$$ Method
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_18openalex-snapshot
Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_21openalex-snapshot
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC
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-03317-9_19openalex-snapshot
Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-04159-4_9openalex-snapshot
Cryptanalysis of Tweaked Versions of SMASH and Reparation
inferred← citeshttps://doi.org/10.1007/978-3-642-05197-5_11openalex-snapshot
A Memory Efficient Network Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-17342-4openalex-snapshot
The Block Cipher Companion
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-25516-8_24openalex-snapshot
Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal
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-45239-0_15openalex-snapshot
Security Amplification against Meet-in-the-Middle Attacks Using Whitening
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-53018-4_5openalex-snapshot
EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
inferred← citeshttps://doi.org/10.1007/978-3-662-53887-6_16openalex-snapshot
Salvaging Weak Security Bounds for Blockcipher-Based Constructions
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_10openalex-snapshot
General Practical Cryptanalysis of the Sum of Round-Reduced Block Ciphers and ZIP-AES
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_8openalex-snapshot
Mind the Bad Norms
inferred← citeshttps://doi.org/10.1007/bfb0055742openalex-snapshot
Building PRFs from PRPs
inferred← citeshttps://doi.org/10.1007/s10623-013-9882-8openalex-snapshot
Building blockcipher from small-block tweakable blockcipher
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.jnca.2013.06.002openalex-snapshot
KEDGEN2: A key establishment and derivation protocol for EPC Gen2 RFID systems
inferred← citeshttps://doi.org/10.1109/edocw.2008.33openalex-snapshot
Galois Substitution Counter Mode (GSCM)
inferred← citeshttps://doi.org/10.1109/icitst.2016.7856681openalex-snapshot
Compressive Sensing encryption modes and their security
inferred← citeshttps://doi.org/10.1109/jiot.2025.3579024openalex-snapshot
Quantum Key-Recovery Attacks on Permutation-Based Pseudorandom Functions
inferred← citeshttps://doi.org/10.1109/sere-c.2014.29openalex-snapshot
Probabilistic Cycle Detection for Schneier's Solitaire Keystream Algorithm
inferred← citeshttps://doi.org/10.1109/tifs.2023.3287412openalex-snapshot
A New Construction Method for Keystream Generators
inferred← citeshttps://doi.org/10.1109/tit.2017.2679757openalex-snapshot
Indifferentiability of the Sum of Random Permutations Toward Optimal Security
inferred← citeshttps://doi.org/10.1109/tit.2021.3109302openalex-snapshot
Systematic Security Analysis of Stream Encryption With Key Erasure
inferred← citeshttps://doi.org/10.1109/tit.2022.3171178openalex-snapshot
Proof of Mirror Theory for ξ max = 2
inferred← citeshttps://doi.org/10.1145/1103780.1103796openalex-snapshot
Efficient and provably secure ciphers for storage device block level encryption
inferred← citeshttps://doi.org/10.1145/1315245.1315303openalex-snapshot
Security under key-dependent inputs
inferred← citeshttps://doi.org/10.1145/3133956.3133995openalex-snapshot
Identity-Based Format-Preserving Encryption
inferred← citeshttps://doi.org/10.1145/3372297.3417273openalex-snapshot
Security of Streaming Encryption in Google's Tink Library
inferred← citeshttps://doi.org/10.1360/ssi-2024-0328openalex-snapshot
Beyond-birthday-bound (BBB) secure tweakable cryptographic primitives based on tweakable Even-Mansour cipher instances
inferred← citeshttps://doi.org/10.17771/pucrio.acad.51982openalex-snapshot
HX: A PROPOSAL OF A NEW STREAM CIPHER BASED ON COLLISION RESISTANT HASH FUNCTIONS
inferred← citeshttps://doi.org/10.3390/books978-3-03928-803-8openalex-snapshot
Interactions between Group Theory, Symmetry and Cryptology
inferred← citeshttps://doi.org/10.3390/e23101296openalex-snapshot
Constructions of Beyond-Birthday Secure PRFs from Random Permutations, Revisited
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.3934/amc.2019042openalex-snapshot
$\textsf{DWCDM+}$ : A BBB secure nonce based MAC
inferred← citeshttps://doi.org/10.3934/amc.2022100openalex-snapshot
$\textsf{LightMAC}$: Fork it and make it faster
inferred← citeshttps://doi.org/10.4236/jis.2017.84024openalex-snapshot
Ambiguous Multi-Symmetric Scheme and Applications
inferred← citeshttps://doi.org/10.46586/tches.v2022.i3.1-25openalex-snapshot
Security Model for Randomization-based Protected Caches
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i2.1-26openalex-snapshot
Tweakable Blockciphers for Efficient Authenticated Encryptions with Beyond the Birthday-Bound Security
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i3.228-252openalex-snapshot
Optimal PRFs from Blockcipher Designs
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i4.240-267openalex-snapshot
Reconsidering the Security Bound of AES-GCM-SIV
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i4.306-325openalex-snapshot
ZMAC+ – An Efficient Variable-output-length Variant of ZMAC
inferred← citeshttps://doi.org/10.46586/tosc.v2018.i2.161-191openalex-snapshot
Cryptanalysis of AES-PRF and Its Dual
inferred← citeshttps://doi.org/10.46586/tosc.v2018.i3.36-92openalex-snapshot
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF
inferred← citeshttps://doi.org/10.46586/tosc.v2019.i4.23-53openalex-snapshot
Efficient Side-Channel Secure Message Authentication with Better Bounds
inferred← citeshttps://doi.org/10.46586/tosc.v2019.i4.81-118openalex-snapshot
INT-RUP Secure Lightweight Parallel AE Modes
inferred← citeshttps://doi.org/10.46586/tosc.v2020.i2.1-39openalex-snapshot
On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security
inferred← citeshttps://doi.org/10.46586/tosc.v2021.i2.31-70openalex-snapshot
Permutation Based EDM: An Inverse Free BBB Secure PRF
inferred← citeshttps://doi.org/10.46586/tosc.v2021.i4.138-176openalex-snapshot
Improved Security Bound of (E/D)WCDM
inferred← citeshttps://doi.org/10.46586/tosc.v2023.i1.192-223openalex-snapshot
Tight Multi-User Security Bound of DbHtS
inferred← citeshttps://doi.org/10.46586/tosc.v2023.i2.1-46openalex-snapshot
Understanding the Duplex and Its Security
inferred← citeshttps://doi.org/10.46586/tosc.v2024.i1.35-70openalex-snapshot
Building PRFs from TPRPs: Beyond the Block and the Tweak Length Bounds
inferred← citeshttps://doi.org/10.48550/arxiv.1704.02407openalex-snapshot
More on additive triples of bijections
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/av4fvua5vopenalex-snapshot
Block Cipher Doubling for a Post-Quantum World
showing the first 102 of 103 · page through all 103
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.