Pages that link to "Item:Q3612551"
From MaRDI portal
The following pages link to Random Oracles and Auxiliary Input (Q3612551):
Displaying 34 items.
- Non-adaptive programmability of random oracle (Q500974) (← links)
- On independent random oracles (Q1185000) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Password hashing and preprocessing (Q2056723) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← 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)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Limits on the Usefulness of Random Oracles (Q4910292) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited (Q5267415) (← links)
- Security of Digital Signature Schemes in Weakened Random Oracle Models (Q5445458) (← links)
- Leaky Random Oracle (Extended Abstract) (Q5505472) (← 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)
- Augmented random oracles (Q6163941) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← 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)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- Tight characterizations for preprocessing against cryptographic salting (Q6652927) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q6665547) (← links)
