Pages that link to "Item:Q1673416"

The following pages link to Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models (Q1673416):

Displaying 20 items.

• Random oracles and non-uniformity (Q1648794) (← links)
• Lower bounds for key length of \(k\)-wise almost independent permutations and certain symmetric-key encryption schemes (Q1800680) (← links)
• Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
• Password hashing and preprocessing (Q2056723) (← links)
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
• Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
• Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
• The function-inversion problem: barriers and opportunities (Q2175919) (← links)
• Unifying presampling via concentration bounds (Q2695631) (← links)
• (Q4231390) (← links)
• The action of a few random permutations on r-tuples and an application to cryptography (Q4593946) (← links)
• Another look at non-uniformity (Q5414126) (← links)
• Theory of Cryptography (Q5898355) (← links)
• The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
• Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
• Nonmalleable digital lockers and robust fuzzy extractors in the plain model (Q6175982) (← links)
• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions (Q6192059) (← links)
• On time-space lower bounds for finding short collisions in sponge hash functions (Q6582219) (← links)
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)