How to construct public timeline for RSA-formed time-lock cryptography

DOI10.1007/978-981-96-4734-7_8MaRDI QIDQ6897244zbMATH OpenFDO

Authors Huixuan Jin, Cong Peng, Jintao Fu, Min Luo

Publication date 20 November 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4734-7_8

zbMATH Keywords

computational burdenmulti-timelineTLPTRE

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Anonymous Multireceiver Identity-Based Encryption
• Applications of timed-release encryption with implicit authentication
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Faster fully homomorphic encryption
• Financial cryptography and data security. FC 2020 international workshops, AsiaUSEC, codefi, VOTING, and WTSC, Kota Kinabalu, Malaysia, February 14, 2020. Revised selected papers
• Generalized channels from limited blockchain scripts and adaptor signatures
• Homomorphic time-lock puzzles and applications
• How to build time-lock encryption
• How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
• How to use bitcoin to design fair protocols
• Improved Anonymous Timed-Release Encryption
• Information and Communications Security
• Lattice-based timed cryptography
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Multi-instance publicly verifiable time-lock puzzle and its applications
• Offline witness encryption
• Offline witness encryption with semi-adaptive security
• On the (im)possibility of time-lock puzzles in the quantum random oracle model
• On the security of time-lock puzzles and timed commitments
• Revocable Quantum Timed-Release Encryption
• Time-lock puzzles from randomized encodings
• Time-lock puzzles in the random oracle model
• Time-lock puzzles with efficient batch solving
• Towards practical homomorphic time-lock puzzles: applicability and verifiability
• Two-party adaptor signatures from identification schemes
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Witness encryption and its applications

This page was built for publication: How to construct public timeline for RSA-formed time-lock cryptography

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