The function-inversion problem: barriers and opportunities (Q2175919): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-36030-6_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2990000219
@@ Property / OpenAlex ID: W2990000219 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Hellman's time-memory trade-offs with applications to proofs of space
+Normal rank
@@ Property / cites work @@
+Simple Constructions of Almost k-wise Independent Random Variables
+Normal rank
@@ Property / cites work @@
+The cost of the missing bit: Communication complexity with help
+Normal rank
@@ Property / cites work @@
+Succinct indexes for strings, binary relations and multilabeled trees
+Normal rank
@@ Property / cites work @@
+Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+Q2707396
@@ Property / cites work: Q2707396 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4537979
@@ Property / cites work: Q4537979 / rank @@
+Normal rank
@@ Property / cites work @@
+Is There an Oblivious RAM Lower Bound?
@@ Property / cites work: Is There an Oblivious RAM Lower Bound? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4910715
@@ Property / cites work: Q4910715 / rank @@
+Normal rank
@@ Property / cites work @@
+Position-based cryptography and multiparty communication complexity
+Normal rank
@@ Property / cites work @@
+Q3467513
@@ Property / cites work: Q3467513 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5351925
@@ Property / cites work: Q5351925 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
+Normal rank
@@ Property / cites work @@
+Q4875211
@@ Property / cites work: Q4875211 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
+Normal rank
@@ Property / cites work @@
+Random oracles and non-uniformity
@@ Property / cites work: Random oracles and non-uniformity / rank @@
+Normal rank
@@ Property / cites work @@
+Some bounds on multiparty communication complexity of pointer jumping
+Normal rank
@@ Property / cites work @@
+Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
+Normal rank
@@ Property / cites work @@
+A linear lower bound on index size for text retrieval
+Normal rank
@@ Property / cites work @@
+Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
+Normal rank
@@ Property / cites work @@
+Message Authentication Codes from Unpredictable Block Ciphers
+Normal rank
@@ Property / cites work @@
+Static data structure lower bounds imply rigidity
@@ Property / cites work: Static data structure lower bounds imply rigidity / rank @@
+Normal rank
@@ Property / cites work @@
+Rigorous Time/Space Trade-offs for Inverting Functions
+Normal rank
@@ Property / cites work @@
+Q4449186
@@ Property / cites work: Q4449186 / rank @@
+Normal rank
@@ Property / cites work @@
+The cell probe complexity of succinct data structures
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees with level-ancestor queries
+Normal rank
@@ Property / cites work @@
+Bounds on the Efficiency of Generic Cryptographic Constructions
+Normal rank
@@ Property / cites work @@
+Q3413440
@@ Property / cites work: Q3413440 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Existence of Pseudorandom Generators
@@ Property / cites work: On the Existence of Pseudorandom Generators / rank @@
+Normal rank
@@ Property / cites work @@
+Software protection and simulation on oblivious RAMs
+Normal rank
@@ Property / cites work @@
+Data structures meet cryptography: 3SUM with preprocessing
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds for rank and select indexes
@@ Property / cites work: Optimal lower bounds for rank and select indexes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633874
@@ Property / cites work: Q4633874 / rank @@
+Normal rank
@@ Property / cites work @@
+A parallel search game
@@ Property / cites work: A parallel search game / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Trade-Offs for Succinct String Indexes
@@ Property / cites work: Optimal Trade-Offs for Succinct String Indexes / rank @@
+Normal rank
@@ Property / cites work @@
+On the Communication Complexity of Key-Agreement Protocols.
+Normal rank
@@ Property / cites work @@
+Succinct ordinal trees based on tree covering
@@ Property / cites work: Succinct ordinal trees based on tree covering / rank @@
+Normal rank
@@ Property / cites work @@
+A cryptanalytic time-memory trade-off
@@ Property / cites work: A cryptanalytic time-memory trade-off / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of small-depth threshold circuits
@@ Property / cites work: On the power of small-depth threshold circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Min-rank conjecture for log-depth circuits
@@ Property / cites work: Min-rank conjecture for log-depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Yes, there is an oblivious RAM lower bound!
@@ Property / cites work: Yes, there is an oblivious RAM lower bound! / rank @@
+Normal rank
@@ Property / cites work @@
+One way functions and pseudorandom generators
@@ Property / cites work: One way functions and pseudorandom generators / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal collapsing protocol for multiparty pointer jumping
+Normal rank
@@ Property / cites work @@
+On the cell probe complexity of polynomial evaluation
+Normal rank
@@ Property / cites work @@
+Succinct representations of permutations and functions
+Normal rank
@@ Property / cites work @@
+Advances in Cryptology - CRYPTO 2003
@@ Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean Circuits, Tensor Ranks, and Communication Complexity
+Normal rank
@@ Property / cites work @@
+Squeezing succinct data structures into entropy bounds
+Normal rank
@@ Property / cites work @@
+Random Oracles and Auxiliary Input
@@ Property / cites work: Random Oracles and Auxiliary Input / rank @@
+Normal rank
@@ Property / cites work @@
+Q4164821
@@ Property / cites work: Q4164821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036702
@@ Property / cites work: Q4036702 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Power of Small-Depth Computation
@@ Property / cites work: On the Power of Small-Depth Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5215665
@@ Property / cites work: Q5215665 / rank @@
+Normal rank
@@ Property / cites work @@
+One-way multiparty communication lower bound for pointer jumping with applications
+Normal rank
@@ Property / cites work @@
+On obfuscating point functions
@@ Property / cites work: On obfuscating point functions / rank @@
+Normal rank
@@ Property / cites work @@
+Is there an oblivious RAM lower bound for online reads?
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2175919