Paper 2024/1013
Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination
Abstract
To securely transmit sensitive information into the future, Time-Lock Puzzles (TLPs) have been developed. Their applications include scheduled payments, timed commitments, e-voting, and sealed-bid auctions. Homomorphic TLP is a key variant of TLP that enables computation on puzzles from different clients. This allows a solver/server to tackle only a single puzzle encoding the computation's result. However, existing homomorphic TLPs lack support for verifying the correctness of the computation results. We address this limitation by introducing Tempora-Fusion, a TLP that allows a server to perform homomorphic linear combinations of puzzles from different clients while ensuring verification of computation correctness. This scheme avoids asymmetric-key cryptography for verification, thus paving the way for efficient implementations. We discuss our scheme's application in various domains, such as federated learning, scheduled payments in online banking, and e-voting.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint.
- Keywords
- Time-Lock PuzzlesVerifiable ComputationHomomorphic Computation
- Contact author(s)
- aydin abadi @ newcastle ac uk
- History
- 2024-06-24: approved
- 2024-06-22: received
- See all versions
- Short URL
- https://ia.cr/2024/1013
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1013,
author = {Aydin Abadi},
title = {Tempora-Fusion: Time-Lock Puzzle with Efficient Verifiable Homomorphic Linear Combination},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1013},
year = {2024},
url = {https://eprint.iacr.org/2024/1013}
}