Article

Free access

Private information storage (extended abstract)

Authors:

Rafail Ostrovsky,

Victor ShoupAuthors Info & Claims

STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Pages 294 - 303

https://doi.org/10.1145/258533.258606

Published: 04 May 1997 Publication History

PDF eReader

References

[1]

M. Abadai, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. JCSS 39(1):21-50, 1989.

Digital Library

Google Scholar

[2]

N. Adam and J. Wortmann. Security control methods for statistical databases: a comparative study. ACM Computing Surveys 21(4):515-555, 1989.

Digital Library

Google Scholar

[3]

A. Ambainis. Upper bound on the communication complexity of private information retrieval. On-line version published in Theory of Cryptography Library, http://theory.lcs.mit.edu/-tcryptol, May 1996.

Google Scholar

[4]

D. Beaver and J. Feigenbaum. Hiding instances in multi-oracle queries. In Proc. of 7th STACS, Springer-Verlag LNC$, Vol.,415, pp. 37-48, 1990.

Crossref

Google Scholar

[5]

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology--Proc. Crypto '90, 1990.

Digital Library

Google Scholar

[6]

M. Ben-or, S. Goldwasser, J. Kilian and A. Wigderson. Multi prover interactive proofs: How to remove intractability. STOC 88.

Digital Library

Google Scholar

[7]

G.R. Blakley. Safeguarding cryptographic keys. In Proc. NCC AFIPS, pp. 313-317, 1979.

Crossref

Google Scholar

[8]

B. Chor and N. Gilboa. Computational}y Private Information Retrieval In this proceedings- $TOC '97.

Digital Library

Google Scholar

[9]

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proc. 36th Annual IEEE Syrup. Foundations Comp. $c~., pp. 41- 50, 1995.

Digital Library

Google Scholar

[10]

O. Goldreich. Personal communication, June of 1996.

Google Scholar

[11]

R.L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. In Foundations of Secure Computation (eds. R. DeMillo, D. Dobkin, A. Jones, and R. Lipton). Academic Press, 1978.

Google Scholar

[12]

O. Goldreich. Towards a theory of software protection and simulation by oblivious RAMs. In Proc. 19th Annual A CM Syrup. Theory Comp., 1987.

Digital Library

Google Scholar

[13]

S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM J. Comput. 18 (1989), pp. 186-208; (also in STOC 85, pp. 291-304.)

Digital Library

Google Scholar

[14]

O. Goldreich, S. Micali, and A. Wigderson. "How to Play Any Mental Game". Proc. of 19th STOC, pp. 218-229, 1987.

Digital Library

Google Scholar

[15]

O. Goldreich and R. Ostrovsky. Software protection and simulation by oblivious RAMs. JACM, 1996.

Digital Library

Google Scholar

[16]

Goldreich, O., S. Goldwasser, and S. Micali, "How To Construct Random Functions," Journal of the Association for Computing Machinery, Vol. 33, No. 4 (October 1986), 792-807.

Digital Library

Google Scholar

[17]

S. Micali. Fair public-key cryptosystems. In Advances in Cryptology--Proc. Crypto '9~, pp. 113-138, 1992.

Crossref

Google Scholar

[18]

R. Ostrovsky. Software protection and simulation on oblivious RAMs. M.I.T. Ph. D. Thesis in Computer Science, June 1992. Preliminary version in Proc. ~2nd Annual ACM Syrup. Theory Comp., 1990.

Crossref

Google Scholar

[19]

A. Shamir. How to Share a Secret. CACM 22:612-613, 1979.

Digital Library

Google Scholar

[20]

A proposed federal information processing standard for an escrowed encryption standard. Federal Register, July 30, 1993.

Google Scholar

[21]

Yao, A.C., "Theory and Applications of Trapdoor Functions", ~3rd FOC$, 1982, pp. 80-91.

Google Scholar

Cited By

View all

