TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

How can a time traveler encrypt info so it's only decryptable after a given date

50 点作者 azeemba10 个月前

23 条评论

card_zero10 个月前
There&#x27;s this star called R Scuti:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;R_Scuti" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;R_Scuti</a><p>* The light from it is variable,<p>* This variation is continuous, not a rare event,<p>* It&#x27;s 4,000 light years away, so the butterfly effect is irrelevant because the light is already on its way,<p>* It&#x27;s chaotic and unpredictable.<p>Basically a reliable stream of random data. I guess the only problem is that you need to know what observations of its light levels were, throughout the 80s, if the records even exist.<p>Edit: &quot;The AAVSO International Database currently contains over 110,000 observations of this erratic star spanning nearly a century of activity.&quot; There you go, that should provide a thousand measurements to base a key on in any given year.
评论 #41098432 未加载
评论 #41095582 未加载
slicktux10 个月前
This reminds me of the Joe Grand video titled:<p>“ I hacked time to recover $3 million from a Bitcoin software wallet”<p>Just put a program in the computer that generates a ‘random’ key based on time of day and second…and it does this every day at pre defined hours…and maybe some way that the time and date can’t be modified. Then, only when that day and time comes will the right key be generated and the files decrypted. Program does not know when that date is it just bases the key generation on time and date.
评论 #41094861 未加载
评论 #41094950 未加载
mrrccc10 个月前
The team behind the awesome drand project (<a href="https:&#x2F;&#x2F;drand.love" rel="nofollow">https:&#x2F;&#x2F;drand.love</a>) has proposed a timelock encryption scheme based on an existing threshold network (the League of Entropy).<p>They even provided a fully operational, web-based, open-source implementation: <a href="https:&#x2F;&#x2F;timevault.drand.love" rel="nofollow">https:&#x2F;&#x2F;timevault.drand.love</a>
kdkdodiei410 个月前
Make it only decrypted by brute force, taking into account the history of the algorithms and the computational level. There is no clue, you just have to use the knowledge of the time to try to solve it. You can even create the program and its minimum requirements to make sure they have a direction.
评论 #41095068 未加载
评论 #41095069 未加载
评论 #41095097 未加载
评论 #41095071 未加载
评论 #41096795 未加载
nickdothutton10 个月前
Position in a coordinate system of epicentre of earthquakes, perhaps those above a certain threshold depending on how much entropy you needed.
评论 #41096512 未加载
motohagiography10 个月前
the comment in the response about using stars going nova between the present and the travelled-from time was probably the best answer, but it requires accepting the paradox of the possibility of time travel while still ruling out faster than light travel- as you could get the key earlier than the set date by travelling light years toward where the stars were sampled from.<p>If you are protecting the secret from non-time travelers, you&#x27;re probably fine, but if you are protecting it from <i>other</i> time travellers, your compute or proof of work has to be more expensive than <i>their</i> time-travel propulsion energy units.<p>We have this same problem with device attestation, where if the key exists in the same &quot;universe&quot; (hardware substrate) as the ciphertext, you&#x27;re effectively fighting time travellers because they can run, re-run, use side channels, insert a breakpoint anywhere along the way. The current solutions are in the domains of physical tamper proofing, &quot;white box&quot; cryptography and other obfuscation schemes, and ultimately fully homomorphic encryption (FHE).<p>FHE would be the necessary solution against time travellers in this case because no matter where in time they were, they would have to be present at the instant the compute operation completes- and then you&#x27;re into a race condition against Planck time to see who can grab the result of the computation first when it finishes. (assuming they can&#x27;t infer or predict the result earlier than the completion of the FHE computation, that earlier decryption rounds don&#x27;t reduce the time it takes to brute force the rest of it in a parallel stopped-timeline, and that Planck time still means anything in a universe where time isn&#x27;t unidirectional and scalar)<p>Writing wise, there would have to be a hitch in their time travel scheme where to work it needed randomness and a lack of precision for some important quantum uncertainty reason, and the race to be present for the FHE decryption before the time travellers resolved their precision problem would drive the plot.<p>don&#x27;t be discouraged though, a cursory reading of scientific discovery shows that impossible is mostly a convention, and cryptography historically reduces to a gentleman&#x27;s agreement.
paulmendoza10 个月前
Use an encryption key that is a headline from a newspaper for that day. This assumes the time travel works like the Marvel movies and not like Back to the Future.
评论 #41095115 未加载
K0balt10 个月前
In order for the butterfly effect to not disturb the results of any random or pseudorandom key, the key must be derived in such a way that the distance of the key generation event is greater than 1&#x2F;2 the light-time of the key delivery delay, so that in no case can any information from the key holders reference reach the key source prior to key generation.<p>Other than that the key must be based in a purely deterministic algorithm to be immune to butterfly factors, which can always be brute forced by accelerating the civilization to fractional relativistic velocities or bringing it close to an extremely massive object. (Leaving the keygen at rest) Of course other ways to brute force such a key generator are probably more practical, but a relativistic attack is the steel man for the impossibility of reliability.<p>Stealth might be the best bet, an undersea bouy that pops up and broadcasts the key at the specified time or something like that. But then again, a fast moving civilisation would get the key “early” from their frame, even for astronomical events.<p>I posit that there is no absolutely reliable delay, but stealth is probably the best practical hedge.
评论 #41095059 未加载
foota10 个月前
How about this: take as input something random from beyond the time horizon (e.g., brightness from stars 300 light years away). Then (if we assume the input is sufficiently random) they should be fine.
bdjsiqoocwk10 个月前
This is really one of those questions where you want X, you started down the path of answering the question but got stuck, and now are asking how to get unstuck when you should be asking for X.<p>He&#x27;s asking &quot;how to decrypt only after a certain date&quot; when in reality he should be asking &quot;how to make information available after a certain date&quot;.
PaulKeeble10 个月前
The more generic although potentially harder question is without the time traveler element what could you do today to make sure something could not be decrypted before a certain date. This seems potentially useful but also every bit as tricky to answer especially since we don&#x27;t know what the future entails unlike a time traveller.
kdkdodiei410 个月前
For me it is easy if you are an old man you can simply know what algorithm was used at each time and at the computational level of each time, therefore you can make the only way to decipher the cave is by brute force and that it is probable and easy to resolved in each era through advances and knowledge.
评论 #41095014 未加载
a1o10 个月前
I don&#x27;t quite get notion of sending something back in time but before the actual date you want the thing to work... But anyway, you really can&#x27;t make the crypto device a tech level superior of the time or the crypto device itself gives information on the future.
评论 #41094974 未加载
评论 #41094968 未加载
评论 #41095062 未加载
0cf8612b2e1e10 个月前
Not going to result in an equal sharing of information, but if you can drop doodads at different time and locations, make a scavenger hunt for the key.<p>First key is stored at the center of Olympus Mons on Mars.
评论 #41095100 未加载
mtremsal10 个月前
Isn’t that exactly what drand is meant to provide?<p>See drand, the distributed randomness beacon protocol at <a href="https:&#x2F;&#x2F;drand.love&#x2F;" rel="nofollow">https:&#x2F;&#x2F;drand.love&#x2F;</a>
mikewarot10 个月前
Lost texts are recovered, and artifacts are found all the time. You could use an old artifact&#x27;s decrypted text, or location, as a source of a passkey.
geekodour10 个月前
related(2013): <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=6508179">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=6508179</a>
staplung10 个月前
A basket of specified (closing) stock prices on day X.
评论 #41094993 未加载
piinbinary10 个月前
Ignoring the butterfly effect issue, I would have said just pick the title of a given newspaper on a given date as the password.
评论 #41096548 未加载
评论 #41094850 未加载
评论 #41095048 未加载
评论 #41094847 未加载
trabs4t10 个月前
Transmit the key via radio wave, from a point source located x light years from earth. The key will reach earth after x years.
eknkc10 个月前
Would earthquakes be susceptible to butterfly effect? Historic earhquake data might solve the issue.
评论 #41095136 未加载
评论 #41095148 未加载
aquafox10 个月前
Why not use a private key based on a bunch of lottery draws that happened just before the date?
评论 #41094889 未加载
评论 #41094920 未加载
_boffin_10 个月前
market close data: tickers, their closing prices, and volumes for a given market or markets. For more, first paragraph of a story for each ticker.
评论 #41100163 未加载