Homomorphic time-lock puzzles and applications
From MaRDI portal
Recommendations
- Non-malleable time-lock puzzles and applications
- Time-lock puzzles in the random oracle model
- Time-lock puzzles from randomized encodings
- On the security of time-lock puzzles and timed commitments
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
Cited in
(48)- Easy intruder deduction problems with homomorphisms
- How to build time-lock encryption
- Candidate iO from homomorphic encryption schemes
- Delay encryption
- Generic compiler for publicly verifiable covert multi-party computation
- TARDIS: a foundation of time-lock puzzles in UC
- On the security of time-lock puzzles and timed commitments
- Multi-instance publicly verifiable time-lock puzzle and its applications
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Minting mechanism for proof of stake blockchains
- Fair and sound secret sharing from homomorphic time-lock puzzles
- Non-malleable time-lock puzzles and applications
- Time-lock puzzles from randomized encodings
- Information transfer through time-lock puzzles by creating a selfunpacked ``dropper- file
- Time-lock puzzles in the random oracle model
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- TIDE: a novel approach to constructing timed-release encryption
- Candidate iO from homomorphic encryption schemes
- Trustworthy sealed-bid auction with low communication cost atop blockchain
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Short-lived zero-knowledge proofs and signatures
- Time-release cryptography from minimal circuit assumptions
- Towards practical homomorphic time-lock puzzles: applicability and verifiability
- Completeness theorems for adaptively secure broadcast
- Lattice-based timed cryptography
- McFly: verifiable encryption to the future made practical
- (Verifiable) delay functions from Lucas sequences
- Time-lock puzzles with efficient batch solving
- Time-lock puzzles from lattices
- On sequential functions and fine-grained cryptography
- Foundations of platform-assisted auctions
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- How to construct public timeline for RSA-formed time-lock cryptography
- How (not) to hash into class groups of imaginary quadratic fields?
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Timed secret sharing
- Chained time lock puzzle with small puzzle size
- BTLE: atomic swaps with time-lock puzzles
- Rational secret sharing with competition
- Game theory does not always help: the case of statistical multi-party coin tossing
- Separating verifiable delay functions and time-lock puzzles
- Fair multiparty coin tossing from minimal assumptions
- Beyond the 1/2 bound: on the theory and practice of biprimality tests
- Challenges in timed-cryptography
- Security definitions on time-lock puzzles
This page was built for publication: Homomorphic time-lock puzzles and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181867)
