Homomorphic time-lock puzzles and applications

DOI10.1007/978-3-030-26948-7_22zbMath1456.94099OpenAlexW2967051452MaRDI QIDQ2181867

Sri Aravinda Krishnan Thyagarajan, Giulio Malavolta

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_22

zbMATH Keywords

semantic security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

Security definitions on time-lock puzzles ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Non-malleable time-lock puzzles and applications ⋮ Minting mechanism for proof of stake blockchains ⋮ Candidate iO from homomorphic encryption schemes ⋮ Candidate iO from homomorphic encryption schemes ⋮ Delay encryption ⋮ Generic compiler for publicly verifiable covert multi-party computation

This page was built for publication: Homomorphic time-lock puzzles and applications