Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials
- 30 November 2024
- book chapter
- Published by Springer Nature
- p. 431-459
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- Trapdoor Memory-Hard Functions2024
- (Verifiable) Delay Functions from Lucas Sequences2023
- Practical Statistically-Sound Proofs of Exponentiation in Any Group2022
- Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes2022
- Verifiable Delay Functions from Supersingular Isogenies and Pairings2019
- Incremental Proofs of Sequential Work2019
- Efficient Verifiable Delay Functions2019
- Timed Commitments2000
- Exceptional Polynomials of Affine TypeJournal of Algebra, 1997
- Probabilistic algorithms for sparse polynomials1979