Lattice-based timed cryptography

Cites Work

Unnamed Item
Unnamed Item
Simple proofs of sequential work
Verifiable delay functions
Delay encryption
A non-PCP approach to succinct quantum-safe zero-knowledge
Tight verifiable delay functions
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
A compressed \(\varSigma \)-protocol theory for lattices
Does Fiat-Shamir require a cryptographic hash function?
Succinct arguments in the quantum random oracle model
Linear-size constant-query IOPs for delegating computation
Homomorphic time-lock puzzles and applications
Verifiable delay functions from supersingular isogenies and pairings
Incremental proofs of sequential work
Towards classical hardness of module-LWE: the linear rank case
Time-Lock Puzzles from Randomized Encodings
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Publicly verifiable proofs of sequential work
Collision-Free Hashing from Lattice Problems
On Ideal Lattices and Learning with Errors over Rings
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Simple verifiable delay functions
Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
Computationally Binding Quantum Commitments
On lattices, learning with errors, random linear codes, and cryptography
Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
Time-release cryptography from minimal circuit assumptions
Quantum rewinding for many-round protocols
Fiat-Shamir transformation of multi-round interactive proofs
PPAD is as hard as LWE and iterated squaring

This page was built for publication: Lattice-based timed cryptography