Abstract
We provide protocols for the following two-party problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an adaptive manner (i.e. the ith value may depend on the first i−1 values). The sender does not want the receiver to obtain more than k values. This is a variant of the well known Oblivious Transfer (OT) problem and has applications in protecting privacy in various settings. We present efficient protocols for the problem that require an O(N) computation in the preprocessing stage and fixed computation (independent of k) for each new value the receiver obtains. The on-line computation involves roughly log N invocations of a 1-out-2 OT protocol. The protocols are based on a new primitive, sum consistent synthesizers.
| Original language | English |
|---|---|
| Title of host publication | Advances in Cryptology – CRYPTO 1999 - 19th Annual International Cryptology Conference, Proceedings |
| Editors | Michael Wiener |
| Publisher | Springer Verlag |
| Pages | 573-590 |
| Number of pages | 18 |
| ISBN (Print) | 3540663479, 9783540663478 |
| DOIs | |
| State | Published - 1999 |
| Externally published | Yes |
| Event | 19th Annual International Cryptology Conference, CRYPTO 1999 - Santa Barbara, United States Duration: 15 Aug 1999 → 19 Aug 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1666 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 19th Annual International Cryptology Conference, CRYPTO 1999 |
|---|---|
| Country/Territory | United States |
| City | Santa Barbara |
| Period | 15/08/99 → 19/08/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.