An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
From MaRDI portal
(Redirected from Publication:3593167)
Recommendations
- Symmetric cryptographic protocols for extended millionaires' problem
- An efficient solution to generalized Yao's millionaires problem
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
- An Efficient and Verifiable Solution to the Millionaire Problem
- Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion
Cited in
(15)- An efficient top-\(k\) query processing with result integrity verification in two-tiered wireless sensor networks
- Influence maximization in social networks with privacy protection
- Multi-party quantum privacy comparison of size based on \(d\)-level GHZ states
- Symmetric cryptographic protocols for extended millionaires' problem
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- Secure multi-party computation protocol for sequencing problem
- An Efficient and Verifiable Solution to the Millionaire Problem
- A fair and efficient solution to the socialist millionaires' problem
- Secure computation of the median (and other elements of specified ranks)
- The complete new solutions to the blind millionaires' problem in \(d\)-dimensional quantum system
- Controllable forward secure identity-based encryption with equality test in privacy-preserving text similarity analysis
- Public key authenticated encryption with keyword search improved: strong security model and multi-keyword construction
- Client-aided privacy-preserving machine learning
- Higher residuosity attacks on small RSA subgroup decision problems
- Set signatures and their applications
This page was built for publication: An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593167)
