Public-Seed Pseudorandom Permutations
From MaRDI portal
Publication:5738982
DOI10.1007/978-3-319-56614-6_14zbMath1415.94461OpenAlexW2598263564MaRDI QIDQ5738982
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56614-6_14
Related Items
Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Extracting randomness from extractor-dependent sources
Uses Software
Cites Work
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- A construction of a cipher from a single pseudorandom permutation.
- Fast garbling of circuits under standard assumptions
- Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- Point-Function Obfuscation: A Framework and Generic Constructions
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- Indifferentiability of 8-Round Feistel Networks
- The Magic of ELFs
- On the Indifferentiability of Key-Alternating Ciphers
- Instantiating Random Oracles via UCEs
- Cryptography from Compression Functions: The UCE Bridge to the ROM
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction
- Using Indistinguishability Obfuscation via UCEs
- Towards Understanding the Known-Key Security of Block Ciphers
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- A Formal Treatment of Backdoored Pseudorandom Generators
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
- Careful with Composition: Limitations of the Indifferentiability Framework
- The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
- Improved Garbled Circuit: Free XOR Gates and Applications
- Sponge-Based Pseudo-Random Number Generators
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Known-Key Distinguishers for Some Block Ciphers
- Chosen Ciphertext Security via UCE
- Salvaging Indifferentiability in a Multi-stage Setting
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- 10-Round Feistel is Indifferentiable from an Ideal Cipher
- Theory of Cryptography
This page was built for publication: Public-Seed Pseudorandom Permutations
