Time-lock puzzles with efficient batch solving
From MaRDI portal
Publication:6636509
DOI10.1007/978-3-031-58723-8_11MaRDI QIDQ6636509
Jesko Dujmovic, Rachit Garg, Giulio Malavolta
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Updatable and universal common reference strings with applications to zk-SNARKs
- Bonsai trees, or how to delegate a lattice basis
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Delay encryption
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Candidate obfuscation via oblivious LWE sampling
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Homomorphic time-lock puzzles and applications
- On representatives of subsets.
- Non-malleable time-lock puzzles and applications
- Reducing Depth in Constrained PRFs: From Bit-Fixing to $$\mathbf {NC}^{1}$$
- Key Homomorphic PRFs and Their Applications
- New and Improved Key-Homomorphic Pseudorandom Functions
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Key-Homomorphic Constrained Pseudorandom Functions
- Advances in Cryptology – CRYPTO 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Theory of Cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Indistinguishability obfuscation from circular security
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
- McFly: verifiable encryption to the future made practical
This page was built for publication: Time-lock puzzles with efficient batch solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636509)
