Security, veriflability, and universality in distributed computing

DOI10.1016/0196-6774(90)90023-8MaRDI QIDQ3493230zbMATH OpenOpenAlexWikidataFDO

Authors Ming-Deh A. Huang, Shang-Hua Teng

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(90)90023-8

zbMATH Keywords

distributed computationsfault- tolerant protocolsecurityuniversalityverifiability

Mathematics Subject Classification ID

General theory of computer systems (68M01) Distributed algorithms (68W15)

Recommendations

• Fault-tolerant Computation in the Full Information Model
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• scientific article; zbMATH DE number 1304184
• Publication:3210140
• scientific article; zbMATH DE number 4195141

Cited in

(7)

• Functional inversion and communication complexity
• Mathematical problems in cryptology
• Redundancy in distributed proofs
• Shared verification cryptography domains: Security in computers
• Fault-tolerant Computation in the Full Information Model
• scientific article; zbMATH DE number 1950674 (Why is no real title available?)
• Distributed Computing

This page was built for publication: Security, veriflability, and universality in distributed computing

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