Paper Info
Title
Practical and Secure Integer Comparison and Interval Check
Abstract
We propose a solution to the secure integer comparison problem by reducing it to the secure set membership problem on a set where the elements occur in consecutive order. Our protocol provides flexibility due to this reduction such that it can easily be modified to support more complex boolean functions other than the function evaluating the 'Less Than' predicate (LT). In the paper we show one such boolean function, 'IsInInterval', which checks if an integer is in an interval (3I). We also show that our protocols can be easily extended to support shared outputs so that each party would hold a share of the result. Our generic solution can be applied to many e-commerce and data-mining applications requiring one or more such boolean functions to be computed securely. Our protocol not only is adaptable to different boolean functions but also is experimentally more efficient than the state-of-the-art integer comparison protocols supporting shared outputs.
Year
DOI
Venue
2010
10.1109/SocialCom.2010.121
SocialCom/PASSAT
Keywords
Field
DocType
data-mining application,consecutive order,complex boolean function,secure integer comparison,secure set membership problem,boolean function,interval check,different boolean function,generic solution,state-of-the-art integer comparison protocol,secure integer comparison problem,boolean functions,protocols,data mining,binary trees,computer security,e commerce,homomorphic encryption,protocol,polynomials,cryptographic protocols,encryption
Integer,Boolean network,Boolean function,Polynomial,Cryptographic protocol,Computer science,Binary tree,Theoretical computer science,Encryption,Boolean expression
Conference
Citations 
PageRank 
References 
10
0.54
15
Authors
4
Name
Order
Citations
PageRank
Ahmet Erhan Nergiz1774.27
Mehmet Ercan Nergiz229115.64
Thomas Pedersen3948.24
Chris Clifton43327544.44