![]() now present time august 2016 a source within Dropbox confirms to TechCrunch that also passwords were stolen in 2012 in 2012 Dropbox didn't mention that passwords were taken from users in 2012 Dropbox only anounced that it is about a small number of users of which only email-addresses were taken Using the Wolfram Language, you can easily model and reason about these types of protocols and computations and even implement them for production-level code.Today there is a publication in the main news in the Netherlands about Dropbox, read it here Another related type of computation is a “ zero-knowledge proof,” where one party proves to another party that they know a certain value without revealing it. The concept behind all this somewhat mysterious trickery is called “ secure multi-party computation.” These types of computations let people compute a function over their data, without revealing the data itself to each other. For example, API functions in the Wolfram Cloud could be used as a shared mechanism to run the individual computation steps. Another way to address this is to use a shared, trusted computation source. If Alice had cheated, this would have eventually come out. ![]() One way they could have addressed that is by automating the procedure and running it many times. But the chance of detecting that would be low. ![]() If Bob had the king of spades (the highest card), and Alice pretended to have that card too, then Bob would know that Alice had cheated. For example, Alice could have modified the code and pretended to have a higher card than Bob. If they had each executed their code on their own machines, it would be possible to cheat. In this case, Alice and Bob were looking at the same notebook and code, which made cheating by either one very difficult. They ran the entire scenario with reversed roles, at which point Alice knew that Bob’s card was lower. So finally Bob knew that Alice’s card was higher, even though he was never told what Alice’s card was. Because a full deck of cards has four copies of each face value, they limited themselves to drawing from a single suit (spades): They started out by examining their deck of cards and decided that they might as well use a virtual deck of cards, for example this deck from the Wolfram Function Repository. It was not immediately clear how to do this, or if this was even possible, but they both began to discuss this problem and put the actual card game aside for a moment. ![]() They began to wonder if perhaps there was a way for one of them to prove to the other that they indeed were holding the higher card. They argued back and forth about this, but quickly realized neither one wanted to show the other their card, and as a result, they could not start their card game. Alice was quite certain she had the highest card, but Bob was equally certain he did. With that in mind, it came as no surprise that after they each pulled a card from the deck, they did not want to divulge to each other what card they were holding. Bob works as a security specialist for a major bank, and Alice is a programmer who develops cryptographic libraries. One reason for this is that they both have jobs in cryptography. They share very few private details about their lives. Now, there is one thing you need to know about Alice and Bob. Because they are using only one suit, there can be no ties. Then, the person with the highest card value wins. To figure out who gets to go first at the start of the game, they take one suit (spades) from a full deck, and each draws a card. While catching up with my old friends Alice and Bob on Zoom a few days ago, I became intrigued by their recent card game hobby-and how they used the Wolfram Language to settle an argument.
0 Comments
Leave a Reply. |