On the security of time-lock puzzles and timed commitments
Time-lock puzzles—problems whose solution requires some amount of sequential effort—
have recently received increased interest (eg, in the context of verifiable delay functions) …
have recently received increased interest (eg, in the context of verifiable delay functions) …
Transparent batchable time-lock puzzles and applications to byzantine consensus
Time-lock puzzles (TLP) are a fascinating type of cryptographic problem that is easy to
generate, but takes a certain time to solve, even when arbitrary parallel speedup is allowed …
generate, but takes a certain time to solve, even when arbitrary parallel speedup is allowed …
On secure ratcheting with immediate decryption
J Pijnenburg, B Poettering - International Conference on the Theory and …, 2022 - Springer
Ratcheting protocols let parties securely exchange messages in environments in which state
exposure attacks are anticipated. While, unavoidably, some promises on confidentiality and …
exposure attacks are anticipated. While, unavoidably, some promises on confidentiality and …
Pured: a unified framework for resource-hard functions
A Biryukov, M Lombard-Platet - International Conference on Cryptology in …, 2023 - Springer
Algorithm hardness can be described by 5 categories: hardness in computation, in
sequential computation, in memory, in energy consumption (or bandwidth), in code size …
sequential computation, in memory, in energy consumption (or bandwidth), in code size …
Revisiting transaction ledger robustness in the miner extractable value era
In public transaction ledgers such as Bitcoin and Ethereum, it is generally assumed that
miners do not have any preference on the contents of the transactions they include, such …
miners do not have any preference on the contents of the transactions they include, such …
Time-Lock Puzzles from Lattices
S Agrawalr, G Malavolta, T Zhang - Annual International Cryptology …, 2024 - Springer
Time-lock puzzles (TLP) are a cryptographic tool that allow one to encrypt a message into
the future, for a predetermined amount of time T. At present, we have only two constructions …
the future, for a predetermined amount of time T. At present, we have only two constructions …
Offline witness encryption with semi-adaptive security
The first construction of Witness Encryption (WE) by Garg et al.(STOC 2013) has led to many
exciting avenues of research in the past years. A particularly interesting variant is Offline WE …
exciting avenues of research in the past years. A particularly interesting variant is Offline WE …
Towards Witness Encryption Without Multilinear Maps: Extractable Witness Encryption for Multi-subset Sum Instances with No Small Solution to the Homogeneous …
G Choi, S Vaudenay - … Conference on Information Security and Cryptology, 2021 - Springer
Current proposals of extractable witness encryption are based on multilinear maps. In this
paper, we propose a new construction without. We propose the notion of hidden group with …
paper, we propose a new construction without. We propose the notion of hidden group with …
Hours of horus: keyless cryptocurrency wallets
D Zindros - … Conference on Financial Cryptography and Data …, 2022 - Springer
We put forth a keyless wallet, a cryptocurrency wallet where money can be spent using a
password alone, and no private keys are required. It requires a smart contract blockchain …
password alone, and no private keys are required. It requires a smart contract blockchain …
Extractable Witness Encryption for the Homogeneous Linear Equations Problem
B Tran, S Vaudenay - International Workshop on Security, 2023 - Springer
Witness encryption is a cryptographic primitive which encrypts a message under an instance
of an NP language and decrypts the ciphertext using a witness associated with that instance …
of an NP language and decrypts the ciphertext using a witness associated with that instance …