No label defined (Q3826475)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4101088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4101088 |
Statements
1988
0 references
multiparty computation
0 references
zero knowledge proof systems
0 references
encryption
0 references
protocol
0 references
bit commitment schemes
0 references
communicating probabilistic Turing machines
0 references
0.7782346606254578
0 references
0.7645848393440247
0 references
0.7621791958808899
0 references
0.7613073587417603
0 references
[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.
0 references