MPClan: protocol suite for privacy-conscious computations
From MaRDI portal
Publication:6110388
DOI10.1007/s00145-023-09469-zzbMath1517.94120arXiv2206.12224MaRDI QIDQ6110388
Arpita Patra, Nishat Koti, Ajith Suresh, Shravani Patil
Publication date: 5 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12224
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- (Leveled) Fully Homomorphic Encryption without Bootstrapping
- Fast large-scale honest-majority MPC for malicious adversaries
- Overdrive: making SPDZ great again
- Secure computation with low communication from cross-checking
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- The more the merrier: reducing the cost of large scale MPC
- Guaranteed output delivery comes free in honest majority MPC
- Two-sided malicious security for private intersection-sum with cardinality
- An efficient passive-to-active compiler for honest-majority MPC over rings
- ATLAS: efficient and scalable MPC in the honest majority setting
- Honest majority MPC with abort with minimal online communication
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Communication-efficient (client-aided) secure two-party protocols and its application
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
- Concrete efficiency improvements for multiparty garbling with an honest majority
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient fully secure computation via distributed zero-knowledge proofs
- Better Preprocessing for Secure Multiparty Computation
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Authenticated Algorithms for Byzantine Agreement
- How to share a secret
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Differential Privacy: A Survey of Results
- Improved Primitives for Secure Multiparty Integer Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Foundations of Cryptography
- The String-to-String Correction Problem
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- Circuits resilient to additive attacks with applications to secure computation
- Theory of Cryptography
- Fast Software Encryption
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- High-throughput secure three-party computation with an honest majority
- Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
This page was built for publication: MPClan: protocol suite for privacy-conscious computations
