Towards practical homomorphic time-lock puzzles: applicability and verifiability

DOI10.1007/978-3-031-17140-6_21zbMath1525.94045MaRDI QIDQ6173300

No author found.

Publication date: 21 July 2023

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

zbMATH Keywords

public-key cryptographyzero-knowledge(homomorphic) time-lock puzzlesrepeated modular squaring

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel coin-tossing and constant-round secure two-party computation
• Verifiable delay functions
• Generic compiler for publicly verifiable covert multi-party computation
• 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
• Homomorphic time-lock puzzles and applications
• Fair and sound secret sharing from homomorphic time-lock puzzles
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
• Zaps and Their Applications
• Efficient verifiable delay functions

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