On information-theoretic secure multiparty computation with local repairability
From MaRDI portal
Publication:6635769
DOI10.1007/978-3-031-57722-2_7MaRDI QIDQ6635769
Ivan Tjuawinata, Chaoping Xing, Daniel E. Escudero
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast large-scale honest-majority MPC for malicious adversaries
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Secure distributed storage and retrieval
- Overdrive: making SPDZ great again
- Combinatorial repairability for threshold schemes
- Guaranteed output delivery comes free in honest majority MPC
- On the complexity of arithmetic secret sharing
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Fluid MPC: secure multiparty computation with dynamic participants
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Honest majority MPC with abort with minimal online communication
- Synchronous, with a chance of partition tolerance
- A survey and refinement of repairable threshold schemes
- On binary locally repairable codes with distance four
- Secure MPC: laziness leads to GOD
- Efficient fully secure computation via distributed zero-knowledge proofs
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Security in Locally Repairable Storage
- Toward Optimal Secure Distributed Storage Systems With Exact Repair
- Locally Repairable Codes
- A Family of Optimal Locally Recoverable Codes
- On the Locality of Codeword Symbols
- Semi-homomorphic Encryption and Multiparty Computation
- How to share a secret
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Minimum Storage Regenerating Codes for All Parameters
- Optimal Locally Repairable Codes Via Elliptic Curves
- Network Coding for Distributed Storage Systems
- On Optimal Locally Repairable Codes With Super-Linear Length
- Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Construction of Optimal Locally Repairable Codes via Automorphism Groups of Rational Function Fields
- How Long Can Optimal Locally Repairable Codes Be?
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Le Mans: dynamic and fluid MPC for dishonest majority
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- On linear communication complexity for (maximally) fluid MPC
- Perfect MPC over layered graphs
This page was built for publication: On information-theoretic secure multiparty computation with local repairability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635769)
