Metraipolis › archive › dc_5e82d074cfb7
Time-lock puzzle — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Time-lock_puzzle
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:25:15.510Z
- SHA-256 of the archived text
999b95f734acbf32a64bc90a4986a4fae87dbdd702f25a07cad2d52236739b11- Stable URL of this page
https://metraipolis.com/documento/dc_5e82d074cfb7
How to cite
Time-lock puzzle — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Time-lock_puzzle (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5e82d074cfb7 (Metraipolis archive dc_5e82d074cfb7, sha256 999b95f734acbf32a64bc90a4986a4fae87dbdd702f25a07cad2d52236739b11)
BibTeX
@misc{dc5e82d074cfb7,
title = {Time-lock puzzle — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Time-lock_puzzle},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5e82d074cfb7; sha256 999b95f734acbf32a64bc90a4986a4fae87dbdd702f25a07cad2d52236739b11},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Time-lock_puzzle. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A time-lock puzzle, or time-released cryptography, encrypts a message that cannot be decrypted until a specified amount of time has passed. The concept was first described by Timothy C. May, and a solution first introduced by Ron Rivest, Adi Shamir, and David A. Wagner in 1996. Time-lock puzzle are useful in cases where confidentiality of information is determined by time, such as a diarist who does not want their views released until 50 years after their death, an auction where bids are sealed until the bidding period is closed, electronic voting, and contract signing. They can additionally be used in creating further cryptographic primitives, such as verifiable delay functions and zero knowledge proofs. Time-released cryptography can be achieved through several different mechanisms. Use mathematical problems requiring sequential calculations to solve, and cannot be solved with parallelization. Thus, adding more computers to a problem will not help solve the problem faster. Use of a trusted agent, or multiple agents who each hold a part of the message and cryptographic keys, who release the message after a specified time period has passed. Distribute public encryption keys to users, and place private cryptographic keys with a trusted agent in an offline location, to be released at a later date. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»). Fonte: Wikipedia in inglese, voce «Time-lock puzzle» — https://en.wikipedia.org/wiki/Time-lock_puzzle Wikidata Q130235677 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q130235677 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Time-lock_puzzle?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1304801026, consultata il 2026-10-05T23:07:33.654Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 46e9edff34b9708098ac046d939e7f42da83d3a9822afc794fef79b74ceb09e4