Challenges in timed-cryptography

Cites work

Advances in Cryptology - CRYPTO 2003
Astrolabous: a universally composable time-lock encryption scheme
Can verifiable delay functions be based on random oracles?
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
Cryptographic assumptions: a position paper
Cryptography and Coding
Fair and robust multi-party computation using a global transaction ledger
Foundations of Cryptography
Generic-group delay functions require hidden-order groups
Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
Homomorphic time-lock puzzles and applications
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
How to simulate it -- a tutorial on the simulation proof technique
scientific article; zbMATH DE number 3864496 (Why is no real title available?)
scientific article; zbMATH DE number 1759782 (Why is no real title available?)
scientific article; zbMATH DE number 1775406 (Why is no real title available?)
Non-malleable time-lock puzzles and applications
On the (in)security of the Fiat-Shamir paradigm
On the security of time-lock puzzles and timed commitments
On time-lock cryptographic assumptions in abelian hidden-order groups
Simple verifiable delay functions
Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
TARDIS: a foundation of time-lock puzzles in UC
The random oracle methodology, revisited.
Time-lock puzzles from randomized encodings
Time-lock puzzles in the random oracle model
Universally Composable Security with Global Setup
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications

This page was built for publication: Challenges in timed-cryptography

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