Can We Access a Database Both Locally and Privately?
Authors:
- Elette BoyleEBElette Boyle
- Yuval IshaiYIYuval Ishai
- Rafael PassRPRafael Pass
- Mary WoottersMWMary Wootters
- 5 November 2017
- book chapter
- Published by Springer Nature
- p. 662-693
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- On the (im)possibility of obfuscating programsJournal of the ACM, 2012
- Oblivious Polynomial EvaluationSIAM Journal on Computing, 2006
- Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM, 2004
- Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem2004
- Finding Smooth Integers in Short Intervals Using CRT DecodingJournal of Computer and System Sciences, 2002
- Private information retrievalJournal of the ACM, 1998
- On Data Structures and Asymmetric Communication ComplexityJournal of Computer and System Sciences, 1998
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- A note on computational indistinguishabilityInformation Processing Letters, 1990
- How to construct random functionsJournal of the ACM, 1986