Fetching the paper…
Reading the bibliography…
The $k$-Nearest Neighbor Search ($k$-NNS) is the backbone of several cloud-based services such as recommender systems, face recognition, and database search on text and images.
Time bounds for selection
M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan · 1973
Earlier work this paper cites.
Finite exchangeable sequences
P. Diaconis and D. Freedman · 1980
Earlier work this paper cites.
Least squares quantization in PCM
S. Lloyd · 1982
Earlier work this paper cites.
An 𝒪 ( n log n ) \mathcal{O}(n\log{}n) sorting network
M. Ajtai, J. Komlós, and E. Szemerédi · 1983
Earlier work this paper cites.
How to generate and exchange secrets
A. C.-C. Yao · 1986
Earlier work this paper cites.
How to play any mental game
O. Goldreich, S. Micali, and A. Wigderson · 1987
Earlier work this paper cites.
The round complexity of secure protocols
D. Beaver, S. Micali, and P. Rogaway · 1990
Earlier work this paper cites.
Precomputing oblivious transfer
D. Beaver · 1995
Earlier work this paper cites.
Object recognition from local scale-invariant features
D. G. Lowe et al · 1999
Earlier work this paper cites.
Public-key cryptosystems based on composite degree residuosity classes
P. Paillier · 1999
Earlier work this paper cites.
The Salsa20 family of stream ciphers
D. J. Bernstein · 2008
Earlier work this paper cites.
Improved garbled circuit: Free XOR gates and applications
V. Kolesnikov and T. Schneider · 2008
Earlier work this paper cites.
Secure multiparty computation goes live
P. Bogetoft, D. L. Christensen, I. Damgård, M. Geisler, T. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, et al · 2009
Earlier work this paper cites.
Privacy-preserving face recognition
Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft · 2009
Earlier work this paper cites.
Kernelized locality-sensitive hashing for scalable image search
B. Kulis and K. Grauman · 2009
Earlier work this paper cites.
Efficient privacy-preserving face recognition
A.-R. Sadeghi, T. Schneider, and I. Wehrenberg · 2009
Earlier work this paper cites.
Privacy-preserving fingercode authentication
M. Barni, T. Bianchi, D. Catalano, M. Di Raimondo, R. Donida Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, F. Scotti, et al · 2010
Earlier work this paper cites.
Privacy-preserving similarity-based text retrieval
H. Pang, J. Shen, and R. Krishnan · 2010
Earlier work this paper cites.
Efficient privacy-preserving biometric identification
D. Evans, Y. Huang, J. Katz, and L. Malka · 2011
Earlier work this paper cites.
Product quantization for nearest neighbor search
H. Jegou, M. Douze, and C. Schmid · 2011
Earlier work this paper cites.
A small depth-16 circuit for the AES s-box
J. Boyar and R. Peralta · 2012
Earlier work this paper cites.
Somewhat practical fully homomorphic encryption
J. Fan and F. Vercauteren · 2012
Earlier work this paper cites.
Secure similarity based document retrieval system in cloud
G. N. Gopal and M. P. Singh · 2012
Cited alongside, same era.
Efficient garbling from a fixed-key blockcipher
M. Bellare, V. T. Hoang, S. Keelveedhi, and P. Rogaway · 2013
Cited alongside, same era.
Privacy-preserving multi-keyword ranked search over encrypted cloud data
N. Cao, C. Wang, M. Li, K. Ren, and W. Lou · 2013
Cited alongside, same era.
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li · 2013
Cited alongside, same era.
Secure k k -nearest neighbor query over encrypted data in outsourced environments
Y. Elmehdwi, B. K. Samanthula, and W. Jiang · 2014
Cited alongside, same era.
Distributed point functions and their applications
N. Gilboa and Y. Ishai · 2014
Revisiting square-root ORAM: efficient random access in multi-party computation
S. Zahur, X. Wang, M. Raykova, A. Gascón, J. Doerner, D. Evans, and J. Katz · 2016
Later among the works it cites.
A simple but tough-to-beat baseline for sentence embeddings
S. Arora, Y. Liang, and T. Ma · 2017
Later among the works it cites.
Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M. Aumüller, E. Bernhardsson, and A. Faithfull · 2017
Later among the works it cites.
User-centric distributed solutions for privacy-preserving analytics
A. Bestavros, A. Lapets, and M. Varia · 2017
Later among the works it cites.
Scaling ORAM for secure computation
J. Doerner and A. Shelat · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Zig-zag sort: A simple deterministic data-oblivious sorting algorithm running in 𝒪 ( n log n ) \mathcal{O}(n\log{}n) time
M. T. Goodrich · 2014
Cited alongside, same era.
Two-stage hashing for fast document retrieval
H. Li, W. Liu, and H. Ji · 2014
Cited alongside, same era.
SCORAM: oblivious RAM for secure computation
X. S. Wang, Y. Huang, T. H. Chan, A. Shelat, and E. Shi · 2014
Cited alongside, same era.
On the concrete hardness of learning with errors
M. R. Albrecht, R. Player, and S. Scott · 2015
Cited alongside, same era.
Ciphers for MPC and FHE
M. R. Albrecht, C. Rechberger, T. Schneider, T. Tiessen, and M. Zohner · 2015
Cited alongside, same era.
Practical and optimal LSH for angular distance
A. Andoni, P. Indyk, T. Laarhoven, I. Razenshteyn, and L. Schmidt · 2015
Cited alongside, same era.
J. Johnson, M. Douze, and H. Jégou · 2017
Later among the works it cites.
How to simulate it–a tutorial on the simulation proof technique
Y. Lindell · 2017
Later among the works it cites.
SecureML: A system for scalable privacy-preserving machine learning
P. Mohassel and Y. Zhang · 2017
Later among the works it cites.
High-dimensional similarity search and sketching: algorithms and hardness
I. Razenshteyn · 2017
Later among the works it cites.
Privacy-preserving search of similar patients in genomic data
G. Asharov, S. Halevi, Y. Lindell, and T. Rabin · 2018
Later among the works it cites.
A pragmatic introduction to secure multi-party computation
D. Evans, V. Kolesnikov, M. Rosulek, et al · 2018
Later among the works it cites.
Gazelle: A low latency framework for secure neural network inference
C. Juvekar, V. Vaikuntanathan, and A. Chandrakasan · 2018
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Y. A. Malkov and D. A. Yashunin · 2018
Later among the works it cites.
Simple Encrypted Arithmetic Library
Microsoft Research Redmond WA · 2018
Later among the works it cites.
Private nearest neighbors classification in federated databases
P. Schoppmann, A. Gascón, and B. Balle · 2018
Later among the works it cites.
Scalable secure computation of statistical functions with applications to k k -nearest neighbors
H. Shaul, D. Feldman, and D. Rus · 2018
Later among the works it cites.
Secure k k -ish nearest neighbors classifier
H. Shaul, D. Feldman, and D. Rus · 2018
Later among the works it cites.
Foreshadow: Extracting the keys to the intel SGX kingdom with transient out-of-order execution
J. Van Bulck, M. Minkin, O. Weisse, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, T. F. Wenisch, Y. Yarom, and R. Strackx · 2018
Later among the works it cites.
Scalable nearest neighbor search for optimal transport
Y. Dong, P. Indyk, I. Razenshteyn, and T. Wagner · 2019
Closest in time.
Data recovery on encrypted databases with k k -nearest neighbor query leakage
E. M. Kornaropoulos, C. Papamanthou, and R. Tamassia · 2019
Closest in time.
Privacy preserving k k -nearest neighbor classification over encrypted database in outsourced cloud environments
W. Wu, U. Parampalli, J. Liu, and M. Xian · 2019
Closest in time.