Cryptographic Nooses and Commutative Cryptography - jalToorey/IdealMoney GitHub Wiki
...
And the below from Byzantine Encryption‐Hayekian Compression Of a Machiavellian Field:
A short And Long Lesson On Different Levels And Styles of Cryptograpy and Cryptophraphers
Deconstructing a Szabonian Construction
Szabo’s unbelievable works reveals more of its origin and intent.
Here this works is 20 years old, so we must take the Szabonian deconstructive cautions thinking about how we might find the useful framework by think about how szabo might have usefully wrapped a concept of his time.
On the Blind Leading the Blind
Meet the greatest simple equation since e=mc2
Szabo explains ‘blind signatures’ encapsulated in this formula:
gSf(m) = S(m)
The example is commutative encryption. The idea is each encryption layer is indifferent to each other layer. The order doesn’t matter. Szabo give the example of tricking someone into signing a blank check:
The genius behind this discovery: cryptography guru David Chaum. The brilliance lies in step 3: Chaum discovered that some signatures have the property of being "commutative" with the blinding functions: Alice can strip off the blinding in the reverse order which the blinding and signature were applied, leaving just Alice's signature of n. It is as if Alice put a piece of carbon paper inside the envelope!