Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Rapid demonstration of linear relations connected by boolean operators
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Cryptography in subgroups of Zn
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Conditional encrypted mapping and comparing encrypted numbers
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
A correction to 'efficient and secure comparison for on-line auctions'
International Journal of Applied Cryptography
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Anonymous biometric access control based on homomorphic encryption
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Secure function evaluation based on secret sharing and homomorphic encryption
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Anonymous biometric access control
EURASIP Journal on Information Security - Special issue on enhancing privacy protection in multimedia systems
Secure distortion computation among untrusting parties using homomorphic encryption
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Efficient implementation of the orlandi protocol
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Discrete logarithm based additively homomorphic encryption and secure data aggregation
Information Sciences: an International Journal
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Discrete-Log-Based additively homomorphic encryption and secure WSN data aggregation
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Efficient privacy preserving content based publish subscribe systems
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
A Privacy Preserving Markov Model for Sequence Classification
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Reliable medical recommendation systems with patient privacy
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
Privacy-preserving Kruskal-Wallis test
Computer Methods and Programs in Biomedicine
| Hi-index | 0.00 |
We propose a protocol for secure comparison of integers based on homomorphic encryption. We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty Computation (MPC). We show how our comparison protocol can be used to improve security of online auctions, and demonstrate that it is efficient enough to be used in practice. For comparison of 16 bits numbers with security based on 1024 bits RSA (executed by two parties), our implementation takes 0.28 sec including all computation and communication. Using precomputation, one can save a factor of roughly 10.