Public-Seed Pseudorandom Permutations (Q5738982)

scientific article; zbMATH DE number 6729790

Language	Label	Description	Also known as
English	Public-Seed Pseudorandom Permutations	scientific article; zbMATH DE number 6729790

Statements

instance of

scholarly article

0 references

title

Public-Seed Pseudorandom Permutations (English)

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

zbMATH Keywords

symmetric cryptography

0 references

UCE

0 references

permutation-based cryptography

0 references

assumptions

0 references

indifferentiability

0 references

describes a project that uses

JustGarble

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-56614-6_14

0 references

cites work

On the Indifferentiability of Key-Alternating Ciphers

0 references

Towards Understanding the Known-Key Security of Block Ciphers

0 references

Security of Keyed Sponge Constructions Using a Modular Proof Approach

0 references

Q4783716

0 references

Hash-Function Based PRFs: AMAC and Its Multi-User Security

0 references

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model

0 references

Instantiating Random Oracles via UCEs

0 references

Cryptography from Compression Functions: The UCE Bridge to the ROM

0 references

The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

0 references

Point-Function Obfuscation: A Framework and Generic Constructions

0 references

Contention in Cryptoland: Obfuscation, Leakage and UCE

0 references

On the Indifferentiability of the Sponge Construction

0 references

Sponge-Based Pseudo-Random Number Generators

0 references

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources

0 references

Using Indistinguishability Obfuscation via UCEs

0 references

Merkle-Damgård Revisited: How to Construct a Hash Function

0 references

How to build an ideal cipher: the indifferentiability of the Feistel construction

0 references

10-Round Feistel is Indifferentiable from an Ideal Cipher

0 references

Indifferentiability of 8-Round Feistel Networks

0 references

A Formal Treatment of Backdoored Pseudorandom Generators

0 references

A construction of a cipher from a single pseudorandom permutation.

0 references

The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC

0 references

Fast garbling of circuits under standard assumptions

0 references

The equivalence of the random oracle model and the ideal cipher model, revisited

0 references

Known-Key Distinguishers for Some Block Ciphers

0 references

Improved Garbled Circuit: Free XOR Gates and Applications

0 references

How to Construct Pseudorandom Permutations from Pseudorandom Functions

0 references

On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction

0 references

Chosen Ciphertext Security via UCE

0 references

Theory of Cryptography

0 references

Salvaging Indifferentiability in a Multi-stage Setting

0 references

Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers

0 references

Careful with Composition: Limitations of the Indifferentiability Framework

0 references

Security/Efficiency Tradeoffs for Permutation-Based Hashing

0 references

The Magic of ELFs

0 references

Identifiers

zbMATH Open document ID

1415.94461

0 references

DOI

10.1007/978-3-319-56614-6_14

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738982