151–160 of 171 posts
...... share a hash?
That can reveal the secret. If I know one value out of a known set of values then by sharing a hash anybody can hash the known values until they arrive at my hash, revealing my "secret."
Earlier quoted context omitted.
If you don't know the books position under the foil, and the hole is just big enougn to show it's waldo, you cannot get the coordinates, but you know that the person who covered the book with a punctured foil knows where waldo is. People use the similar concept in geocaching when they forget to bring a pen... take a photo of a geocache against a neutral background (asphalt, grass,...) thus proving they found it, but…
But if you don't know the position of the foil, what does it prove? The other person could just move the foil around arbitrarily until it randomly fits.
Imagine having a where's waldo book, looking for waldo with a friend, and your friend says he's found him... you don't believe him, but he won't show it to you, because then you'll know the location of waldo too. How can he prove, that he found it, without showing the location to you? By taking this punctured-foil approach, he can prove it to you, that he actually did find it, and do it in a way, where you know he really found it, but you still don't know where it is.
Moving the foil randomly enough might work with a book, but this is just an example of a mathematical principle. An rsa key might be between 1 and 2^4096, randomly guessing the number is practically impossible (atleast with current computing power and without waiting literally millions of years). But if the owner uses the key and signs a number you gave him, you verify the signature with his public key, you know that he actually has the private key, but you dont know the actual key.
Scientists used to use anagrams to register scientific discoveries without revealing them. Hooke registered his law of elastic extension using the letters "ceiiinosssttuv”, which he later revealed to unscramble into "ut tensio, sic vis" ("as the tension, so the force"). People did try to brute-force the anagrams. On two occasions, Kepler unscrambled analgrams from Galileo into the statements that (i) Mars has two moo…
I used to play a social deduction game on IRC, and this was one method to reveal things without revealing them.... but it was too powerful so was banned sort of.
According to school professors, the only way to prove that a person knows something is to lock them in a room for an hour or two and have them write down the entire thing on a piece of paper while being watched intently.
Earlier quoted context omitted.
You might not have understood how this works. The prover shows the fact that they know Waldo's position by showing the page covered in foil to the verifier in person (or by taking a picture). The verifier does not manipulate anything. Obviously, there's no way to verify that the page under the foil is the page you think it is. This is more of an analogy / tool to explain things vs an actual secure protocol.
But then what is the point of the foil? Just take a very zoomed in photo of Waldo?
Earlier quoted context omitted.
That can reveal the secret. If I know one value out of a known set of values then by sharing a hash anybody can hash the known values until they arrive at my hash, revealing my "secret."
This is false. When doing a hash commitment you include some randomness along with the value.
Earlier quoted context omitted.
That can reveal the secret. If I know one value out of a known set of values then by sharing a hash anybody can hash the known values until they arrive at my hash, revealing my "secret."
One can also iterate over all primes and brute-force them to break RSA. Yes, it works, but it doesn't because we'll all be dead when your computer has the answer.
Earlier quoted context omitted.
I used to play a social deduction game on IRC, and this was one method to reveal things without revealing them.... but it was too powerful so was banned sort of.
There is also spyfall ( https://boardgamegeek.com/boardgame/166384/spyfall ) which is about one person not knowing what everyone else knows and trying to pretend otherwise. Very popular among my friends.
Earlier quoted context omitted.
> Well secure and rather indisputably valid elections are a solved problem In some countries people would like to have undisputably valid elections, but can't, so I wouldn't call this a solved problem.
They're saying the mechanism by which you have a provably valid election is solved, not that every country that has a populace that wants that has it. But I have a feeling you knew that already.
Scientists used to use anagrams to register scientific discoveries without revealing them. Hooke registered his law of elastic extension using the letters "ceiiinosssttuv”, which he later revealed to unscramble into "ut tensio, sic vis" ("as the tension, so the force"). People did try to brute-force the anagrams. On two occasions, Kepler unscrambled analgrams from Galileo into the statements that (i) Mars has two moo…
Zero-knowledge proofs let others perform that verification before the full answer is revealed (and it might never be).