Sub-linear, secure comparison with two non-colluding parties

DOI10.1007/978-3-642-19379-8_11MaRDI QIDQ3084347zbMATH OpenOpenAlexFDO

Authors Tomas Toft

Publication date 15 March 2011

Published in Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19379-8_11

zbMATH Keywords

secure computationYao's millionaires' problem

Mathematics Subject Classification ID

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

Recommendations

• Practical and Secure Solutions for Integer Comparison
• New protocols for secure equality test and comparison
• Secure equality and greater-than tests with sublinear online complexity
• One-round secure comparison of integers
• Communication preserving protocols for secure function evaluation

Cited in

(11)

• A secure and efficient protocol for electronic treasury auctions
• Non-interactive and fully output expressive private comparison
• Private database access with HE-over-ORAM architecture
• Secure equality and greater-than tests with sublinear online complexity
• \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
• New protocols for secure equality test and comparison
• Computationally secure pattern matching in the presence of malicious adversaries
• scientific article; zbMATH DE number 1617945 (Why is no real title available?)
• Improved secure integer comparison via homomorphic encryption
• A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
• Efficient Binary Conversion for Paillier Encrypted Values

This page was built for publication: Sub-linear, secure comparison with two non-colluding parties

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