Public-seed pseudorandom permutations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 708821
- Naor-Reingold goes public: the complexity of known-key security
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- How to build pseudorandom functions from public random permutations
- On the construction of pseudorandom permutations: Luby-Rackoff revisited
Cites work
- 10-round Feistel is indifferentiable from an ideal cipher
- A construction of a cipher from a single pseudorandom permutation.
- A formal treatment of backdoored pseudorandom generators
- Careful with composition: limitations of the indifferentiability framework
- Chaskey: an efficient MAC algorithm for 32-bit microcontrollers
- Chosen ciphertext security via UCE
- Contention in cryptoland: obfuscation, leakage and UCE
- Cryptography from compression functions: the UCE bridge to the ROM
- Fast garbling of circuits under standard assumptions
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Indifferentiability of 8-Round Feistel Networks
- Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
- Instantiating random oracles via UCEs
- Known-Key Distinguishers for Some Block Ciphers
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the indifferentiability of key-alternating ciphers
- On the Indifferentiability of the Sponge Construction
- On the public indifferentiability and correlation intractability of the 6-round Feistel construction
- Point-function obfuscation: a framework and generic constructions
- Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
- Salvaging indifferentiability in a multi-stage setting
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- Sponge-based pseudo-random number generators
- The equivalence of the random oracle model and the ideal cipher model, revisited
- The exact PRF security of truncation: tight bounds for keyed sponges and truncated CBC
- The Magic of ELFs
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
- Towards Understanding the Known-Key Security of Block Ciphers
- Using indistinguishability obfuscation via UCEs
Cited in
(6)- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- Naor-Reingold goes public: the complexity of known-key security
- Extracting randomness from extractor-dependent sources
- Sequential indifferentiability of confusion-diffusion networks
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules)
- Beyond Uber: instantiating generic groups via PGGs
This page was built for publication: Public-seed pseudorandom permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738982)
