Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

265278104 · Jun 202019922001200920182026
48 results for fully homomorphic encryption

Information that is stored in an encrypted format is, by definition, usually not amenable to statistical analysis or machine learning methods. In this paper we present detailed analysis of coordinate and accelerated gradient descent algorithms which are capable of fitting least squares and penalised ridge regression mo…

2017-03-02abs ↗pdf ↗

We present two new statistical machine learning methods designed to learn on fully homomorphic encrypted (FHE) data. The introduction of FHE schemes following Gentry (2009) opens up the prospect of privacy preserving statistical machine learning analysis and modelling of encrypted data without compromising security con…

2015-08-27abs ↗pdf ↗

Modular FHE enables accurate Gaussian process predictions without data exposure.

problem Privacy issues in machine learning with multiple data sources.
method Modular approach to apply FHE only to sensitive parts of a workflow.
result First effectively encrypted Gaussian process model.

Improved CNN accuracy for encrypted data using approximate activation functions.

problem Low accuracy in classifying encrypted data using homomorphic encryption.
method Used a fourth-order polynomial approximation of the Swish activation function with batch normalization for homomorphic encryption.
result Achieved 99.22% accuracy on MNIST and 80.48% on CIFAR-10, improving by 0.04% and 4.11% respectively.

A new bootstrapping method reduces key sizes and runtime in FHE.

problem Large plaintext evaluation in FHE increases bootstrapping complexity.
method New polynomial vector representation and monic monomial permutation matrices.
result Polynomial factor improvement in key size and constant factor in runtime.

Securely analyzes survival data across multiple institutions without revealing individual patient records.

problem Privacy concerns in federated survival analysis of health data.
method Multiparty homomorphic encryption for approximate floating-point computation and encrypted aggregation.
result Privacy-preserving federated Kaplan--Meier survival analysis with high fidelity and predictable overhead.

Secure sum outperforms homomorphic encryption in collaborative deep learning.

problem Training deep learning models on private data from multiple parties without revealing the data.
method Used a secure sum protocol in conjunction with default secure channels.
result Secure sum protocol provides superior properties in terms of collusion-resistance and runtime.

A framework for partially encrypted machine learning using functional encryption.

problem Performing machine learning on encrypted data without revealing sensitive information.
method Combining adversarial training and functional encryption to efficiently compute quadratic functions and prevent feature leakage.
result The proposed framework maintains high model accuracy while significantly improving data privacy.

Privacy-preserving syntactic parsing using obfuscation.

problem Preserving privacy while parsing encrypted natural language data.
method Introducing a neural model that obfuscates words in natural language texts, preserving syntactic relationships.
result The obfuscated text leads to better performance on syntactic parsers compared to a random substitution baseline.

Survey of privacy-preserving distributed deep learning methods.

problem Protecting confidential patterns in data during distributed deep learning.
method Comparison of federated learning, split learning, large batch SGD, and privacy-preserving techniques.
result Trade-offs between computational resources, data leakage, and communication efficiency.

New method stabilizes inputs to DNN for secure inference with LHE.

problem Incompatibility of LHE with nonlinear functions in DNN.
method Training with polynomial approximations and Min-Max normalization.
result Loss in prediction accuracy reduced to small values or eliminated.

HCFContext predicts mobile context using collaborative filtering and homomorphic encryption.

problem Accurate mobile context determination for enterprise policies.
method Proposes HPContext and HCFContext models using sequential history and collaborative filtering, with privacy-preserving homomorphic encryption.
result HCFContext enhances context prediction by leveraging related users' observations.

SharedMF uses secret sharing to protect privacy in distributed recommendation systems.

problem Privacy issues in multi-source data for recommendation systems.
method Federated learning and secret sharing technology.
result SharedMF achieves faster execution speed and better data adaptability compared to homomorphic encryption methods.

SecureGBM securely trains GBM models across two parties without revealing data.

problem Securely training GBM models across parties with encrypted data.
method Extending LightGBM with semi-homomorphic encryption and stochastic approximation.
result SecureGBM achieves AUC within 3% of non-secure LightGBM, maintaining performance.

Two solutions improve privacy-preserving inference with reduced latency and wider neural network support.

problem Balancing accuracy, security, and computational complexity in machine learning with sensitive data.
method Combining Homomorphic Encryption with transfer learning and novel data representation methods.
result More than 10x improvement in latency with wider neural network support.

This paper proposes a new weight representation scheme for efficient model compression and performance enhancement.

problem Challenges in achieving performance enhancement on devices due to irregular sparse matrix representations.
method Fine-grained and unstructured pruning method combined with structured weight encryption.
result Achieved high compression ratios and performance on various deep learning models.

Efficient privacy-preserving machine learning framework using random transformations.

problem Slow training and inference speed in privacy-preserving machine learning systems.
method Random transformations like linear and permutation, combined with arithmetic sharing.
result High efficiency and low computation cost in private machine learning.

Paper proposes DPN for encrypted speech recognition, maintaining privacy and security.

problem Privacy and security issues in cloud-based speech recognition.
method Deep Polynomial Network (DPN) for encrypted speech, cloud-local joint decoding.
result DPN can make frame-level predictions over encrypted speech and return them in encrypted form.

End-to-end encrypted neural network improves privacy and compression in federated learning.

problem Privacy and bandwidth issues in gradient updates transmission in federated learning.
method Proposes an end-to-end encrypted neural network to encode and decode gradient updates.
result Effective privacy protection and data compression with minimal accuracy loss.

Paper proposes privacy-preserving learning for images, making them imperceptible to humans but recognizable by machines.

problem Conflict between developing AI systems and protecting sensitive training data.
method Encryption strategies (random shuffling and sub-patch mixing) followed by minimal adaptation to vision transformer.
result Achieves comparable accuracy to competitive methods while ensuring human-imperceptibility of encrypted images.

Paper proposes efficient privacy-preserving matrix encryption for secure collaborative learning against malicious adversaries.

problem Secure collaborative learning of sensitive data across different agencies is challenging with malicious adversaries.
method The paper applies matrix encryption to secure data against chosen plaintext attack, known plaintext attack, and collusion attack, achieving local differential privacy and high computation efficiency.
result The proposed schemes are computationally efficient and secure against malicious adversaries compared to existing techniques.

New defense method inspired by encryption improves visual classification accuracy.

problem Conventional defenses reduce accuracy and are defeated by obfuscated gradients.
method Block-wise pixel shuffling with secret key for training and test images.
result Achieves high accuracy (91.55%) on clean images and (89.66%) on adversarial examples.

A simple encoder and complex decoder for secure image encryption and decryption.

problem Secure and efficient image encryption and decryption.
method Uses a shallow encoder neural network for encryption and a deep decoder for decryption, trained independently.
result Decrypted images are nearly identical to the original, demonstrating the effectiveness of the framework.

FLAMECHE solves the CFL trilemma by enabling encryption-compatible metadata-based clustering.

problem The CFL trilemma: improving two dimensions of privacy, communication, and computation comes at the expense of the third.
method FLAMECHE reformulates metadata-based CFL as a distributed EM procedure, allowing compatibility with secure FL schemes.
result FLAMECHE improves the effectiveness of client models and enables encryption-compatible clustering.

AI tested on 10 math questions from research.

problem Assessing AI's ability to solve research-level math problems.
method Shared 10 math questions not previously publicly available.
result Answers to questions are known to authors but encrypted.