The function-inversion problem: barriers and opportunities
From MaRDI portal
Publication:2175919
DOI10.1007/978-3-030-36030-6_16zbMath1455.94145OpenAlexW2990000219MaRDI QIDQ2175919
Dmitry Kogan, Henry Corrigan-Gibbs
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_16
Related Items (7)
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 ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ Revisiting time-space tradeoffs for function inversion ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård hash functions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct representations of permutations and functions
- One-way multiparty communication lower bound for pointer jumping with applications
- Boolean function complexity. Advances and frontiers.
- Min-rank conjecture for log-depth circuits
- On the cell probe complexity of polynomial evaluation
- On the power of small-depth threshold circuits
- The cost of the missing bit: Communication complexity with help
- One way functions and pseudorandom generators
- Some bounds on multiparty communication complexity of pointer jumping
- On ACC
- Random oracles and non-uniformity
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Position-based cryptography and multiparty communication complexity
- Beyond Hellman's time-memory trade-offs with applications to proofs of space
- Yes, there is an oblivious RAM lower bound!
- The cell probe complexity of succinct data structures
- Optimal collapsing protocol for multiparty pointer jumping
- Optimal lower bounds for rank and select indexes
- Is There an Oblivious RAM Lower Bound?
- Succinct ordinal trees with level-ancestor queries
- Message Authentication Codes from Unpredictable Block Ciphers
- Succinct indexes for strings, binary relations and multilabeled trees
- Succinct ordinal trees based on tree covering
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
- On the Power of Small-Depth Computation
- On obfuscating point functions
- Squeezing succinct data structures into entropy bounds
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Optimal Trade-Offs for Succinct String Indexes
- Random Oracles and Auxiliary Input
- A cryptanalytic time-memory trade-off
- Should Tables Be Sorted?
- Simple Constructions of Almost k-wise Independent Random Variables
- On the Existence of Pseudorandom Generators
- Boolean Circuits, Tensor Ranks, and Communication Complexity
- Software protection and simulation on oblivious RAMs
- A linear lower bound on index size for text retrieval
- Communication Complexity
- Rigorous Time/Space Trade-offs for Inverting Functions
- On the Communication Complexity of Key-Agreement Protocols.
- Data structures meet cryptography: 3SUM with preprocessing
- Static data structure lower bounds imply rigidity
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- A parallel search game
- Advances in Cryptology - CRYPTO 2003
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
- Is there an oblivious RAM lower bound for online reads?
This page was built for publication: The function-inversion problem: barriers and opportunities
