Pages that link to "Item:Q2104234"
From MaRDI portal
The following pages link to Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234):
Displaying 6 items.
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← 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)
- (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
