The following pages link to Verifiable delay functions (Q1673422):
Displaying 50 items.
- Design for delay verifiability (Q1288419) (← links)
- 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)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- Incompressible encodings (Q2096497) (← 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)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- LOVE a pairing (Q2146100) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- PoSAT: proof-of-work availability and unpredictability, without the work (Q2147235) (← links)
- Multi-instance publicly verifiable time-lock puzzle and its applications (Q2147261) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Verifiable delay functions from supersingular isogenies and pairings (Q2181883) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← 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)
- A note on Low Order assumptions in RSA groups (Q5025952) (← links)
- Simple verifiable delay functions (Q5090439) (← links)
- On the number of points on the curve \(y^2 = x^7 + ax^4 + bx\) over a finite field (Q5878620) (← 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)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Practical statistically-sound proofs of exponentiation in any group (Q6104340) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- SNACKs: leveraging proofs of sequential work for blockchain light clients (Q6135422) (← links)
- Short-lived zero-knowledge proofs and signatures (Q6135445) (← links)
- On time-lock cryptographic assumptions in abelian hidden-order groups (Q6157523) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Snarky ceremonies (Q6157546) (← links)
- On elapsed time consensus protocols (Q6157609) (← links)
- Time-release cryptography from minimal circuit assumptions (Q6157610) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- stoRNA: stateless transparent proofs of storage-time (Q6558607) (← links)
- Protostar: generic efficient accumulation/folding for special-sound protocols (Q6562560) (← links)
