Efficient and Secure Comparison for On-Line Auctions

DOI10.1007/978-3-540-73458-1_30zbMATH Open1213.68245OpenAlexW1819119697MaRDI QIDQ3608937FDOQ3608937

Authors: Martin Geisler, Mikkel Krøigaard, Ivan B. Damgård 

Publication date: 6 March 2009

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73458-1_30

Recommendations

• Homomorphic encryption and secure comparison
• Practical and Secure Solutions for Integer Comparison
• One-round secure comparison of integers
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• Improved secure integer comparison via homomorphic encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (11)

• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
• A correction to `efficient and secure comparison for on-line auctions'
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• On privacy-preserving biometric authentication
• Private evaluation of a decision tree based on secret sharing
• On the amortized complexity of zero-knowledge protocols
• Secure function extensions to additively homomorphic cryptosystems
• Algorithmic Applications in Management
• Homomorphic encryption and secure comparison
• On the exact round complexity of best-of-both-worlds multi-party computation
• Privacy-preserving outsourcing of image feature extraction in cloud computing

This page was built for publication: Efficient and Secure Comparison for On-Line Auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608937)