Timelock: Tim May's Timed Release Encryption made Reality - Vincenzo Iovino | Web3Privacy Now

[Music] Hello every yesor a cryptographic researcher Aragon Research we are Guild arag resic Academy So my the bings Yes ok so Oh yeah Ok so I will Talk Today about Let's say Time privacy Ok so Maybe you have about There is a lot of Research Now Going On Time Lock encryption Maybe you know about this Guy Who knows about him He Timothy May was the founder Of The crypto anarchist Movement And I think he was also one of the Creator of the cyberpunk Punk smiling list so in this message of 93 about Years ago he proposed What he called Release crypto Service so essentially was a service a to encrypt data To The Future and in the same message also proposed many applications We will cover some of them Let's say in Modern terminology later so I am very proud that After exact weag Research we are doing a lot of work to deploy the first serving in a distributed way we will see it soon so How It Works so it Works In This Way We Will publish forle Today The public Key of Today Tomorrow today inure inure the next The public Christmas You Can encrypt with respect to Christmas You can Send a message to Christmas So on the day of Christmas anybody will be able to decrypt but before that day your message is protected we will discuss soon what are the Trust assumption under our protocol and moreover the Nice feature of Our protocol that different Us from concurrent Works is that our protocol is Generic ention System that are very specific protocols so if you want application with them You should re implement them I don't know in Python Rust in Java in All Your application our is Generic in We publish a Generic Public Key of the Bitcoin eum Car 250 K1 so The public Key that norm encry cryptographic library R Java bouncy cast Python And So on So you need any Change to code Everything Started in a Project related to voting that We worked On this Project with adtech that was mentioned before so There was the noun W to implement an anonymous voting solution for and our solution was selected So one of the main requirement For for the anonymous voting solution that They wanted was fairness fairness means That the partial T of the election Should Not Be Visible Before The End of the lecture Because The problem of many anonymous voting solutions especially the ones Based on Knowledge proof is that the partial T is Visible People for Yes I I can need Fair really really important property other proposed solution Based on cryptography that We discarded why Because needs a Comme that Is Always online especially after infrastructure cpy them in our solution We would need essentially CIR that compute Operation like Ping stuff like that We did the test like running Almost in one hour CR Gab andic Select as Public Knowledge friendly elliptic like Baby Ja and solution becomes more efficient so As I said our solution our solution is Generic in That We support many elliptic Car and here There is currently we Just in our testnet We support car [Music] wey computation procedure decryption Time so How It Works Ok so Timo proposed Time release crypto protocol his idea was based completely using completely TR Tradition server corresponding Secret key is not Ideal in Thea of ​​distributed computing What Path You could Take next you could Take is the following you make his idea distributed What is the problem The problem that you need essentially trusted entities no Even if you go to a distribut set you need the nodes To Run the System for example we are not as famous as we are not as famous as Foundation So This would be a problem for us to make solution distributed you need Find be many famous Part and so So What we did is that There was an already existing Service called the league of entropy service that publish now I Each second a Random beon so randomness Each second this and here it consists of many respectable partn like Cloud Fair Security University of Chile about 25 partners ok and is completely Independent from m so our Trust assumption Are The Following we have two Trust assumption so first assumption is that league of entropy the majority league of entropy member is honest and this is Safe because Independent from and Thing is our second We party our if TR Us so now I will Present some application some of the many application of loock cryptography and especially of Our Service By The Way I forg to mention our Service will be called Time lock zone we have a website You can already visit so Natural application is Automatic the classification of Documents You have Now government promise classify document After X Years if they promise that They could directly publish the time encryption Such document with the date of Declassified document After X Years Another application is the following suppose that you are an activist that you fein to be Killed or to be kidnapped Okay so what you could Do What You Do is that you could encrypt the password of your email Okay with the data One month in advance forle so If you are Killed Sorry and you spread the C resting Cer Text to other activist your friends participant in your Community And So on so If you are Killed after one month activist will have Access to your email Because automatically the Cer will be able to uncover password and will have Access to your email But if you not killed you will Just Change your password And you will red the procedure So you will encrypt again with Time lock your password And So on so Another application that actually already was already Put in practic is Public Disclosure for software Bugs Okay so you find the measure Bu bug in Microsoft Windows You can inform Microsoft and say Microsoft encry with Advance to incentivize Microsoft to address The Bug because they they know that if they address The Bug Everybody Read The Bug in one month another more Technical application is what I call deniable Time Signature Send to everybody a message saying Let's meet I don't know Let's meet Such date so other Activ Should Have Pro that this message is authenticated by Should Be a Signature but what Joe can do is the following produces a Special Signature essentially proving this I signed m this m let me Such with either the time zone Time time One We in the future or I Sign The Message signed With My Secret Key so as by product this What implies that before Time T2 So This statement consists of Ok the first part The First is i Sign The Message with the time lock zone Time lock zone Sec Time T2 That is not available Yet before Time T2 so the First of Door cannot be satisfied before time2 Okay someone produces a valid Signature It's because this message was signed by Joe Okay so other activist Will say Oh Yes this message was signed by Joe Let's meet R After Time T2 it's like the the Signature is Garbage because everyone could simulate this Signature using the time lock zone Secret Key of Time T2 So What the Activ can do that computer fake Signature of different message let meet Lisbon R and on so if the Authority or enemies they will get in their computer After Time T2 they will not have any proof of Where When the activist have Met so yeah we have a roadmap We Act functional Prototype with Small number of nodes including a University in in R we have a website and we are selecting additional m so if anyone is Inter Join our Please contact us the resour needed To Run our protocol very Light so but more trusted party are batteries and we hopefully think that we can be production the begin next year we it application Show Easy To Build application for example we did the simple application Windows integration To encrypt F files to future you Right click on any file in Windows You Can you are prompt to choose a date and the file is enc with that date and on that date You can decrypt we have Android and also experiment experiment plug Open People gpg We Were able to twe it to send emails To The Future so yeah Just to Show How is Easy To Build lock zone app encrypting timeone Java lock Just need take the from Ine file with Time lock zone just have an to convert your date to what we Call round Because the round corresponds to the round of le of entropy so It's an increasing integer essentially and then from you will download The public of that round all so from that part When you get The public Key the code look identical In any programming language Java Rust Python JavaScript We experiment In essentially The Major programming languages ​​and framework including IOT Devices so That's all If you have any Question we can Talk offline [Applause] thanks i