We consider the problem of securely computing the Greater Than (GT) predicate and its generalization - securely determining membership in a union of intervals. We approach these problems from the point of view of Q-Conditional Oblivious Transfer (Q-COT), introduced by Di Crescenzo, Ostrovsky and Rajagopalan [4]. Q-COT is an oblivious transfer that occurs iff predicate Q evaluates to true on the parties' inputs. We are working in the semi-honest model with computationally unbounded receiver. In this paper, we propose: (i) a stronger, simple and intuitive definition of COT, which we call strong COT, or Q-SCOT. (ii) A simpler and more efficient one-round protocol for securely computing GT and GT-SCOT. (iii) A simple and efficient modular construction reducing SCOT based on membership in a union of intervals (UI-SCOT) to GT-SCOT, producing an efficient one-round UI-SCOT. © International Association for Cryptologic Research 2004.
CITATION STYLE
Blake, I. F., & Kolesnikov, V. (2004). Strong conditional oblivious transfer and computing on intervals. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3329, 515–529. https://doi.org/10.1007/978-3-540-30539-2_36
Mendeley helps you to discover research relevant for your work.