The following pages link to Simple verifiable delay functions (Q5090439):
Displaying 20 items.
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Bandwidth-efficient threshold EC-DSA (Q2055695) (← links)
- Delay encryption (Q2056688) (← links)
- Generic compiler for publicly verifiable covert multi-party computation (Q2056768) (← links)
- 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)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Non-malleable time-lock puzzles and applications (Q2697901) (← links)
- Multiparty generation of an RSA modulus (Q5918574) (← links)
- Multiparty generation of an RSA modulus (Q5970801) (← links)
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm (Q6047436) (← links)
