Practical and Secure Solutions for Integer Comparison
From MaRDI portal
Recommendations
- Improved secure integer comparison via homomorphic encryption
- One-round secure comparison of integers
- Encrypted integer division and secure comparison
- Secure two-party integer comparison protocol without any third party
- A secure and efficient proof of integer in an interval range
- Secure authenticated comparisons
- Integer algorithms in cryptology and information assurance
- Numerical method for comparison on homomorphically encrypted numbers
- Homomorphic encryption and secure comparison
- New protocols for secure equality test and comparison
Cited in
(26)- New protocols for secure equality test and comparison
- Privacy-preserving outsourcing of image feature extraction in cloud computing
- Non-interactive and fully output expressive private comparison
- Secure two-party integer comparison protocol without any third party
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Constant-round client-aided secure comparison protocol
- Threshold properties of prime power subgroups with application to secure integer comparisons
- Fast secure comparison for medium-sized integers and its application in binarized neural networks
- Homomorphic encryption and secure comparison
- Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations
- scientific article; zbMATH DE number 1617945 (Why is no real title available?)
- A secure and efficient protocol for electronic treasury auctions
- Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
- Sub-linear, secure comparison with two non-colluding parties
- Client-aided two-party secure interval test protocol
- Conditional Encrypted Mapping and Comparing Encrypted Numbers
- Efficient and Secure Comparison for On-Line Auctions
- One-round secure comparison of integers
- An efficient solution to generalized Yao's millionaires problem
- Secure equality and greater-than tests with sublinear online complexity
- Information and Communications Security
- Private evaluation of a decision tree based on secret sharing
- Secure approximate nearest neighbor search with locality-sensitive hashing
- Higher residuosity attacks on small RSA subgroup decision problems
- Updatable privacy-preserving blueprints
- Improved secure integer comparison via homomorphic encryption
This page was built for publication: Practical and Secure Solutions for Integer Comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756542)
