Pages that link to "Item:Q1648845"
From MaRDI portal
The following pages link to The Discrete Logarithm problem with preprocessing (Q1648845):
Displaying 20 items.
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions (Q2096481) (← links)
- On the memory-tightness of hashed ElGamal (Q2119004) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Unifying presampling via concentration bounds (Q2695631) (← links)
- Multiple Discrete Logarithm Problems with Auxiliary Inputs (Q2811130) (← links)
- (Q3331305) (← links)
- (Q3360980) (← links)
- Discrete logarithm problems with auxiliary inputs (Q5962223) (← links)
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing (Q6083214) (← links)
- To label, or not to label (in generic groups) (Q6163942) (← links)
- Beyond Uber: instantiating generic groups via PGGs (Q6169556) (← links)
- Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions (Q6192059) (← links)
- Bounds in Various Generalized Settings of the Discrete Logarithm Problem (Q6487216) (← 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)
- Trapdoor memory-hard functions (Q6637334) (← links)
- Unbiasable verifiable random functions (Q6637523) (← links)
