We present a method called Partitioned Encryption whose main property is its simplicity. It is an extension of Probabilistic Public-Key Encryption , which can be used in designing cryptographic protocols and can be ap...
详细信息
We present a method called Partitioned Encryption whose main property is its simplicity. It is an extension of Probabilistic Public-Key Encryption , which can be used in designing cryptographic protocols and can be applied to distributed problem solving. We also give a modification of Secret Sharing called Partitioned Secret Sharing . We demonstrate the power of Partitioned Encryption: combining it with the partitioning of the user set gives a solution scheme for ‘Verifiable Secret Sharing’ and ‘Simultaneous Broadcast in the Presence of Faults’, which are important primitives of fault-tolerant distributed computing introduced by Chor, Goldwasser, Micali and Awerbuch (1985). The scheme is fully polynomial, simple, and efficient in terms of communication rounds. The basic partitioning methods are suggested as general tools for distributed computing, which are easy to implement and analyze.
暂无评论