One-round secure comparison of integers

DOI10.1515/JMC.2009.003MaRDI QIDQ3632751zbMATH OpenOpenAlexFDO

Authors Vladimir Kolesnikov, Ian Blake

Publication date 12 June 2009

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jmc.2009.003

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Practical and Secure Solutions for Integer Comparison
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• Strong Conditional Oblivious Transfer and Computing on Intervals
• New protocols for secure equality test and comparison
• Homomorphic encryption and secure comparison

Cites work

• Efficient commitment schemes with bounded sender and unbounded receiver

Cited in

(9)

• New protocols for secure equality test and comparison
• Constant-round client-aided secure comparison protocol
• Sub-linear, secure comparison with two non-colluding parties
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• Efficient and Secure Comparison for On-Line Auctions
• Strong Conditional Oblivious Transfer and Computing on Intervals
• Practical and Secure Solutions for Integer Comparison
• Public Key Cryptography - PKC 2006
• Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data

This page was built for publication: One-round secure comparison of integers

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