Multi-instance publicly verifiable time-lock puzzle and its applications

DOI10.1007/978-3-662-64331-0_28zbMATH Open1497.94071OpenAlexW3211148330MaRDI QIDQ2147261FDOQ2147261

Authors: Aydin Abadi, Aggelos Kiayias 

Publication date: 22 June 2022

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10132608/

Recommendations

• Homomorphic time-lock puzzles and applications
• Time-lock puzzles in the random oracle model
• Publicly verifiable proofs of sequential work
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Non-malleable time-lock puzzles and applications

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Introduction to modern cryptography.
• Compact Proofs of Retrievability
• Title not available (Why is that?)
• Timed release of standard digital signatures (extended abstract)
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Homomorphic time-lock puzzles and applications
• Verifiable delay functions
• Efficient verifiable delay functions
• Lightweight delegatable proofs of storage
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era

Cited In (4)

• Towards practical homomorphic time-lock puzzles: applicability and verifiability
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Time-lock puzzles from lattices
• Information transfer through time-lock puzzles by creating a selfunpacked ``dropper- file

This page was built for publication: Multi-instance publicly verifiable time-lock puzzle and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147261)