Perennial secure multi-party computation of universal Turing machine

DOI10.1016/J.TCS.2018.10.012MaRDI QIDQ1737594zbMATH OpenOpenAlexWikidataFDO

Authors Shlomi Dolev, Juan Garay, Niv Gilboa, Vladimir Kolesnikov, Muni Venkateswarlu Kumaramangalam

Publication date 23 April 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.10.012

zbMATH Keywords

information-theoretic securitysecret sharingoblivious Turing-machineperennial computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Towards efficient private distributed computation on unbounded input streams
• Secure outsourced computation
• Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
• Multi-client outsourced computation
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems

Cites work

• scientific article; zbMATH DE number 176541 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Codes Which Detect Deception
• Communication-optimal proactive secret sharing for dynamic groups
• Dynamic and verifiable hierarchical secret sharing
• Fast self-stabilizing Byzantine tolerant digital clock synchronization
• Foundations of Cryptography
• Fully dynamic secret sharing schemes
• Fully homomorphic encryption using ideal lattices
• How to share a secret
• How to withstand mobile virus attacks (extended abstract)
• Information-theoretically secure protocols and security under composition
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Perfectly secure key distribution for dynamic conferences
• Recent approaches to global optimization problems through particle Swarm optimization
• Relations Among Complexity Measures
• Secret Swarm Unit Reactive k −Secret Sharing
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• Swarm intelligence. Introduction and applications
• The round complexity of verifiable secret sharing and secure multicast
• Theory of Cryptography

Cited in

(2)

• Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
• Towards efficient private distributed computation on unbounded input streams

This page was built for publication: Perennial secure multi-party computation of universal Turing machine

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