scientific article; zbMATH DE number 4101088
[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.
- scientific article; zbMATH DE number 4191076
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Multiparty computation, an introduction
- Secure multiparty computation and secret sharing
- Minimum disclosure proofs of knowledge
- Secure multiparty computations without computers
- On the communication complexity of zero-knowledge proofs
- Guaranteed output delivery comes free in honest majority MPC
- ATLAS: efficient and scalable MPC in the honest majority setting
- Improved signature schemes for secure multi-party computation with certified inputs
- Secure multi-party computation in large networks
- On the exact round complexity of best-of-both-worlds multi-party computation
- The cost of fault tolerance in multi-party communication complexity
- Communication-efficient distributed oblivious transfer
- Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
- How to fairly reconstruct a shared secret
- On the exact round complexity of secure three-party computation
- Computations with a deck of cards
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Cryptographic protocols and voting
- Best of both worlds. Revisiting the spymasters double agent problem
- Threshold secret sharing with geometric algebras
- Broadcast-optimal four-round MPC in the plain model
- Broadcast-optimal secure computation from black-box oblivious transfer
- On achieving ``best-in-the-multiverse MPC
- Constant-round perfect zero-knowledge computationally convincing protocols
- Bit commitment using pseudorandomness
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- A discrete logarithm implementation of perfect zero-knowledge blobs
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)