Secure approximate nearest neighbor search with locality-sensitive hashing
From MaRDI portal
Publication:6558611
DOI10.1007/978-3-031-51479-1_21MaRDI QIDQ6558611
Wei Peng, Yi Wang, Lin Liu, Rongmao Chen, Shang Song
Publication date: 19 June 2024
Searching and sorting (68P10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25) Privacy of data (68P27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New protocols for secure equality test and comparison
- Security and composition of multiparty cryptographic protocols
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Improved OT Extension for Transferring Short Secrets
- Two Halves Make a Whole
- Function Secret Sharing
- Private information retrieval
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Least squares quantization in PCM
- How to Simulate It – A Tutorial on the Simulation Proof Technique
- APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS
- Locality-sensitive hashing scheme based on p-stable distributions
- Distributed Point Functions and Their Applications
- Advances in Cryptology - CRYPTO 2003
- Practical and Secure Solutions for Integer Comparison
- Prio+: privacy preserving aggregate statistics via Boolean shares
This page was built for publication: Secure approximate nearest neighbor search with locality-sensitive hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558611)
