DocumentCode :
2412142
Title :
Practical and Secure Integer Comparison and Interval Check
Author :
Nergiz, Ahmet Erhan ; Nergiz, Mehmet Ercan ; Pedersen, Thomas ; Clifton, Chris
Author_Institution :
Purdue Univ. West Lafayette, West Lafayette, IN, USA
fYear :
2010
fDate :
20-22 Aug. 2010
Firstpage :
791
Lastpage :
799
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.
Keywords :
Boolean functions; cryptographic protocols; complex boolean functions; data-mining; e-commerce; interval check; protocol; secure integer comparison problem; secure set membership problem; Binary trees; Boolean functions; Encryption; Polynomials; Protocols; homomorphic encryption; millionaire´s problem; secure interval check;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Social Computing (SocialCom), 2010 IEEE Second International Conference on
Conference_Location :
Minneapolis, MN
Print_ISBN :
978-1-4244-8439-3
Electronic_ISBN :
978-0-7695-4211-9
Type :
conf
DOI :
10.1109/SocialCom.2010.121
Filename :
5591469
Link To Document :
بازگشت