Lattice-Based Timed Cryptography

ePrint Report: Lattice-Based Timed Cryptography

Russell W. F. Lai, Giulio Malavolta

Timed cryptography studies primitives that retain their security only for a predetermined amount of time, such as proofs of sequential work and time-lock puzzles. This feature has proven to be useful in a large number of practical applications, e.g. randomness generation, sealed-bid auctions, and fair multi-party computation. However, the current state of affairs in timed cryptography is unsatisfactory: Virtually all efficient constructions rely on a single sequentiality assumption, namely …

applications cryptography eprint report fair feature large lock party randomness report retain security studies work