cs.CR

Papers

• ZeroDB white paper (2016)
  Michael Egorov and MacLane Wilkison
  —
• The Capacity of Private Information Retrieval (2017)
  Hua Sun and Syed A. Jafar
  —
• Efficient Authentication of Outsourced String Similarity Search (2016)
  Boxiang Dong et al.
  —
• Multiround Private Information Retrieval: Capacity and Storage Overhead (2016)
  Hua Sun and Syed A. Jafar
  —
• Hypercube LSH for approximate near neighbors (2017)
  Thijs Laarhoven
  —
• BLENDER: Enabling Local Search with a Hybrid Differential Privacy Model (2019)
  Brendan Avent et al.
  —
• LRSE: A Lightweight Efficient Searchable Encryption Scheme using Local and Global Representations (2017)
  Ruihui Zhao et al.
  —
• Privacy Preserving Identification Using Sparse Approximation with Ambiguization (2017)
  Behrooz Razeghi et al.
  —
• Inference-Based Similarity Search in Randomized Montgomery Domains for Privacy-Preserving Biometric Identification (2017)
  Yi Wang et al.
  —
• Graph-based time-space trade-offs for approximate near neighbors (2019)
  Thijs Laarhoven
  —
• The Asymptotic Capacity of Private Search (2018)
  Zhen Chen et al.
  —
• Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization (2018)
  Behrooz Razeghi et al.
  —
• Optimizing error of high-dimensional statistical queries under differential privacy (2018)
  Ryan McKenna et al.
  —
• Nearest neighbor decoding for Tardos fingerprinting codes (2019)
  Thijs Laarhoven
  —
• The Capacity of Private Information Retrieval from Heterogeneous Uncoded Caching Databases (2019)
  Karim Banawan and Batuhan Arasli and Yi-Peng Wei and Sennur Ulukus
  —
• SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search (2020)
  Hao Chen and Ilaria Chillotti and Yihe Dong and Oxana Poburinnaya and Ilya Razenshteyn and M. Sadegh Riazi
  —
• Lower Bounds for Oblivious Near-Neighbor Search (2019)
  Kasper Green Larsen and Tal Malkin and Omri Weinstein and Kevin Yeo
  —
• Interpretable Encrypted Searchable Neural Networks (2019)
  Kai Chen and Zhongrui Lin and Jian Wan and Chungen Xu
  —
• Improved Storage for Efficient Private Information Retrieval (2019)
  Karim Banawan and Batuhan Arasli and Sennur Ulukus
  —
• Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases (2019)
  Diego Pennino et al.
  —
• Locality-Sensitive Hashing for Efficient Web Application Security Testing (2020)
  Ilan Ben-Bassat and Erez Rokah
  —
• Compact Merkle Multiproofs (2020)
  Lum Ramabaja et al.
  —
• HERS: Homomorphically Encrypted Representation Search (2022)
  Joshua J. Engelsma and Anil K. Jain and Vishnu Naresh Boddeti
  —
• The nearest-colattice algorithm (2020)
  Thomas Espitau et al.
  —
• Secure Hypersphere Range Query on Encrypted Data (2021)
  Gagandeep Singh and Akshar Kaul
  —
• Achieving differential privacy for $k$-nearest neighbors based outlier detection by data partitioning (2021)
  Jens Rauch et al.
  —
• When Similarity Digest Meets Vector Management System: A Survey on Similarity Hash Function (2021)
  Zhushou Tang et al.
  —
• Real-time Wireless Transmitter Authorization: Adapting to Dynamic Authorized Sets with Information Retrieval (2021)
  Samurdhi Karunaratne et al.
  —
• TreePIR: Efficient Private Retrieval of Merkle Proofs via Tree Colorings with Fast Indexing and Zero Storage Overhead (2024)
  Son Hoang Dau et al.
  —
• Cache-Aided Multi-User Private Information Retrieval using PDAs (2022)
  Kanishak Vaidya and B Sundar Rajan
  —
• GPU-based Private Information Retrieval for On-Device Machine Learning Inference (2023)
  Maximilian Lam et al.
  —
• AVScan2Vec: Feature Learning on Antivirus Scan Data for Production-Scale Malware Corpora (2023)
  Robert J. Joyce et al.
  —
• "Private Prediction Strikes Back!'' Private Kernelized Nearest Neighbors with Individual Renyi Filter (2023)
  Yuqing Zhu et al.
  —
• Geometric Algorithms for $k$-NN Poisoning (2023)
  Diego Ihara Centurion et al.
  —
• Rahmani Sort: A Novel Variant of Insertion Sort Algorithm with O(nlogn) Complexity (2024)
  Mohammad Khalid Imam Rahmani
  —
• Nonlinear Transformations Against Unlearnable Datasets (2026)
  Thushari Hapuarachchi et al.
  —
• Scalable Private Search with Wally (2025)
  Hilal Asi et al.
  —
• Certified Causal Defense with Generalizable Robustness (2026)
  Yiran Qiao et al.
  —
• Jailbreaking and Mitigation of Vulnerabilities in Large Language Models (2026)
  Benji Peng et al.
  —
• Noise-Aware Differentially Private Variational Inference (2026)
  Talal Alrawajfeh et al.
  —
• Differentially Private Learned Indexes (2024)
  Jianzhang Du et al.
  —
• XAttnMark: Learning Robust Audio Watermarking with Cross-Attention (2026)
  Yixin Liu et al.
  —
• HONEYBEE: Efficient Role-based Access Control for Vector Databases via Dynamic Partitioning[Technical Report] (2026)
  Hongbin Zhong et al.
  —
• Enhancing Membership Inference Attacks on Diffusion Models from a Frequency-Domain Perspective (2026)
  Puwei Lian et al.
  —
• Taming Data Challenges in ML-based Security Tasks Using Generative AI (2026)
  Shravya Kanchi et al.
  —
• Access Control for Information-Theoretically Secure Key-Document Stores (2025)
  Yin Li et al.
  —
• BadBlocks: Low-Cost and Stealthy Backdoor Attacks Tailored for Text-to-Image Diffusion Models (2026)
  Jia Wu et al.
  —
• Balancing Privacy and Efficiency: Music Information Retrieval via Additive Homomorphic Encryption (2025)
  William Zerong Wang and Dongfang Zhao
  —
• Optimizing Token Choice for Code Watermarking: An RL Approach (2026)
  Zhimeng Guo et al.
  —
• HiGraph: A Large-Scale Hierarchical Graph Dataset for Malware Analysis (2026)
  Han Chen et al.
  —