Publicly verifiable proofs of sequential work
From MaRDI portal
Recommendations
Cites work
- A model of interactive teaching
- A theory of goal-oriented communication
- A theory of the learnable
- Algorithmic Learning Theory
- Derandomizing polynomial identity tests means proving circuit lower bounds
- scientific article; zbMATH DE number 3154781 (Why is no real title available?)
- scientific article; zbMATH DE number 67625 (Why is no real title available?)
- scientific article; zbMATH DE number 67631 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- Learning from different teachers
- Measuring teachability using variants of the teaching dimension
- Models of cooperative teaching and learning
- Occam's razor
- On specifying Boolean functions by labelled examples
- On the complexity of teaching
- On the limits of efficient teachability
- On the power of inductive inference from good examples
- Pseudorandom generators for space-bounded computation
- Recent Developments in Algorithmic Teaching
- Teachability in computational learning
- Teaching a smarter learner.
- Teaching Randomized Learners
Cited in
(51)- Simple proofs of sequential work
- How to build time-lock encryption
- Continuous verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- PoSAT: proof-of-work availability and unpredictability, without the work
- Multi-instance publicly verifiable time-lock puzzle and its applications
- Non-interactive cryptographic timestamping based on verifiable delay functions
- Publicly verifiable proofs from blockchains
- Reversible proofs of sequential work
- Incremental proofs of sequential work
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Time-lock puzzles from randomized encodings
- Efficiently computing data-independent memory-hard functions
- Indistinguishable proofs of work or knowledge
- Proof of space from stacked expanders
- Designing proof of human-work puzzles for cryptocurrency and beyond
- Simple verifiable delay functions
- Time-lock puzzles in the random oracle model
- Depth-robust graphs and their cumulative memory complexity
- Pebbling and Proofs of Work
- An incremental PoSW for general weight distributions
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
- Multi-stage proof-of-works: properties and vulnerabilities
- Practical statistically-sound proofs of exponentiation in any group
- On the security of proofs of sequential work in a post-quantum world
- SNACKs: leveraging proofs of sequential work for blockchain light clients
- Short-lived zero-knowledge proofs and signatures
- Time-release cryptography from minimal circuit assumptions
- Lattice-based timed cryptography
- stoRNA: stateless transparent proofs of storage-time
- SNACKs for proof-of-space blockchains
- (Verifiable) delay functions from Lucas sequences
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- PURED: a unified framework for resource-hard functions
- Quadratically sound proof-of-sequential-work
- Cryptanalysis of algebraic verifiable delay functions
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- On sequential functions and fine-grained cryptography
- Can verifiable delay functions be based on random oracles?
- Breaking verifiable delay functions in the random oracle model
- Towards a white-box secure Fiat-Shamir transformation
- On graphs of incremental proofs of sequential work
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- A new connection between node and edge depth robust graphs
- Provably memory-hard proofs of work with memory-easy verification
- Universally composable succinct vector commitments and applications
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
- Lower bounding update frequency in short accumulators and vector commitments
This page was built for publication: Publicly verifiable proofs of sequential work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986887)
