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

DOI10.1007/978-3-662-64331-0_28MaRDI QIDQ2147261zbMATH OpenOpenAlexFDO

Authors Aydin Abadi, Aggelos Kiayias

Publication date 22 June 2022

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

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• Compact Proofs of Retrievability
• Efficient verifiable delay functions
• Homomorphic time-lock puzzles and applications
• Introduction to modern cryptography.
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Lightweight delegatable proofs of storage
• Timed release of standard digital signatures (extended abstract)
• Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
• Verifiable delay functions

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)