Time-lock puzzles from lattices
From MaRDI portal
Publication:6652906
DOI10.1007/978-3-031-68382-4_13MaRDI QIDQ6652906
Could not fetch data.
Publication date: 13 December 2024
Cites Work
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- How to build time-lock encryption
- 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
- Counterexamples to new circular security assumptions underlying iO
- Multi-instance publicly verifiable time-lock puzzle and its applications
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Homomorphic time-lock puzzles and applications
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Non-malleable time-lock puzzles and applications
- Fully succinct garbled RAM
- Time-lock puzzles from randomized encodings
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Cryptanalysis of the Multilinear Map over the Integers
- Lattice-based FHE as secure as PKE
- Indistinguishability Obfuscation from Compact Functional Encryption
- A Pseudorandom Generator from any One-way Function
- Indistinguishability Obfuscation from Functional Encryption
- Public-key cryptosystems from the worst-case shortest vector problem
- How to use indistinguishability obfuscation
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Indistinguishability obfuscation from circular security
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Candidate iO from homomorphic encryption schemes
- Witness encryption and null-iO from evasive LWE
- Candidate witness encryption from lattice techniques
- Time-release cryptography from minimal circuit assumptions
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based timed cryptography
- McFly: verifiable encryption to the future made practical
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)
