Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work

DOI10.1007/978-3-031-68388-6_6MaRDI QIDQ6652963zbMATH OpenFDO

Authors Chris Peikert, Yi Tang

Publication date 13 December 2024

zbMATH Keywords

time-lock puzzlestimed commitments

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52)

Recommendations

• On the security of proofs of sequential work in a post-quantum world
• Lattice-based timed cryptography
• Reversible proofs of sequential work
• Simple proofs of sequential work
• Incremental proofs of sequential work

Cites work

• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 2196508 (Why is no real title available?)
• Efficient verifiable delay functions
• Lattice-based timed cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Publicly verifiable proofs of sequential work
• Reversible proofs of sequential work
• Simple proofs of sequential work
• Simple verifiable delay functions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(1)

• Lattice-based timed cryptography

This page was built for publication: Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652963)