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