The following pages link to Random oracles and non-uniformity (Q1648794):
Displaying 19 items.
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Random oracles and non-uniformity (Q1648794) (← 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)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← 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)