Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments

DOI10.1007/978-3-031-31368-4_18zbMath1527.94028OpenAlexW4367663829MaRDI QIDQ6070773

Tibor Jager, Peter Chvojka

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_18

zbMATH Keywords

Naor-Yung paradigmnon-malleable non-interactive timed commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Verifiable delay functions
• How to build time-lock encryption
• Secure integration of asymmetric and symmetric encryption schemes
• TARDIS: a foundation of time-lock puzzles in UC
• On the security of time-lock puzzles and timed commitments
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Homomorphic time-lock puzzles and applications
• Time-Lock Puzzles from Randomized Encodings
• Naor-Yung Paradigm with Shared Randomness and Applications
• Encryption Switching Protocols
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Secure integration of asymmetric and symmetric encryption schemes
• Simple verifiable delay functions
• Efficient verifiable delay functions

This page was built for publication: Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments