Practical and Secure Solutions for Integer Comparison

DOI10.1007/978-3-540-71677-8_22zbMath1161.94399OpenAlexW1935182841MaRDI QIDQ5756542

Juan A. Garay, Jose Villegas, Berry Schoenmakers

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_22

zbMATH Keywords

secure multi-party computationhomomorphic encryptionMillionaires' problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Constant-round client-aided secure comparison protocol ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Privacy-preserving outsourcing of image feature extraction in cloud computing ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Secure two-party integer comparison protocol without any third party

This page was built for publication: Practical and Secure Solutions for Integer Comparison