On the public citation graph
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
0 signed · 287 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.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.0.co;2-1openalex-snapshot
Tiny families of functions with random properties: A quality-size trade-off for hashing
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferredcites →https://doi.org/10.1007/3-540-44750-4_3openalex-snapshot
Bucket Hashing and its Application to Fast Message Authentication
inferredcites →https://doi.org/10.1007/3-540-45961-8_19openalex-snapshot
On the Construction of Random Number Generators and Random Function Generators
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-46885-4_42openalex-snapshot
On the Security of Schnorr’s Pseudo Random Generator
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_15openalex-snapshot
LFSR-based Hashing and Authentication
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-54303-1_131openalex-snapshot
Pseudorandom permutations based on the D.E.S. scheme
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-60865-6_48openalex-snapshot
Two practical and provably secure block ciphers: BEAR and LION
inferredcites →https://doi.org/10.1007/3-540-60865-6_49openalex-snapshot
Unbalanced Feistel networks and block cipher design
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/bf00196773openalex-snapshot
Local randomness in pseudorandom sequences
inferredcites →https://doi.org/10.1007/bf01388651openalex-snapshot
Universal hashing and authentication codes
inferredcites →https://doi.org/10.1007/bfb0052345openalex-snapshot
MMH: Software message authentication in the Gbit/second rates
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(79)90044-8openalex-snapshot
Universal classes of hash functions
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/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0196-8858(87)90006-6openalex-snapshot
Strong uniform times and finite random walks
inferredcites →https://doi.org/10.1016/0885-064x(89)90015-0openalex-snapshot
On the power of two-point based sampling
inferredcites →https://doi.org/10.1109/sfcs.1982.95openalex-snapshot
Theory and application of trapdoor functions
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.1112/blms/13.1.1openalex-snapshot
Finite Permutation Groups and Finite Simple Groups
inferredcites →https://doi.org/10.1137/0213053openalex-snapshot
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0217022openalex-snapshot
How to Construct Pseudorandom Permutations from Pseudorandom Functions
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/195058.195410openalex-snapshot
Tiny families of functions with random properties (preliminary version)
inferredcites →https://doi.org/10.1145/22145.22146openalex-snapshot
A simple parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1145/266420.266452openalex-snapshot
Improved security bounds for pseudorandom permutations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3045openalex-snapshot
Guaranteeing the Diversity of Number Generators
inferred← citeshttps://doi.org/10.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_17openalex-snapshot
Engineering an External Memory Minimum Spanning Tree Algorithm
inferred← citeshttps://doi.org/10.1007/1-4020-8145-6_17openalex-snapshot
Private Information Storage with Logarithmic-Space Secure Hardware
inferred← citeshttps://doi.org/10.1007/10719994_1openalex-snapshot
On Provable Security for Conventional Cryptography
inferred← citeshttps://doi.org/10.1007/11496618_23openalex-snapshot
On the Pseudorandomness of a Modification of KASUMI Type Permutations
inferred← citeshttps://doi.org/10.1007/11538462_30openalex-snapshot
Derandomized Constructions of k-Wise (Almost) Independent Permutations
inferred← citeshttps://doi.org/10.1007/11681878_10openalex-snapshot
On the Relation Between the Ideal Cipher and the Random Oracle Models
inferred← citeshttps://doi.org/10.1007/11693383_5openalex-snapshot
Proving the Security of AES Substitution-Permutation Network
inferred← citeshttps://doi.org/10.1007/11734727_10openalex-snapshot
Benes and Butterfly Schemes Revisited
inferred← citeshttps://doi.org/10.1007/11734727_21openalex-snapshot
Hybrid Symmetric Encryption Using Known-Plaintext Attack-Secure Components
inferred← citeshttps://doi.org/10.1007/11734727_24openalex-snapshot
Expanding Weak PRF with Small Key Size
inferred← citeshttps://doi.org/10.1007/11734727_25openalex-snapshot
On Linear Systems of Equations with Distinct Variables and Small Block Size
inferred← citeshttps://doi.org/10.1007/11761679_24openalex-snapshot
Luby-Rackoff Ciphers from Weak Round Functions?
inferred← citeshttps://doi.org/10.1007/11780656_28openalex-snapshot
Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
inferred← citeshttps://doi.org/10.1007/11799313_19openalex-snapshot
A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
inferred← citeshttps://doi.org/10.1007/11935230_26openalex-snapshot
Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions
inferred← citeshttps://doi.org/10.1007/11941378_21openalex-snapshot
HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_17openalex-snapshot
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_18openalex-snapshot
Luby-Racko. Ciphers: Why XOR Is Not So Exclusive
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_16openalex-snapshot
On the Universal Hash Functions in Luby-Rackoff Cipher
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_31openalex-snapshot
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_34openalex-snapshot
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_21openalex-snapshot
Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis
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-44495-5_23openalex-snapshot
New Block Cipher DONUT Using Pairwise Perfect Decorrelation
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_24openalex-snapshot
On the Round Security of Symmetric-Key Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_25openalex-snapshot
New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext Attack
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_18openalex-snapshot
Online Ciphers and the Hash-CBC Construction
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_37openalex-snapshot
On the Minimal Hardware Complexity of Pseudorandom Function Generators
inferred← citeshttps://doi.org/10.1007/3-540-44706-7_20openalex-snapshot
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation
inferred← citeshttps://doi.org/10.1007/3-540-44983-3_13openalex-snapshot
A Polynomial-Time Universal Security Amplifier in the Class of Block Ciphers
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_22openalex-snapshot
Efficient Amplification of the Security of Weak Pseudo-random Function Generators
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_31openalex-snapshot
Does Encryption with Redundancy Provide Authenticity?
inferred← citeshttps://doi.org/10.1007/3-540-45247-8_4openalex-snapshot
Difference Distribution Attack on DONUT and Improved DONUT
inferred← citeshttps://doi.org/10.1007/3-540-45473-x_20openalex-snapshot
Round Security and Super-Pseudorandomness of MISTY Type Structure
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_12openalex-snapshot
Non-cryptographic Primitive for Pseudorandom Permutation
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_14openalex-snapshot
Generic Attacks on Feistel Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_16openalex-snapshot
Provable Security of KASUMI and 3GPP Encryption Mode f8
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_9openalex-snapshot
Ciphers with Arbitrary Finite Domains
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_8openalex-snapshot
Indistinguishability of Random Systems
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_5openalex-snapshot
Guesswork and Variation Distance as Measures of Cipher Security
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_7openalex-snapshot
Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_15openalex-snapshot
Square Hash: Fast Message Authentication via Optimized Universal Hash Functions
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/3-540-48405-1_4openalex-snapshot
Information-Theoretic Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-48519-8_13openalex-snapshot
Towards Making Luby-Rackoff Ciphers Optimal and Practical
inferred← citeshttps://doi.org/10.1007/3-540-48519-8_17openalex-snapshot
On the Construction of Variable-Input-Length Ciphers
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_30openalex-snapshot
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_19openalex-snapshot
Power analysis: attacks and countermeasures
inferred← citeshttps://doi.org/10.1007/978-0-387-71817-0_12openalex-snapshot
Block Cipher Modes of Operation from a Hardware Implementation Perspective
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-05378-9_3openalex-snapshot
Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_1469openalex-snapshot
Fuzzy Search on Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-030-71852-7_31openalex-snapshot
Provable Related-Key Security of Contracting Feistel Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_14openalex-snapshot
Related-Key Analysis of Generalized Feistel Networks with Expanding Round Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_11openalex-snapshot
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
inferred← citeshttps://doi.org/10.1007/978-3-030-84242-0_25openalex-snapshot
Subquadratic SNARGs in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-85987-9_10openalex-snapshot
Optimum Attack on 3-Round Feistel-2 Structure
inferred← citeshttps://doi.org/10.1007/978-3-030-90459-3_4openalex-snapshot
Secure Software Leasing Without Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_27openalex-snapshot
Bet-or-Pass: Adversarially Robust Bloom Filters
inferred← citeshttps://doi.org/10.1007/978-3-031-56232-7_6openalex-snapshot
Towards Minimizing Tweakable Blockcipher-Based Generalized Feistel Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-71073-5_7openalex-snapshot
Indifferentiability of 3-Round Confusion-Diffusion Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-99850-8_5openalex-snapshot
Introduction to Cryptanalysis and Generic Attacks
inferred← citeshttps://doi.org/10.1007/978-3-031-99850-8_6openalex-snapshot
Generic Attacks on Classical Feistel Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-031-99850-8_8openalex-snapshot
Generic Attacks on Contracting Feistel Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-319-02937-5_1openalex-snapshot
Differential Attacks on Generalized Feistel Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-09843-2_17openalex-snapshot
Characterization of EME with Linear Mixing
inferred← citeshttps://doi.org/10.1007/978-3-319-12060-7_10openalex-snapshot
FNR: Arbitrary Length Small Domain Block Cipher Proposal
inferred← citeshttps://doi.org/10.1007/978-3-319-19962-7_14openalex-snapshot
Constant Size Ring Signature Without Random Oracle
inferred← citeshttps://doi.org/10.1007/978-3-319-40367-0_22openalex-snapshot
Authenticated Encryption with Small Stretch (or, How to Accelerate AERO)
inferred← citeshttps://doi.org/10.1007/978-3-319-44524-3_12openalex-snapshot
Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-49530-9_5openalex-snapshot
Introduction to Cryptanalysis and Generic Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-61273-7_16openalex-snapshot
Improvements of Attacks on Various Feistel Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_24openalex-snapshot
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-96884-1_8openalex-snapshot
The Curse of Small Domains: New Attacks on Format-Preserving Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_8openalex-snapshot
Algorithms for Scalable Storage Servers
inferred← citeshttps://doi.org/10.1007/978-3-540-24638-1_25openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/978-3-540-24660-2_23openalex-snapshot
A Parallelizable Enciphering Mode
inferred← citeshttps://doi.org/10.1007/978-3-540-25937-4_23openalex-snapshot
Ciphers Secure against Related-Key Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_20openalex-snapshot
How to Re-use Round Function in Super-Pseudorandom Permutation
inferred← citeshttps://doi.org/10.1007/978-3-540-27800-9_38openalex-snapshot
ManTiCore: Encryption with Joint Cipher-State Authentication
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_7openalex-snapshot
Security of Random Feistel Schemes with 5 or More Rounds
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_3openalex-snapshot
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_25openalex-snapshot
EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_18openalex-snapshot
Collision Attack and Pseudorandomness of Reduced-Round Camellia
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_23openalex-snapshot
Efficient Constructions of Variable-Input-Length Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_7openalex-snapshot
Security of the MISTY Structure in the Luby-Rackoff Model: Improved Results
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_28openalex-snapshot
A Tweakable Enciphering Mode
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_30openalex-snapshot
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_6openalex-snapshot
On Cryptographic Assumptions and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_2openalex-snapshot
Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_14openalex-snapshot
A Proof of Security in O(2 n ) for the Benes Scheme
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_53openalex-snapshot
Robust Multi-property Combiners for Hash Functions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_31openalex-snapshot
Feistel Networks Made Public, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_23openalex-snapshot
Invertible Universal Hashing and the TET Encryption Mode
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_8openalex-snapshot
Improved Security Analysis of XEX and LRW Modes
inferred← citeshttps://doi.org/10.1007/978-3-540-74619-5_7openalex-snapshot
How to Enrich the Message Space of a Cipher
inferred← citeshttps://doi.org/10.1007/978-3-540-76788-6_15openalex-snapshot
Improving Upon the TET Mode of Operation
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_20openalex-snapshot
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_21openalex-snapshot
On Tweaking Luby-Rackoff Blockciphers
inferred← citeshttps://doi.org/10.1007/978-3-540-77026-8_19openalex-snapshot
Tweakable Enciphering Schemes from Hash-Sum-Expansion
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_2openalex-snapshot
Tweakable Pseudorandom Permutation from Generalized Feistel Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-00457-5_9openalex-snapshot
Security Amplification for Interactive Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/978-3-642-01440-6_14openalex-snapshot
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
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-03356-8_17openalex-snapshot
How to Encipher Messages on a Small Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-04159-4_21openalex-snapshot
The “Coefficients H” Technique
inferred← citeshttps://doi.org/10.1007/978-3-642-05445-7_19openalex-snapshot
Format-Preserving Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-11145-7_4openalex-snapshot
Security Analysis of the GF-NLFSR Structure and Four-Cell Block Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_17openalex-snapshot
A Domain Extender for the Ideal Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-14597-1_15openalex-snapshot
Improved Cryptanalysis of the FOX Block Cipher
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_33openalex-snapshot
On Generalized Feistel Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_36openalex-snapshot
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_6openalex-snapshot
Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-17401-8_7openalex-snapshot
The Characterization of Luby-Rackoff and Its Optimum Single-Key Variants
inferred← citeshttps://doi.org/10.1007/978-3-642-19074-2_16openalex-snapshot
Online Ciphers from Tweakable Blockciphers
inferred← citeshttps://doi.org/10.1007/978-3-642-22890-2_9openalex-snapshot
Best Effort and Practice Activation Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25513-7_8openalex-snapshot
On Permutation Layer of Type 1, Source-Heavy, and Target-Heavy Generalized Feistel Structures
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-28914-9_16openalex-snapshot
On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_27openalex-snapshot
Counterexamples to Hardness Amplification beyond Negligible
inferred← citeshttps://doi.org/10.1007/978-3-642-31284-7_7openalex-snapshot
Length-Doubling Ciphers and Tweakable Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_1openalex-snapshot
An Enciphering Scheme Based on a Card Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_5openalex-snapshot
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_3openalex-snapshot
Hardness Preserving Reductions via Cuckoo Hashing
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-642-55220-5_18openalex-snapshot
Sometimes-Recurse Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_15openalex-snapshot
Extended Generalized Feistel Networks Using Matrix Representation
inferred← citeshttps://doi.org/10.1007/978-3-662-43826-8_2openalex-snapshot
A Security Analysis of Key Expansion Functions Using Pseudorandom Permutations
inferred← citeshttps://doi.org/10.1007/978-3-662-43933-3_18openalex-snapshot
Towards Understanding the Known-Key Security of Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-3-662-45355-1_16openalex-snapshot
Evaluation of Format- Preserving Encryption Algorithms for Critical Infrastructure Protection
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_14openalex-snapshot
The Related-Key Analysis of Feistel Constructions
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-46706-0_31openalex-snapshot
Efficient Fuzzy Search on Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_2openalex-snapshot
Robust Authenticated-Encryption AEZ and the Problem That It Solves
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_5openalex-snapshot
On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-48800-3_7openalex-snapshot
An Inverse-Free Single-Keyed Tweakable Enciphering Scheme
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_24openalex-snapshot
Indifferentiability of Confusion-Diffusion Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-52993-5_2openalex-snapshot
RIV for Robust Authenticated Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-53018-4_4openalex-snapshot
Indifferentiability of 8-Round Feistel Networks
inferred← citeshttps://doi.org/10.1007/978-981-19-8069-5_14openalex-snapshot
Analysis of a New Practical SPN-Based Scheme in the Luby-Rackoff Model
inferred← citeshttps://doi.org/10.1007/978-981-96-0947-5_11openalex-snapshot
Robust AE With Committing Security
inferred← citeshttps://doi.org/10.1007/bfb0054131openalex-snapshot
A formal treatment of remotely keyed encryption
inferred← citeshttps://doi.org/10.1007/s00145-002-0007-1openalex-snapshot
Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
inferred← citeshttps://doi.org/10.1007/s00145-002-9839-yopenalex-snapshot
The Security of Feistel Ciphers with Six Rounds or Less
inferred← citeshttps://doi.org/10.1007/s00145-003-0220-6openalex-snapshot
Decorrelation: A Theory for Block Cipher Security
inferred← citeshttps://doi.org/10.1007/s00145-006-0438-1openalex-snapshot
Constant-Round Oblivious Transfer in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/s00145-011-9106-1openalex-snapshot
On-line Ciphers and the Hash-CBC Constructions
inferred← citeshttps://doi.org/10.1007/s00145-013-9148-7openalex-snapshot
Robust Multi-Property Combiners for Hash Functions
inferred← citeshttps://doi.org/10.1007/s00145-017-9262-zopenalex-snapshot
Deterministic Encryption with the Thorp Shuffle
inferred← citeshttps://doi.org/10.1007/s00145-018-9293-0openalex-snapshot
Hardness-Preserving Reductions via Cuckoo Hashing
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/s00446-014-0238-zopenalex-snapshot
Simple and optimal randomized fault-tolerant rumor spreading
inferred← citeshttps://doi.org/10.1007/s00453-022-01057-0openalex-snapshot
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
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-005-3562-2openalex-snapshot
Luby–Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme
inferred← citeshttps://doi.org/10.1007/s10623-010-9386-8openalex-snapshot
On Lai–Massey and quasi-Feistel ciphers
inferred← citeshttps://doi.org/10.1007/s10623-010-9414-8openalex-snapshot
Notions and relations for RKA-secure permutation and function families
inferred← citeshttps://doi.org/10.1007/s10623-010-9462-0openalex-snapshot
On unbalanced Feistel networks with contracting MDS diffusion
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-016-0235-2openalex-snapshot
Generic attacks on the Lai–Massey scheme
inferred← citeshttps://doi.org/10.1007/s10623-023-01288-4openalex-snapshot
BBB security for 5-round even-Mansour-based key-alternating Feistel ciphers
inferred← citeshttps://doi.org/10.1007/s11390-006-0082-0openalex-snapshot
Pseudorandomness of Camellia-Like Scheme
inferred← citeshttps://doi.org/10.1007/s12095-017-0244-7openalex-snapshot
Generic attacks with standard deviation analysis on a-feistel schemes
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.112openalex-snapshot
Performance improvement for the GGM-construction of pseudorandom functions
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.012openalex-snapshot
A general mixing strategy for the ECB-Mix-ECB mode of operation
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.10.012openalex-snapshot
Pseudorandomness analysis of the (extended) Lai–Massey scheme
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.014openalex-snapshot
Tweakable enciphering schemes using only the encryption function of a block cipher
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.007openalex-snapshot
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00163-5openalex-snapshot
Low discrepancy sets yield approximate min-wise independent permutation families
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00245-7openalex-snapshot
Non-cryptographic primitive for pseudorandom permutation
inferred← citeshttps://doi.org/10.1017/s0963548312000478openalex-snapshot
Improved Mixing Time Bounds for the Thorp Shuffle
inferred← citeshttps://doi.org/10.1023/b:desi.0000029218.71926.b0openalex-snapshot
Anonymous Membership Broadcast Schemes
inferred← citeshttps://doi.org/10.1109/access.2019.2918350openalex-snapshot
A Structural Attack on Type-I Generalized Feistel Networks
inferred← citeshttps://doi.org/10.1109/ccc.2011.35openalex-snapshot
Making Branching Programs Oblivious Requires Superlogarithmic Overhead
inferred← citeshttps://doi.org/10.1109/ciss.2017.7926080openalex-snapshot
A simple construction of encryption for a tiny domain message
inferred← citeshttps://doi.org/10.1109/comswa.2008.4554419openalex-snapshot
Key-linked block ciphers with input-output shuffling applied to remotely keyed encryption
inferred← citeshttps://doi.org/10.1109/focs.2006.33openalex-snapshot
Hardness of Learning Halfspaces with Noise
inferred← citeshttps://doi.org/10.1109/focs.2010.80openalex-snapshot
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
inferred← citeshttps://doi.org/10.1109/focs.2012.37openalex-snapshot
How to Construct Quantum Random Functions
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00097openalex-snapshot
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits
inferred← citeshttps://doi.org/10.1109/icc.2017.7996734openalex-snapshot
A flexible authenticated lightweight cipher using Even-Mansour construction
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358443openalex-snapshot
High capacity image steganography using wavelet-based fusion
inferred← citeshttps://doi.org/10.1109/isspa.2007.4555581openalex-snapshot
Pseudorandom shuffling in block ciphers combiners with smart card applications
inferred← citeshttps://doi.org/10.1109/isspit.2007.4458045openalex-snapshot
Key-Joined Block Ciphers with Input-Output Pseudorandom Shuffling Applied to Remotely Keyed Authenticated Encryption
inferred← citeshttps://doi.org/10.1109/jiot.2018.2848962openalex-snapshot
A Novel Secure and Efficient Data Aggregation Scheme for IoT
inferred← citeshttps://doi.org/10.1109/tc.2015.2468218openalex-snapshot
Extended Generalized Feistel Networks Using Matrix Representation to Propose a New Lightweight Block Cipher: Lilliput
inferred← citeshttps://doi.org/10.1109/tit.2008.917623openalex-snapshot
HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach
inferred← citeshttps://doi.org/10.1109/tit.2009.2027487openalex-snapshot
Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
inferred← citeshttps://doi.org/10.1137/070685798openalex-snapshot
Hardness of Learning Halfspaces with Noise
inferred← citeshttps://doi.org/10.1145/2018584.2018589openalex-snapshot
On preserving privacy in content-oriented networks
showing the first 200 of 243 · page through all 243
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.