Socialist millionaire problem
In cryptography, the socialist millionaire problem is one in which two millionaires want to determine if their wealth is equal without disclosing any information about their riches to each other. It is a variant of the Millionaire's Problem whereby two millionaires wish to compare their riches to determine who has the most wealth without disclosing any information about their riches to each other.
Socialist millionaire problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Cryptographic problem In cryptography , the socialist millionaire problem [ 1 ] is one in which two millionaires want to determine if their wealth is equal without disclosing any information about their riches to each other. It is a variant of the Millionaire's Problem [ 2 ] [ 3 ] whereby two millionaires wish to compare their riches to determine who has the most wealth without disclosing any information about their riches to each other. It is often used as a cryptographic protocol that allows two p
related reading
- Secure multi-party computation - Wikipediaen.wikipedia.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Lecture 14: Zero knowledge proofsboazbarak.org
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- Diffie–Hellman key exchange - Wikipediaen.wikipedia.org
- slips/slip-0039.md at master · satoshilabs/slipsgithub.com
- thesis.pdfaayushg.com
- Nick Szabo -- Mutually Confidential Computationfon.hum.uva.nl
- Collaborative zkSNARKseprint.iacr.org
- Practical Multi-party Private Set Intersection from Symmetric-Key Techniqueseprint.iacr.org