Scalable multi-party private set union from multi-query secret-shared private membership test
From MaRDI portal
Publication:6595683
DOI10.1007/978-981-99-8721-4_8zbMATH Open1546.94087MaRDI QIDQ6595683
Publication date: 30 August 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Efficient set operations in the presence of malicious adversaries
- New protocols for secure equality test and comparison
- Combining private set intersection with secure two-party computation
- An efficient toolkit for computing private set operations
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Private set operations from oblivious switching
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Oblivious key-value stores and amplification for private set intersection
- Scalable private set union from symmetric-key techniques
- SpOT-light: lightweight private set intersection from sparse OT extension
- Secret-shared shuffle
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series
- Ciphers for MPC and FHE
- Privacy-Preserving Set Union
- Foundations of Cryptography
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Advances in Cryptology - EUROCRYPT 2004
- Information Security and Privacy
- Privacy-Preserving Set Operations
- Privacy-Preserving Graph Algorithms in the Semi-honest Model
- Improved private set intersection for sets with small entries
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
Related Items (1)
This page was built for publication: Scalable multi-party private set union from multi-query secret-shared private membership test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595683)
