Lattice-based timed cryptography
From MaRDI portal
Recommendations
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Collision-free hashing from lattice problems
- Computationally binding quantum commitments
- Delay encryption
- Does Fiat-Shamir require a cryptographic hash function?
- Fiat-Shamir transformation of multi-round interactive proofs
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic time-lock puzzles and applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- Incremental proofs of sequential work
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Linear-size constant-query IOPs for delegating computation
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- PPAD is as hard as LWE and iterated squaring
- Publicly verifiable proofs of sequential work
- Quantum rewinding for many-round protocols
- Simple proofs of sequential work
- Simple verifiable delay functions
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Succinct arguments in the quantum random oracle model
- Tight verifiable delay functions
- Time-lock puzzles from randomized encodings
- Time-release cryptography from minimal circuit assumptions
- Towards classical hardness of module-LWE: the linear rank case
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(13)- (Verifiable) delay functions from Lucas sequences
- Time-lock puzzles from lattices
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work
- On sequential functions and fine-grained cryptography
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- How to construct public timeline for RSA-formed time-lock cryptography
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Black-box timed commitments from time-lock puzzles
- RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
- Time/space tradeoffs for generic attacks on delay functions
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
This page was built for publication: Lattice-based timed cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190157)
