Pages that link to "Item:Q2055650"
From MaRDI portal
The following pages link to Continuous verifiable delay functions (Q2055650):
Displaying 19 items.
- Design for delay verifiability (Q1288419) (← links)
- Verifiable delay functions (Q1673422) (← links)
- 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)
- Tight verifiable delay functions (Q2106631) (← 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)
- Efficient verifiable delay functions (Q5919019) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
- CaSCaDE: (time-based) Cryptography from Space Communications DElay (Q6660393) (← links)