Mour T(2025)Distributed Oblivious RAMEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1547(683-686)Online publication date: 8-Jan-2025
https://doi.org/10.1007/978-3-030-71522-9_1547
Kolesnikov VPeceny STrieu NWang X(2024)Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-offCryptography and Communications10.1007/s12095-024-00745-8Online publication date: 24-Sep-2024
https://doi.org/10.1007/s12095-024-00745-8
Ostrovsky B(2024)Privacy-Preserving DijkstraAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_3(74-110)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68400-5_3
Show More Cited By

Index Terms

Private information storage (extended abstract)

Recommendations

Preventing private information leakage in sensor networks
Kraft storage and access for list implementations(Extended Abstract)
STOC '80: Proceedings of the twelfth annual ACM symposium on Theory of computing

This paper is part of an investigation into efficient ways of implementing variable-length lists (see Brown [1]). Storage and access optimality are discussed from an information-theoretic viewpoint; in particular, we develop the notions of Kraft storage ...
Private Private Information
EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation

In a private private information structure, agents' signals contain no information about the signals of their peers. We study how informative such structures can be, and characterize those that are on the Pareto frontier, in the sense that it is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

May 1997

752 pages

ISBN:0897918886

DOI:10.1145/258533

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC97

Sponsor:

SIGACT

STOC97: 29th Annual Symposium on Theory of Computing

May 4 - 6, 1997

Texas, El Paso, USA

Acceptance Rates

STOC '97 Paper Acceptance Rate 75 of 211 submissions, 36%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

154
Total Citations
View Citations
1,190
Total Downloads

Downloads (Last 12 months)235
Downloads (Last 6 weeks)23

Reflects downloads up to 19 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mour T(2025)Distributed Oblivious RAMEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1547(683-686)Online publication date: 8-Jan-2025
https://doi.org/10.1007/978-3-030-71522-9_1547
Kolesnikov VPeceny STrieu NWang X(2024)Fast ORAM with server-aided preprocessing and pragmatic privacy-efficiency trade-offCryptography and Communications10.1007/s12095-024-00745-8Online publication date: 24-Sep-2024
https://doi.org/10.1007/s12095-024-00745-8
Ostrovsky B(2024)Privacy-Preserving DijkstraAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68400-5_3(74-110)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68400-5_3
Lin WMook EWichs D(2024)Doubly Efficient Cryptography: Commitments, Arguments and RAM MPCAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_8(240-273)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_8
Agarwal ABoyle EGilboa NIshai YKelkar MMa Y(2024)Compressing Unit-Vector Correlations via Sparse Pseudorandom GeneratorsAdvances in Cryptology – CRYPTO 202410.1007/978-3-031-68397-8_11(346-383)Online publication date: 16-Aug-2024
https://doi.org/10.1007/978-3-031-68397-8_11
Asharov GKomargodski IMichelson YMeng WJensen CCremers CKirda E(2023)FutORAMa: A Concretely Efficient Hierarchical Oblivious RAMProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623125(3313-3327)Online publication date: 21-Nov-2023
https://doi.org/10.1145/3576915.3623125
Braun LPancholi MRachuri RSimkin MMeng WJensen CCremers CKirda E(2023)Ramen: Souper Fast Three-Party Computation for RAM ProgramsProceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security10.1145/3576915.3623115(3284-3297)Online publication date: 15-Nov-2023
https://dl.acm.org/doi/10.1145/3576915.3623115
Lin WMook EWichs DSaha BServedio R(2023)Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWEProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585175(595-608)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585175
Servan-Schreiber SBeyzerov SYablon EPark H(2023)Private Access Control for Function Secret Sharing2023 IEEE Symposium on Security and Privacy (SP)10.1109/SP46215.2023.10179295(809-828)Online publication date: May-2023
https://doi.org/10.1109/SP46215.2023.10179295
Asharov GKomargodski ILin WShi E(2023)Oblivious RAM with Worst-Case Logarithmic OverheadJournal of Cryptology10.1007/s00145-023-09447-536:2Online publication date: 24-Feb-2023
https://doi.org/10.1007/s00145-023-09447-5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Preventing private information leakage in sensor networks

Kraft storage and access for list implementations(Extended Abstract)

Private Private Information