Pages that link to "Item:Q2055650"
From MaRDI portal
The following pages link to Continuous verifiable delay functions (Q2055650):
Displaying 6 items.
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
