https://github.com/cowlicks/socialist-millionaire-go
Socialist Millionaires' Protocol (SMP) implementation in go
https://github.com/cowlicks/socialist-millionaire-go
cryptography protocol smp socialist-millionaires
Last synced: about 1 month ago
JSON representation
Socialist Millionaires' Protocol (SMP) implementation in go
- Host: GitHub
- URL: https://github.com/cowlicks/socialist-millionaire-go
- Owner: cowlicks
- Created: 2016-11-25T18:38:26.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2016-12-15T18:51:02.000Z (over 8 years ago)
- Last Synced: 2025-03-25T07:12:59.168Z (2 months ago)
- Topics: cryptography, protocol, smp, socialist-millionaires
- Language: Go
- Size: 15.6 KB
- Stars: 9
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# socialist-millionaire-go
Socialist Millionaires' Protocol (SMP) implementation in go
This is usually used when two parties want to check they have the same shared
secret over an insecure channel. The protocol cannot be Man-in-the-Middled, and
eavesdroppers cannot determine whether or not Alice and Bob shared the same
secret.
**This is homemade unaudited crypto for research and educational use only.
Do not use it in a real production environment.**
Usage example:
```go
// Public information shared in the exchange
pub := NewPublic()
// The secret message
msg := []byte("El pueblo unido")
// Create the parties
alice := NewPerson(pub, msg)
bob := NewPerson(pub, msg)
// Alice and Bob secure some values with Diffie-Hellman exchanges
alice.FirstKeyReceive(bob.FirstKeySend())
bob.FirstKeyReceive(alice.FirstKeySend())
// They do another exchange of derived values
alice.SecondReceive(bob.SecondSend())
bob.SecondReceive(alice.SecondSend())
// Final exchange
alice.FinalReceive(bob.FinalSend())
bob.FinalReceive(alice.FinalSend())
// They check if their secret messages were the same
fmt.Println(bob.Check()) // true
fmt.Println(alice.Check() // true
```