Completeness: If the statement is true, an honest verifier will be convinced by an honest prover.
Soundness: If the statement is false, no cheating prover can convince an honest verifier that it is true.
Zero-knowledge: If the statement is true, no cheating verifier learns anything other than the fact that the statement is true.
Sunday, December 17, 2017
Is failure to change the default password the same as a Privacy Setting of “Pubic?” In other words, could I do this here?
Russian website streaming hundreds of cameras in Canada, experts warn your connected devices could be at risk
The Toronto-area dental office didn’t know it but the security camera in its waiting room was being streamed live on the Internet.
Anyone could log on to the website and watch as patients came and went. Front-desk staff answering phones and working on their computers entering patient information.
It could be a serious breach of patient privacy. But it’s more than that – unsecured cameras also leave the entire network open for virtual intruders.
The video was being broadcast on Insecam.org, a website originating from Russia. The site picked it up and streamed it along with hundreds of other security cameras that still have factory-default passwords or are left with minimal security.
… Websites like Shodan and NestCam Directory, both hosted in the U.S. and Insecam, currently livestream thousands of cameras from around the world, with up to 400 being livestreamed from Canada.
Could this be a prelude to banning or ranking countries?
Google News warns sites not to hide country of origin
In an attempt to take on fake news head on, Google News has updated its guidelines to prohibit sites that misrepresent or conceal their country of origin or are directed at users in another country under false premises.
Something I can use in several classes. Important for Privacy (anonymity).
What zero-knowledge proofs will do for blockchain
… A zero-knowledge proof or protocol allows a “prover” to assure a “verifier” that they have knowledge of a secret or statement without revealing the secret itself.
An oft-cited example of how a ZK proof works references the “Where’s Waldo?” game and cryptography’s favorite fictional characters, Alice and Bob. If Alice has found Waldo on a particular page, how can she prove this to Bob without revealing Waldo’s location? How does she convince Bob she’s not lying without actually showing him where Waldo is? A low-tech solution involves a large piece of cardboard with a small rectangle cut out of it. Out of Bob’s sight, Alice positions the page behind the cardboard so that only Waldo’s picture is showing through the rectangle, then calls Bob over to show him. As the cardboard is much larger than the book, Bob has no idea where on the page Waldo is located — no other images on the page are exposed — but he can see that Alice has, indeed, discovered him. She can further validate her claim by covering the rectangle with one hand and carefully sliding the book out from beneath the cardboard with the other to reveal the entire page and prove to Bob that the Waldo seen in the rectangle was indeed located on the page under consideration.
… To qualify as zero-knowledge, these protocols must satisfy three requirements:
Once again I am mystified. What did I ever do to France?