<<  >> (p.5)
    Author Topic: MerkleWeb - statistical Godel-like secure-but-not-perfect global Turing Machine  (Read 12279 times)
    phillipsjk
    Legendary
    *
    Offline

    Activity: 1008
    Merit: 1001

    Let the chips fall where they may.


    View Profile WWW
    December 27, 2011, 05:00:48 AM
    Last edit: December 27, 2011, 05:35:08 AM by phillipsjk
     #41

    ...the faster algorithm only has to be written once (unless encrypted).

    Wait a minute...You mean the network can run programs without knowing what they do?
    I don't get it. Can you explain it?


    It is possible that I made a slight cognitive leap based on my limited understanding of Homomorphic Encryption.

    In practice, (depressingly) few file formats clearly distinguish between executable code and data. Often due to programmer laziness or feature creep from management[Citation Needed].

    I was making the apparently false assumption that the key-renewal algortihm described in the Damien Stehle and Ron Steinfeld paper was Turing-complete and encrypted. However, skimming the paper without understanding most of the math, it looks like the renewal algorithm is known, but additional "hints" are stored with the public key. This extra information is used to reencrypt/error-correct the private key stored with the encrypted data.

    Edit: the one time I don't check links... or were you concerned by the lack of peer review?

    James' OpenPGP public key fingerprint: EB14 9E5B F80C 1F2D 3EBE  0A2F B3DE 81FF 7B9D 5160
Page 4
Viewing Page: 5