Fetching the paper…
Reading the bibliography…
The method of projections for finding the common point of convex sets
LG Gubin, BT Polyak, and EV Raik. 1967 · 1967
Earlier work this paper cites.
A permutation network
Abraham Waksman. 1968 · 1968
Earlier work this paper cites.
Universal classes of hash functions. In STOC
J. Lawrence Carter and Mark N. Wegman. 1977 · 1977
Earlier work this paper cites.
Extensions of Lipschitz mappings into a Hilbert space
William B Johnson and Joram Lindenstrauss. 1984 · 1984
Earlier work this paper cites.
How to generate and exchange secrets. In Annual Symposium on Foundations of Computer Science
Andrew Chi-Chih Yao. 1986 · 1986
Earlier work this paper cites.
Founding crytpography on oblivious transfer. In Proceedings of annual ACM symposium on Theory of computing
Joe Kilian. 1988 · 1988
Earlier work this paper cites.
The round complexity of secure protocols. In STOC
Donald Beaver, Silvio Micali, and Phillip Rogaway. 1990 · 1990
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson. 1995 · 1995
Earlier work this paper cites.
On the Resemblance and Containment of Documents. In the Compression and Complexity of Sequences
Andrei Z. Broder. 1997 · 1997
Earlier work this paper cites.
Min-Wise Independent Permutations. In STOC
Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. 1998 · 1998
Earlier work this paper cites.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In STOC
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
Similarity Search in High Dimensions via Hashing. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB)
Aristides Gionis, Piotr Indyk, and Rajeev Motwani. 1999 · 1999
Earlier work this paper cites.
Public-key cryptosystems based on composite degree residuosity classes. In International Conference on the Theory and Applications of Cryptographic Techniques
Pascal Paillier. 1999 · 1999
Earlier work this paper cites.
Practical techniques for searches on encrypted data. In IEEE Symposium on Security and Privacy (S&P)
Dawn Xiaoding Song, David Wagner, and Adrian Perrig. 2000 · 2000
Earlier work this paper cites.
Similarity estimation techniques from rounding algorithms. In STOC
Moses S. Charikar. 2002 · 2002
Earlier work this paper cites.
Alternating projections
Stephen Boyd and Jon Dattorro. 2003 · 2003
Earlier work this paper cites.
Privacy-preserving collaborative filtering using randomized perturbation techniques. In IEEE International Conference on Data Mining (ICDM)
Huseyin Polat and Wenliang Du. 2003 · 2003
Earlier work this paper cites.
Nearest neighbours in high-dimensional spaces
Jacob E. Goodman, Joseph O’Rourke, and Piotr Indyk. 2004 · 2004
Earlier work this paper cites.
Differential privacy
Cynthia Dwork. 2006 · 2006
Earlier work this paper cites.
Gender differences in mate selection: Evidence from a speed dating experiment
Raymond Fisman, Sheena S Iyengar, Emir Kamenica, and Itamar Simonson. 2006 · 2006
Earlier work this paper cites.
Finding near-duplicate web pages: a large-scale evaluation of algorithms. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Monika Henzinger. 2006 · 2006
Earlier work this paper cites.
Polylogarithmic private approximations and efficient matching
Piotr Indyk and David Woodruff. 2006 · 2006
Earlier work this paper cites.
Scaling up all pairs similarity search. In WWW
Roberto J. Bayardo, Yiming Ma, and Ramakrishnan Srikant. 2007 · 2007
Earlier work this paper cites.
An introduction to compressive sampling
Emmanuel J Candès and Michael B Wakin. 2008 · 2008
Earlier work this paper cites.
Improved garbled circuit: Free XOR gates and applications. In International Colloquium on Automata, Languages, and Programming
Vladimir Kolesnikov and Thomas Schneider. 2008 · 2008
Earlier work this paper cites.
Iterative hard thresholding for compressed sensing
Thomas Blumensath and Mike E Davies. 2009 · 2009
Cited alongside, same era.
Order-preserving symmetric encryption. In Annual International Conference on the Theory and Applications of Cryptographic Techniques
Alexandra Boldyreva, Nathan Chenette, Younho Lee, and Adam O’neill. 2009 · 2009
Cited alongside, same era.
Estimation of the warfarin dose with clinical and pharmacogenetic data
International Warfarin Pharmacogenetics Consortium et al · 2009
Cited alongside, same era.
Multiparty computation, an introduction
Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen. 2009 · 2009
Cited alongside, same era.
Privacy-preserving face recognition. In International Symposium on Privacy Enhancing Technologies Symposium
Zekeriya Erkin, Martin Franz, Jorge Guajardo, Stefan Katzenbeisser, Inald Lagendijk, and Tomas Toft. 2009 · 2009
Cited alongside, same era.
An ideal-security protocol for order-preserving encoding. In IEEE Symposium on Security and Privacy (S&P)
Raluca Ada Popa, Frank H Li, and Nickolai Zeldovich. 2013 · 2013
Later among the works it cites.
Privacy-preserving nearest neighbor methods: Comparing signals without revealing them
Shantanu Rane and Petros T Boufounos. 2013 · 2013
Later among the works it cites.
Beyond Pairwise: Provably Fast Algorithms for Approximate k-Way Similarity Search. In NIPS
Anshumali Shrivastava and Ping Li. 2013 · 2013
Later among the works it cites.
Secure nearest neighbor revisited. In IEEE International Conference on Data Engineering (ICDE)
Bin Yao, Feifei Li, and Xiaokui Xiao. 2013 · 2013
Later among the works it cites.
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation.. In NDSS
David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2014 · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Christof Paar and Jan Pelzl. 2009 · 2009
Cited alongside, same era.
Efficient privacy-preserving face recognition. In International Conference on Information Security and Cryptology
Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2009 · 2009
Cited alongside, same era.
A survey of collaborative filtering techniques
Xiaoyuan Su and Taghi M Khoshgoftaar. 2009 · 2009
Cited alongside, same era.
Spectral hashing. In Advances in neural information processing systems
Yair Weiss, Antonio Torralba, and Rob Fergus. 2009 · 2009
Cited alongside, same era.
Secure knn computation on encrypted databases. In Proceedings of the ACM SIGMOD International Conference on Management of data
Wai Kit Wong, David Wai-lok Cheung, Ben Kao, and Nikos Mamoulis. 2009 · 2009
Cited alongside, same era.
Privacy-preserving approximation of L1 distance for multimedia applications. In IEEE International Conference on Multimedia and Expo (ICME)
Shantanu Rane, Wei Sun, and Anthony Vetro. 2010 · 2010
Cited alongside, same era.
Secure and efficient protocols for iris and fingerprint identification
Marina Blanton and Paolo Gasti. 2011 · 2011
Cited alongside, same era.
Secure k-nearest neighbor query over encrypted data in outsourced environments. In International Conference on Data Engineering (ICDE)
Yousef Elmehdwi, Bharath K Samanthula, and Wei Jiang. 2014 · 2014
Later among the works it cites.
Privacy in pharmacogenetics: An end-to-end case study of personalized warfarin dosing. In USENIX Security
Matthew Fredrikson, Eric Lantz, Somesh Jha, Simon Lin, David Page, and Thomas Ristenpart. 2014 · 2014
Later among the works it cites.
Coding for Random Projections. In ICML
Ping Li, Michael Mitzenmacher, and Anshumali Shrivastava. 2014 · 2014
Later among the works it cites.
Blind seer: A scalable private dbms. In IEEE Symposium on Security and Privacy (S&P)
Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos Keromytis, and Steve Bellovin. 2014 · 2014
Later among the works it cites.
Building Web Applications on Top of Encrypted Data Using Mylar. In NSDI
Raluca Ada Popa, Emily Stark, Steven Valdez, Jonas Helfer, Nickolai Zeldovich, and Hari Balakrishnan. 2014 · 2014
Later among the works it cites.
ABY: A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.. In NDSS
Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015 · 2015
Later among the works it cites.
Exploring privacy preservation in outsourced k-nearest neighbors with multiple data owners. In Proceedings of the ACM Workshop on Cloud Computing Security Workshop
Frank Li, Richard Shin, and Vern Paxson. 2015 · 2015
Later among the works it cites.
Inference attacks on property-preserving encrypted databases. In ACM SIGSAC Conference on Computer and Communications Security
Muhammad Naveed, Seny Kamara, and Charles V Wright. 2015 · 2015
Later among the works it cites.
TFHE: Fast Fully Homomorphic Encryption Library. (August 2016)
Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. August 2016 · 2016
Closest in time.
Breaking web applications built on top of encrypted data. In Proceedings of ACM SIGSAC Conference on Computer and Communications Security
Paul Grubbs, Richard McPherson, Muhammad Naveed, Thomas Ristenpart, and Vitaly Shmatikov. 2016 · 2016
Closest in time.
CaPSuLe: Camera Based Positioning System Using Learning. In Proceedings of international IEEE System-on-Chip Conference
Y. Moon, S. Noh, D. Park, C. Luo, A. Shrivastava, S. Hong, and K. Palem. 2016 · 2016
Closest in time.
Practical and secure nearest neighbor search on encrypted large-scale data. In International Conference on Computer Communications
Boyang Wang, Yantian Hou, and Ming Li. 2016 · 2016
Closest in time.
PriSearch: Efficient Search on Private Data. In Design Automation Conference
M Sadegh Riazi, Ebrahim M Songhori, and Farinaz Koushanfar. 2017 · 2017
Closest in time.
National Institute of Standards and Technology
http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf . 2017 · 2017
Closest in time.
Distance-sensitive hashing. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Martin Aumüller, Tobias Christiani, Rasmus Pagh, and Francesco Silvestri. 2018 · 2018
Closest in time.
Chameleon: A hybrid secure computation framework for machine learning applications. In Proceedings of the 2018 on Asia Conference on Computer and Communications Security
M Sadegh Riazi, Christian Weinert, Oleksandr Tkachenko, Ebrahim M Songhori, Thomas Schneider, and Farinaz Koushanfar. 2018 · 2018
Closest in time.
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
Martin Aumüller, Rasmus Pagh, and Francesco Silvestri. 2019 · 2019
Closest in time.
Sanns: Scaling up secure approximate k-nearest neighbors search
Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya Razenshteyn, and M Sadegh Riazi. 2019 · 2019
Closest in time.
Lower Bounds for Oblivious Near-Neighbor Search
Kasper Green Larsen, Tal Malkin, Omri Weinstein, and Kevin Yeo. 2019 · 2019
Closest in time.
MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation. In 2019 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)
M Sadegh Riazi, Mojan Javaheripi, Siam U Hussain, and Farinaz Koushanfar. 2019 · 2019
Closest in time.