2 papers
cs.CR2026
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
Ameer Mohammed, Aydin Abadi, Jaffer Mahdi
Publicly verifiable delegation is a well-known problem involving a user who wishes to outsource a resource-intensive computational task to a more powerful but potentially untrusted…
cs.CR2025
Scalable Time-Lock Puzzle
Aydin Abadi, Dan Ristea, Artem Grigor +1
Time-Lock Puzzles (TLPs) enable a client to lock a message such that a server can unlock it only after a specified time. They have diverse applications, such as scheduled payments,…