Functionally private approximations of negligibly-biased estimators

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 323-334

  Madeira, André ^a   Muthukrishnan, S ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FUNCTION; BOOLEAN FORMULAE; COUNTING PROBLEMS; CRYPTOGRAPHIC ASSUMPTIONS; DATA STREAM MODEL; DISJUNCTIVE NORMAL FORM; NORM ESTIMATIONS; PSEUDORANDOM GENERATORS;

BOOLEAN ALGEBRA; CRYPTOGRAPHY; SOFTWARE ENGINEERING;

ESTIMATION;

EID: 79959761684     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2329     Document Type: Conference Paper

References (19)

1. Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, and Rebecca N. Wright. Secure Multiparty Computation of Approximations. ACM Transactions on Algorithms (TALG), 2(3): 435-472, 2006.
2. Michael Freedman, Kobbi Nissim, and Benny Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT'04: Advances in Cryptology, pages 1-19, 2004.
3. Oded Goldreich. Foundations of Cryptography: Volume II, Basic Applications, Volume 2. Cambridge University Press, New York, NY, USA, July 2004.
4. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to Construct Random Functions. Journal of the ACM, 33(4): 792-807, 1986.
5. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play ANY mental game. In STOC'87, pages 218-229, New York, NY, USA, 1987. ACM.
6. Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, and Kobbi Nissim. Private Approximation of NP-hard Functions. In STOC'01, pages 550-559, 2001.
7. Piotr Indyk. Stable Distributions, Pseudorandom Generators, Embeddings, and Data Stream Computation. Journal of the ACM, 53(3): 307-323, 2006.
8. Piotr Indyk and David P. Woodruff. Polylogarithmic private approximations and efficient matching. In TCC'06, Volume 3876, pages 245-264, 2006.
9. Richard M. Karp and Michael Luby Monte-Carlo Algorithms for Enumeration and Reliability Problems. In SFCS'83, pages 56-64. IEEE Computer Society, 1983. An extended abstract appeared in FOCS'97.
10. Joe Kilian, Andre Madeira, Martin J. Strauss, and Xuan Zheng. Fast Private Norm Estimation and Heavy Hitters. In TCC'08: Proceedings of the Fifth Theory of Cryptography Conference, pages 176-193, New York, NY, USA, 2008. Springer Berlin/Heidelberg.
11. x(0 < oc < 2) Using Stable Random Projections. In SODA'08, pages 10-19, Philadelphia, PA, USA, 2008.
12. S. Muthukrishnan. Data Streams: Algorithms and Applications, Volume 1. Now Publishers, August 2005.
13. Moni Naor and Omer Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. Journal of the ACM, 51(2): 231-262, 2004.
14. J. Nelson and D. P. Woodruff. Revisiting Norm Estimation in Data Streams. ArXiv e-prints, nov 2008.
15. N. Nisan. Pseudorandom Generators for Space-Bounded Computations. In STOC'90, pages 204-212. ACM, 1990.
16. Sanjeev Saluja, K. V. Subrahmanyam, and Madhukar N. Thakur. Descriptive Complexity of flP Functions. Journal of Computer and System Sciences, 50(3): 493-505, June 1995.
17. J. L. Spouge. Computation of the gamma, digamma, and trigamma functions. SIAM Journal on Numerical Analysis, pages 931-944, 1994.
18. Leslie G. Valiant. The Complexity of Enumeration and Reliability Problems. SIAM Journal on Computing, 8(3): 410-421, 1979.
19. Andrew C. Yao. Protocols for Secure Computations. In SFCS'82, pages 160-164, 1982.