Towards Practical Homomorphic Time-Lock Puzzles: Applicability and Verifiability