Abstract
A model of symmetrically-private information retrieval (SPIR), where the privacy of the data as well as of the user is guaranteed, is presented. The transformation of PIR schemes into SPIR schemes is presented, paying at most, a logarithmic factor in communication complexity. A new cryptographic primitive is introduced, denoted as conditional disclosure of secrets.
Original language | English |
---|---|
Pages (from-to) | 151-160 |
Number of pages | 10 |
Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | Proceedings of the 1998 30th Annual ACM Symposium on Theory of Computing - Dallas, TX, USA Duration: 23 May 1998 → 26 May 1998 |
ASJC Scopus subject areas
- Software