Pages that link to "Item:Q2055651"
From MaRDI portal
The following pages link to Generic-group delay functions require hidden-order groups (Q2055651):
Displaying 11 items.
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- A note on Low Order assumptions in RSA groups (Q5025952) (← links)
- Lower bounds on assumptions behind registration-based encryption (Q6582178) (← links)
- Round-robin is optimal: lower bounds for group action based protocols (Q6587957) (← links)
- (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
- The relationship between idealized models under computationally bounded adversaries (Q6605332) (← links)
- Generic and algebraic computation models: when AGM proofs transfer to the GGM (Q6652959) (← links)
- On sequential functions and fine-grained cryptography (Q6652975) (← links)
