Perennial secure multi-party computation of universal Turing machine
From MaRDI portal
Publication:1737594
DOI10.1016/J.TCS.2018.10.012zbMath1421.68047OpenAlexW2897693141WikidataQ129085543 ScholiaQ129085543MaRDI QIDQ1737594
Muni Venkateswarlu Kumaramangalam, Shlomi Dolev, Niv Gilboa, Juan A. Garay, Vladimir Kolesnikov
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Fully dynamic secret sharing schemes
- Recent approaches to global optimization problems through particle Swarm optimization
- Perfectly secure key distribution for dynamic conferences
- Swarm intelligence. Introduction and applications
- Communication-Optimal Proactive Secret Sharing for Dynamic Groups
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Information-theoretically secure protocols and security under composition
- Fast self-stabilizing byzantine tolerant digital clock synchronization
- Dynamic and Verifiable Hierarchical Secret Sharing
- How to share a secret
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Relations Among Complexity Measures
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Codes Which Detect Deception
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- The round complexity of verifiable secret sharing and secure multicast
- How to withstand mobile virus attacks (extended abstract)
- Secret Swarm Unit Reactive k −Secret Sharing
- Theory of Cryptography
This page was built for publication: Perennial secure multi-party computation of universal Turing machine
