Sub-linear, Secure Comparison with Two Non-colluding Parties

DOI10.1007/978-3-642-19379-8_11zbMath1291.94161OpenAlexW1559348249MaRDI QIDQ3084347

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

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

Related Items (5)

\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Private Database Access with HE-over-ORAM Architecture ⋮ Computationally secure pattern matching in the presence of malicious adversaries

This page was built for publication: Sub-linear, Secure Comparison with Two Non-colluding Parties