I can't trust you.
But I'll trust him.
Atomic operations.
Not only must the state change
occur in an indivisible operation
A failed operation can not reveal opaque information of a counterparty.
Assume we know the social millionaires protocol.
Is A == B without revealing A or B
http://en.wikipedia.org/wiki/Secure_multi-party_computation
PUBkey.B.LTC
PUBkey.A.BTC
Private.E
Pub1A.E
Pub2B.E
PUBkey.A.LTC
PUBkey.B.BTC
sig(tx.A.BTC>B.BTC)
sig(tx.B.LTC>A.BTC)
....Simultaneously
Private.E is hidden and defines a homomorphic calculating engine with 2 public 1/2 pub keys.
1million
and builds representational points.
E as an entity remains accountable
The point is. E provides a safe haven for calculation.
I provides proof that calculation is valid.
If the individual TX sigs satisfy the requirements the Private.E is released
If not then the machine remains homomorphically opaque.
You will not be able to decrypt it in time to steal the signature.
and both parties have a TX sig simultaneously.
I can't trust you.
By Stevie
