Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
From MaRDI portal
Publication:6595687
DOI10.1007/978-981-99-8721-4_11zbMATH Open1546.94071MaRDI QIDQ6595687
Publication date: 30 August 2024
Symmetric functions and generalizations (05E05) Cryptography (94A60) Communication theory (94A05) Communication complexity, information complexity (68Q11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On the false-positive rate of Bloom filters
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Guaranteed output delivery comes free in honest majority MPC
- ATLAS: efficient and scalable MPC in the honest majority setting
- An algebraic approach to maliciously secure private set intersection
- Communication-efficient unconditional MPC with guaranteed output delivery
- A minimal model for secure computation (extended abstract)
- Efficient General-Adversary Multi-Party Computation
- Non-Interactive Secure Multiparty Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- How to share a secret
- Fully Homomorphic Encryption over the Integers
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- An Unconditionally Secure Protocol for Multi-Party Set Intersection
- Scalable and Unconditionally Secure Multiparty Computation
- Information Theoretically Secure Multi Party Set Intersection Re-visited
- Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
- On the Power of Correlated Randomness in Secure Computation
- On the Bottleneck Complexity of MPC with Correlated Randomness
- Fully homomorphic encryption using ideal lattices
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Advances in Cryptology - EUROCRYPT 2004
- Perfectly-Secure MPC with Linear Communication Complexity
- Privacy-Preserving Set Operations
- Space/time trade-offs in hash coding with allowable errors
- Scalable Multi-party Private Set-Intersection
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
Related Items (1)
Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
This page was built for publication: Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595687)
