The following pages link to Random oracles and non-uniformity (Q1648794):
Displaying 36 items.
- Non-adaptive programmability of random oracle (Q500974) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- On random oracle separations (Q1182108) (← links)
- On independent random oracles (Q1185000) (← links)
- The random oracle hypothesis is false (Q1333397) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models (Q1673416) (← links)
- Password hashing and preprocessing (Q2056723) (← links)
- The memory-tightness of authenticated encryption (Q2096479) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- On the complexity of collision resistant hash functions: new and old black-box separations (Q2175920) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- Random Oracles and Auxiliary Input (Q3612551) (← links)
- Limits on the Usefulness of Random Oracles (Q4910292) (← links)
- Random Oracle Reducibility (Q5199182) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- A random oracle for all of us (Q6103097) (← links)
- On the worst-case inefficiency of CGKA (Q6114271) (← links)
- Crooked indifferentiability of enveloped XOR revisited (Q6157572) (← links)
- Augmented random oracles (Q6163941) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions (Q6192059) (← links)
- On the need for large quantum depth (Q6567267) (← links)
- On black-box verifiable outsourcing (Q6581787) (← links)
- Immunizing backdoored PRGs (Q6582215) (← links)
- On time-space lower bounds for finding short collisions in sponge hash functions (Q6582219) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
