Random oracles and non-uniformity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1820025 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- scientific article; zbMATH DE number 1789922 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- A cryptanalytic time-memory trade-off
- A uniform-complexity treatment of encryption and zero-knowledge
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Definitions and properties of zero-knowledge proof systems
- Everlasting security in the bounded storage model
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Formalizing human ignorance
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Introduction to modern cryptography
- Key derivation without entropy waste
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Message Authentication Codes from Unpredictable Block Ciphers
- Non-uniform cracks in the concrete: the power of free precomputation
- On the Composition of Zero-Knowledge Proof Systems
- On the power of hierarchical identity-based encryption
- On the power of nonuniformity in proofs of security
- Pseudorandomness for network algorithms
- Random Oracles and Auxiliary Input
- Random oracles and non-uniformity
- Rectangles are nonnegative juntas
- Rigorous Time/Space Trade-offs for Inverting Functions
- Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
- Simple Constructions of Almost k-wise Independent Random Variables
- The random oracle methodology, revisited.
- The “Coefficients H” Technique
- Theory of Cryptography
- Tight security proofs for the bounded-storage model
- Time space tradeoffs for attacks against one-way functions and PRGs
Cited in
(49)- Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
- Random oracles and non-uniformity
- Naor-Yung Paradigm with Shared Randomness and Applications
- Non-uniform cracks in the concrete: the power of free precomputation
- The random oracle model: a twenty-year retrospective
- Tight characterizations for preprocessing against cryptographic salting
- On the worst-case inefficiency of CGKA
- On independent random oracles
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- Quantum depth in the random oracle model
- Random Oracles and Auxiliary Input
- Augmented random oracles
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
- Password hashing and preprocessing
- On black-box verifiable outsourcing
- Quantum random oracle model with auxiliary input
- Immunizing backdoored PRGs
- On time-space lower bounds for finding short collisions in sponge hash functions
- Revisiting time-space tradeoffs for function inversion
- The query-complexity of preprocessing attacks
- Crooked indifferentiability of enveloped XOR revisited
- On random oracle separations
- On differential privacy and adaptive data analysis with bounded space
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Expressing uniformity via oracles
- Limits on the Usefulness of Random Oracles
- Proof-carrying data from arithmetized random oracles
- On building fine-grained one-way functions from strong average-case hardness
- Lower bound on SNARGs in the random oracle model
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- On the complexity of collision resistant hash functions: new and old black-box separations
- The function-inversion problem: barriers and opportunities
- Non-malleable time-lock puzzles and applications
- Non-uniformity and quantum advice in the quantum random oracle model
- Lower bounds for (batch) PIR with private preprocessing
- Non-adaptive programmability of random oracle
- The random oracle hypothesis is false
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- On the need for large quantum depth
- The memory-tightness of authenticated encryption
- A random oracle for all of us
- Unifying presampling via concentration bounds
- Random Oracle Reducibility
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
- On building fine-grained one-way functions from strong average-case hardness
- Single-server private information retrieval with sublinear amortized time
This page was built for publication: Random oracles and non-uniformity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648794)
