Privacy concern has been increasingly important in many machine learning (ML) problems. We study empirical risk minimization (ERM) problems under secure multi-party computation (MPC) frameworks. Main technical tools for MPC have been developed based on cryptography. One of limitations in current cryptographically priva…
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
48 results for “Cryptographic Security”
Enhances fault tolerance of neural networks for security-critical applications.
problem Fault tolerance of neural networks is biased and can lead to severe consequences in security-critical scenarios.
method Proposes a revised implementation that significantly enhances the fault tolerance property of neural networks with detailed mathematical analysis.
result Significantly increased fault tolerance of neural networks for security-critical applications.
Paper proposes scalable privacy-preserving DNN for industrial applications.
problem Data isolation and scalability issues in deep neural networks.
method Split computation graph into private and neutral server parts; use cryptographic techniques for private data.
result Demonstrates practicality of the proposed scalable privacy-preserving DNN.
Safe-House secures DeFi by limiting losses and enhancing security.
problem Ongoing hacks and security concerns in DeFi.
method Safe-House uses blockchain principles to secure asset movements.
result Safe-House limits maximum one-time loss to specified limits.
SOTERIA optimizes neural networks for secure inference with minimal overhead.
problem Protecting user privacy in ML-as-a-service models with low overhead.
method Neural architecture search with dual objectives of accuracy and cryptographic efficiency.
result SOTERIA constructs efficient models for secure inference.
Biscotti uses blockchain for secure peer-to-peer ML without central coordination.
problem Secure and private multi-party machine learning with trust and poisoning attacks.
method Decentralized peer-to-peer ML using blockchain and cryptography.
result Biscotti protects privacy and model performance against 30% adversaries.
New method defends machine learning models from black-box attacks.
problem Protecting machine learning models from black-box transfer attacks.
method Randomized ensemble technique with provable security guarantee.
result Empirical evidence of security for random binary classifiers.
Approach to verify neural network training integrity.
problem Poisoning attacks during neural network training.
method Use of cryptographic mechanisms to verify training integrity.
result Provable verification of neural network training integrity.
Optimizes crypto-oriented neural architectures for faster secure inference.
problem Privacy conflicts between model users and providers in neural network applications.
method Proposes a novel Partial Activation layer to optimize the initial design of crypto-oriented neural architectures.
result Significant improvement in the efficiency of secure inference on common evaluation metrics.
Generative adversarial networks improve pseudo-random number generation.
problem Improving the quality of pseudo-random number generators.
method Training a GAN to generate sequences that are hard for an adversary to predict.
result GAN-trained neural networks can produce pseudo-random sequences with good statistical properties.
CodedPrivateML secures ML training data and models.
problem Training machine learning models while keeping data private.
method Data and model-theoretically private approach with parallelization.
result Significant speedup over cryptographic methods.
PD-ML-Lite uses lightweight cryptography for private distributed machine learning.
problem Privacy issues in learning from distributed data.
method Applying lightweight cryptographic protocols to build learning algorithms.
result Achieves the same accuracy as non-private methods while maintaining privacy.
Post-Quantum Secure Federated DeFi for Inclusive Banking
problem Financial systems and DeFi ecosystems are vulnerable to quantum computing threats.
method Post-Quantum Secure Federated DeFi framework using lattice-based FHE.
result End-to-end homomorphic computation enables inter-bank collaboration.
This paper reviews ML and DL for IoT security, highlighting gaps and future directions.
problem Security and privacy issues in IoT networks due to resource constraints and dynamic behavior.
method Systematic review of current security solutions and ML/ DL approaches.
result ML and DL are essential for IoT security due to resource constraints and dynamic behavior.
Novel algorithm for privacy-preserving distributed learning in analog domain.
problem Privacy-preserving distributed learning over analog data.
method Proposes a novel algorithm for analog data, leveraging real/complex number representation and information-theoretic security metrics.
result Demonstrates a fundamental trade-off between privacy and accuracy in analog domain distributed learning.
Federated learning platform for drug discovery without sharing data.
problem Lack of secure collaboration in drug discovery.
method Industry-scale federated learning platform using cryptographic aggregation.
result Generated new scientific discoveries in drug discovery.
Post-quantum cryptography needed for blockchain security.
problem Quantum computers threaten traditional blockchain cryptography.
method Review of theoretical cryptography and quantum information theory.
result Post-quantum cryptography is essential for blockchain security.
This paper applies secure multi-party computation to K-means clustering to protect private data.
problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.
In the last decade, deep learning algorithms have become very popular thanks to the achieved performance in many machine learning and computer vision tasks. However, most of the deep learning architectures are vulnerable to so called adversarial examples. This questions the security of deep neural networks (DNN) for ma…
Safeguarding privacy in machine learning is highly desirable, especially in collaborative studies across many organizations. Privacy-preserving distributed machine learning (based on cryptography) is popular to solve the problem. However, existing cryptographic protocols still incur excess computational overhead. Here,…
Cryptographic schemes use Thurston norm from 3-manifold topology.
problem Creating secure cryptographic keys.
method Public-key and symmetric-key schemes based on Thurston norm.
result Cryptographic security from 3-manifold topology.
Study shows computational hardness can improve adversarial robustness in learning.
problem Developing robust machine learning models against adversarial attacks.
method Investigate if computational limitations of attackers can enhance robustness.
result Demonstrated a learning task where computational robustness outperforms information-theoretic robustness.
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…
SANNS secures -NNS queries and results without revealing them.
problem Securely searching for nearest neighbors without exposing sensitive data.
method Optimized linear scan and clustering-based algorithm with cryptographic primitives.
result SANNS achieves up to 31x faster response times and scales to 10 million entries.
Securely evaluates the benefits of merging datasets for causal estimation.
problem Challenges in assessing the value of merging datasets for causal treatment effect estimation.
method Cryptographically secure multi-party computation to evaluate Expected Information Gain (EIG) while ensuring privacy.
result Demonstrates the first privacy-preserving method for dataset acquisition tailored to causal estimation.
Machine learning enhances wireless network authentication for diverse devices.
problem Complex dynamic wireless environments challenge conventional authentication methods.
method Intelligent authentication using machine learning for diverse physical layer attributes.
result Machine learning-based authentication provides cost-effective, reliable, and situation-aware security.
Quantum computing offers new solutions for financial optimization, pricing, risk, and security.
problem Core financial bottlenecks in combinatorial search, expectation estimation, and rare-event analysis.
method Identify bottlenecks, specify quantum primitives, compare with classical benchmarks, assess under constraints.
result Strongest near-term case for quantum finance in hybrid workflows, constrained search, and amplitude-estimation.
The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk are cryptocurrencies, a market currently worth over 150 billion USD. We investigate the risk of Bitcoin, …
This review covers quantum computing applications in finance and blockchain.
problem Challenges in finance and blockchain security with quantum computing.
method Systematic review of recent quantum finance and blockchain work.
result Quantum-resistant blockchain systems and security measures.
New adversarial examples from crypto generators show robust machine learning challenges.
problem Adversarial examples in machine learning due to cryptographic pseudo-random generators.
method Constructing a binary classification task with maximal robustness and proving computational hardness under cryptographic assumptions.
result Maximally robust classifiers can tolerate perturbations of size comparable to the examples themselves, highlighting computational hardness.
Prime Match protects client stock trades from market price manipulation.
problem Protecting client stock trades from market price manipulation.
method Prime Match uses a two-round secure linear comparison protocol to match orders without revealing information.
result Prime Match reduces market impact and maintains client privacy.
PBM mechanism improves privacy and accuracy in federated learning.
problem Secure and private federated learning with limited privacy budget.
method Poisson Binomial mechanism for discrete differential privacy.
result Achieves same privacy-accuracy trade-offs as Gaussian mechanism.
Reduces learning periodic neural networks to lattice problems, proving hardness under cryptographic assumptions.
problem Learning single periodic neurons in noisy environments.
method Reduction to worst-case lattice problems, using LLL algorithm.
result Polynomial-time algorithms for learning these functions are hard under cryptographic assumptions.
Origami uses SGX enclaves and blinding to protect deep neural network inference privacy.
problem Protecting deep neural network inference privacy in machine learning services.
method Combines enclave execution, cryptographic blinding, and accelerator-based computation.
result Demonstrates improved privacy-preserving inference performance compared to prior work.
Paper tackles efficient HMM learning with conditional samples.
problem Cryptographic hardness in learning HMMs from i.i.d. samples.
method Interactive access model, polynomial-time algorithms for conditional probabilities and latent low rank structures.
result Efficient algorithms for HMM learning in both exact and approximate conditional settings.
New spoofing strategies show PoL verification is more vulnerable than previously thought.
problem Vulnerability of Proof-of-Learning verification mechanisms.
method Developed new spoofing strategies that can be reproduced across different configurations and are more cost-effective.
result Current PoL verification is not robust to adversaries and requires further understanding of optimization in deep learning.
PHAZE framework uses zkML and hashing for fast, verifiable LHC trigger decisions.
problem Inefficient inference on large machine learning models for LHC trigger performance.
method Cryptographic techniques like hashing and zkML for low latency, certifiable inference.
result Achieves nanosecond-order latency for LHC triggers, enabling dynamic low-level triggers.
Quantum crypto-economics: Blockchain prediction markets for the evolution of quantum technologyq-fin.PR
Quantum crypto-economics models price risks in blockchain technology.
problem Quantum technology's potential to undermine blockchain security.
method Building financial models to price quantum risk in blockchain scenarios.
result Quantum crypto-economics models can assess and price quantum risks in blockchain.
This paper strengthens the computational separation between multimodal and unimodal learning, showing unimodal learning is hard on typical instances.
problem Theoretical justification for empirical success of multimodal machine learning.
method Introduced a stronger average-case computational separation between unimodal and multimodal learning.
result For typical instances, unimodal learning is computationally hard, while multimodal learning is easy.
Hard to estimate -accurate scores without strong assumptions.
problem Estimating the score of unknown data distributions accurately.
method Reduction to generating samples and leveraging lattice-based cryptography hardness.
result Score estimation is computationally hard even with polynomial sample complexity.
Local regularization fails in transductive learning for some multiclass problems.
problem Whether local regularization can learn all transductive multiclass problems.
method Provided a negative answer by exhibiting a specific multiclass problem.
result Local regularization cannot learn all transductive multiclass problems.
A scalable protocol for federated averaging with privacy and correctness guarantees.
problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.
Framework certifies fairness of machine learning models interactively and privately.
problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.
This paper analyzes tokenized U.S. Treasuries, revealing patterns and roles in blockchain transactions.
problem Limited empirical analysis of transaction-level behaviors in tokenized U.S. Treasuries.
method Quantitative dissection of U.S. Treasury-backed RWA tokens across multiple chains, introducing a curvature-aware representation learning model for address-level economic role inference.
result Decoded transaction-level patterns reveal the degree of retail participation and distinguish roles in Web3 finance.
Quantum computers outperform classical methods in density modeling.
problem Density modeling with quantum computers.
method Quantum-classical separation for density modeling.
result Quantum computers offer a super-polynomial advantage over classical algorithms for density modeling.
Boosting algorithm reduces error in noisy data.
problem Improving weak learners in the presence of Massart noise.
method First computationally efficient boosting algorithm for Massart noise.
result Achieves misclassification error arbitrarily close to Massart noise threshold.
CryptoNAS improves PI accuracy by 3.4% with 2.4x less latency.
problem Private inference on machine learning models with limited latency.
method Developed CryptoNAS, a novel NAS method for finding models that maximize accuracy within a ReLU budget.
result Improves accuracy by 3.4% and latency by 2.4x over state-of-the-art methods.
There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by the author and Nuno Franco, originally intended to solve the Conjugacy Search Pro…