scientific article; zbMATH DE number 4101088

From MaRDI portal
Publication:3826475





[For the entire collection see Zbl 0635.00021.] The paper is aimed to present a protocol which allows a set of parties to collectively perform different computations, where every party is able to choose certain secret inputs and verify the correctness of the corresponding outputs, all inputs being optimally protected. The protocol relies on the existence of bit commitment schemes which satisfy some desired properties. The concept of protocol is defined with respect to a set of communicating probabilistic Turing machines, in the fourth section of the paper. The main part of the protocol proceeds in two phases: the encryption phase and the computation one; these aspects being presented in sections 6.1 and 6.2 respectively. Results concerning the correctness and security for the considered protocol are established in the next sections. Some further generalizations are suggested in the last part of the paper.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826475)