Time-lock puzzles from lattices

DOI10.1007/978-3-031-68382-4_13MaRDI QIDQ6652906zbMATH OpenFDO

Authors Shweta Agrawalr, Giulio Malavolta, Tianwei Zhang

Publication date 13 December 2024

zbMATH Keywords

iO techniquessuccinct randomized encodings

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Time-lock puzzles from randomized encodings
• Time-lock puzzles in the random oracle model
• On the security of time-lock puzzles and timed commitments
• Lattice-based timed cryptography
• Homomorphic time-lock puzzles and applications

Cites work

• A Pseudorandom Generator from any One-way Function
• Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
• Candidate iO from homomorphic encryption schemes
• Candidate obfuscation via oblivious LWE sampling
• Candidate witness encryption from lattice techniques
• Counterexamples to new circular security assumptions underlying iO
• Cryptanalysis of the multilinear map over the integers
• Delay encryption
• Fully succinct garbled RAM
• GGH15 beyond permutation branching programs: proofs, attacks, and candidates
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Homomorphic time-lock puzzles and applications
• How to build time-lock encryption
• How to use indistinguishability obfuscation
• Indistinguishability obfuscation from circular security
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from functional encryption
• Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
• Lattice-based FHE as secure as PKE
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Lattice-based succinct arguments from vanishing polynomials (extended abstract)
• Lattice-based timed cryptography
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• McFly: verifiable encryption to the future made practical
• Multi-instance publicly verifiable time-lock puzzle and its applications
• Non-malleable time-lock puzzles and applications
• On lattices, learning with errors, random linear codes, and cryptography
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• On the security of time-lock puzzles and timed commitments
• Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
• Practical bootstrapping in quasilinear time
• Public-key cryptosystems from the worst-case shortest vector problem
• Reusable garbled circuits and succinct functional encryption
• Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
• Succinct garbling and indistinguishability obfuscation for RAM programs
• Succinct randomized encodings and their applications
• Time-lock puzzles from randomized encodings
• Time-release cryptography from minimal circuit assumptions
• Transparent batchable time-lock puzzles and applications to Byzantine consensus
• Witness encryption and its applications
• Witness encryption and null-iO from evasive LWE

Cited in

(3)

• Lattice-based timed cryptography
• Time-lock puzzles with efficient batch solving
• CaSCaDE: (time-based) Cryptography from Space Communications DElay

This page was built for publication: Time-lock puzzles from lattices

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