  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.
