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):
Displayed 11 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)
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption (Q6061370) (← links)
- Certifying giant nonprimes (Q6070774) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- Correlation intractability and SNARGs from sub-exponential DDH (Q6190125) (← links)