Black-box timed commitments from time-lock puzzles

DOI10.1007/978-3-031-78020-2_16MaRDI QIDQ6952816zbMATH OpenFDO

Authors Hamza Abusalah, Gennaro Avitabile

Publication date 25 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78020-2_16

zbMATH Keywords

indistinguishability obfuscationworst-case non-parallelizing languages

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• scientific article; zbMATH DE number 5485433 (Why is no real title available?)
• scientific article; zbMATH DE number 1759782 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• A note on constant-round zero-knowledge proofs of knowledge
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Black-box constructions for secure computation
• Black-box constructions of composable protocols without set-up
• CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
• Constructing non-malleable commitments: a black-box approach
• Correlation intractability and SNARGs from sub-exponential DDH
• Efficient verifiable delay functions
• Foundations of Cryptography
• Four-round black-box non-malleable schemes from one-way permutations
• Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
• How to construct constant-round zero-knowledge proof systems for NP
• How to use indistinguishability obfuscation
• Improved black-box constructions of composable secure computation
• Lattice-based timed cryptography
• Non-malleable time-lock puzzles and applications
• On the Power of Secure Two-Party Computation
• On the security of time-lock puzzles and timed commitments
• Practical and provably-secure commitment schemes from collision-free hashing
• Round optimal black-box ``commit-and-prove
• Round-efficient black-box construction of composable multi-party computation
• Round-optimal black-box commit-and-prove with succinct communication
• SNARGs for P from sub-exponential DDH and QR
• SNARGs for \(\mathcal{P}\) from LWE
• Simple verifiable delay functions
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
• TARDIS: a foundation of time-lock puzzles in UC
• Time-lock puzzles from lattices
• Time-lock puzzles from randomized encodings
• Time-release cryptography from minimal circuit assumptions
• Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles

This page was built for publication: Black-box timed commitments from time-lock puzzles

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