Towards practical homomorphic time-lock puzzles: applicability and verifiability

DOI10.1007/978-3-031-17140-6_21MaRDI QIDQ6173300zbMATH OpenFDO

Authors

Publication date 21 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17140-6_21

zbMATH Keywords

(homomorphic) time-lock puzzlespublic-key cryptographyrepeated modular squaringzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Homomorphic time-lock puzzles and applications
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Multi-instance publicly verifiable time-lock puzzle and its applications
• Time-lock puzzles with efficient batch solving
• Time-lock puzzles in the random oracle model

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Efficient verifiable delay functions
• Fair and sound secret sharing from homomorphic time-lock puzzles
• Generic compiler for publicly verifiable covert multi-party computation
• Homomorphic time-lock puzzles and applications
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Parallel coin-tossing and constant-round secure two-party computation
• Practical threshold signatures
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
• Verifiable delay functions
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Zaps and Their Applications

Cited in

(4)

• Astrolabous: a universally composable time-lock encryption scheme
• Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
• Time-lock puzzles with efficient batch solving
• How to construct public timeline for RSA-formed time-lock cryptography

This page was built for publication: Towards practical homomorphic time-lock puzzles: applicability and verifiability

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