Econometrics with Privacy Preservation

Published Online:https://doi.org/10.1287/opre.2018.1834

References

  • Abate J, Whitt W (1992a) The Fourier-series method for inverting transforms of probability distributions. Queueing Systems 10(1):5–87.CrossrefGoogle Scholar
  • Abate J, Whitt W (1992b) Numerical inversion of probability generating functions. Oper. Res. Lett. 12(4):245–251.CrossrefGoogle Scholar
  • Abbe EA, Khandani AE, Lo AW (2011) Privacy-preserving methods for sharing financial risk exposures. Working paper, Princeton University, Princeton, NJ.Google Scholar
  • Abbe EA, Khandani AE, Lo AW (2012) Privacy-preserving methods for sharing financial risk exposures. Amer. Econom. Rev. 102(3):65–70.CrossrefGoogle Scholar
  • Acquisti A, Brandimarte L, Loewenstein G (2015) Privacy and human behavior in the age of information. Science 347(6221):509–514.CrossrefGoogle Scholar
  • Acquisti A, Taylor CR, Wagman L (2016) The economics of privacy. J. Econom. Literature 54(2):442–492.CrossrefGoogle Scholar
  • Barnes K (2017) BU launches new collaboration with Honda research institute. The Hariri Nexus (May 17), https://www.bu.edu/hic/2017/05/17/bu-launches-new-collaboration-with-honda-research-institute/.Google Scholar
  • Battey H, Fan J, Liu H, Lu J, Zhu Z (2018) Distributed testing and estimation under sparse high dimensional models. Ann. Statist. 46(3):1352–1382.CrossrefGoogle Scholar
  • Beaver D, Micali S, Rogaway P (1990) The round complexity of secure protocols. Proc. 22nd Annual ACM Symp. Theory Comput. (ACM, New York), 503–513.CrossrefGoogle Scholar
  • Ben-Or M, Goldwasser S, Wigderson A (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proc. 20th Annual ACM Symp. Theory Comput. (ACM, New York), 1–10.CrossrefGoogle Scholar
  • Broadbent A, Tapp A (2007) Information-theoretic security without an honest majority. ASIACRYPT (Springer, New York), 410–426.CrossrefGoogle Scholar
  • Chaum D, Crépeau C, Damgard I (1988) Multiparty unconditionally secure protocols. Proc. 20th Annual ACM Symp. Theory Comput. (ACM, New York), 11–19.CrossrefGoogle Scholar
  • Choudhury GL, Lucantoni DM, Whitt W (1994) Multidimensional transform inversion with applications to the transient M/G/1 queue. Ann. Appl. Probab. 4(3):719–740.CrossrefGoogle Scholar
  • Corrigan-Gibbs H, Boneh D (2017) Prio: Private, robust, and scalable computation of aggregate statistics. Proc. 14th USENIX Sympos. Networked Systems Design Implementation (NSDI '17), Boston, MA, 259–282.Google Scholar
  • Cramer R, Damgård IB, Dziembowski S, Hirt M, Rabin T (1998) Efficient multiparty computations with dishonest minority. BRICS Report Series 5(36):1–19.CrossrefGoogle Scholar
  • Cummings Y-A (2017) Differential privacy as a tool for truthfulness in games. XRDS 24(1):34–37.CrossrefGoogle Scholar
  • Cummings R, Krehbiel S (2018) Differential privacy for growing databases. Working paper, Geogia Institute of Technology, Atlanta.Google Scholar
  • De Montjoye YA, Radaelli L, Singh VK, Petland AS (2015) Unique in the shopping mall: On the reidentifiability of credit card metadata. Science 347(6221):536–539.CrossrefGoogle Scholar
  • Duchi JC, Jordan MI, Wainwright MJ (2013) Local privacy, data processing inequalities, and statistical minimax rates. Working paper, University of California, Berkeley, Berkeley.Google Scholar
  • Duchi JC, Jordan MI, Wainwright MJ (2014) Privacy aware learning. J. ACM 61(6):1–57.CrossrefGoogle Scholar
  • Duffie D, Pan J, Singleton K (2000) Transform analysis and asset pricing for affine jump-diffusions. Econometrica 68(6):1343–1376.CrossrefGoogle Scholar
  • Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. Theory Cryptography Conf. (Springer, New York), 265–284.CrossrefGoogle Scholar
  • Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Foundations Trends Theoretical Comput. Sci. 9(3–4):211–407.CrossrefGoogle Scholar
  • Elahi T, Danezis G, Goldberg I (2014) PrivEx:Private collection of traffic statistics for anonymous communication networks. 21st ACM Conf. Comput. Comm. Security (CCS) (ACM, New York), 1068–1079.Google Scholar
  • Fan J (1991) On the optimal rates of convergence for nonparametric deconvolution problems. Ann. Statist. 19(3):1257–1272.CrossrefGoogle Scholar
  • Feuerverger A, Mureika RA (1977) The empirical characteristic function and its applications. Ann. Statist. 5(1):88–97.CrossrefGoogle Scholar
  • Gilchrist W (2000) Statistical Modelling with Quantile Functions (CRC Press, Boca Raton, FL).CrossrefGoogle Scholar
  • Goldreich O, Micali S, Wigderson A (1987) How to play any mental game. Proc. 19th Annual ACM Symp. Theory Comput. (ACM, New York), 218–229.CrossrefGoogle Scholar
  • Heathcote CR (1977) The integrated squared error estimation of parameters. Biometrika 64(2):255–264.CrossrefGoogle Scholar
  • Horvitz E, Mulligan D (2015) Data, privacy, and the greater good. Science 349(6245):253–255.CrossrefGoogle Scholar
  • Huang C, Huo X (2019) A distributed one-step estimator. Math. Programming 174(1–2):41–76.CrossrefGoogle Scholar
  • Inan A, Kantarcioglu M, Ghinita G, Bertino E (2010) Private record matching using differential privacy. Proc. 13th Internat. Conf. Extending Database Technology (ACM, New York), 123–134.CrossrefGoogle Scholar
  • Jaggi M, Smith V, Takác M, Terhorst J, Krishnan S, Hofmann T, Jordan MI (2014) Communication-efficient distributed dual coordinate ascent. Ghahramani Z, Welling M, Cortes C, Lawrence ND, Weinberger KQ, eds. Adv. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 3068–3076.Google Scholar
  • Karr AF, Lin X, Sanil AP, Reiter JP (2005) Secure regression on distributed databases. J. Comput. Graph. Statist. 14(2):263–279.CrossrefGoogle Scholar
  • King G (2011) Ensuring the data-rich future of the social sciences. Science 331(6018):719–721.CrossrefGoogle Scholar
  • Kursawe K, Danezis G, Kohlweiss M (2011) Privacy-friendly aggregation for the smart-grid. Internat. Sympos. Privacy Enhancing Tech. (Springer, Berlin, Heidelberg), 175–191.CrossrefGoogle Scholar
  • Marx V (2013) Biology: The big challenges of big data. Nature 498(7453):255–260.CrossrefGoogle Scholar
  • Mattila P (1999) Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability, vol. 44 (Cambridge University Press, Cambridge, UK).Google Scholar
  • Melis L, Danezis G, De Cristofaro E (2016) Efficient private statistics with succinct sketches. Working paper, University of College London, London.CrossrefGoogle Scholar
  • Newman AL (2015) What the right to be forgotten means for privacy in a digital age. Science 347(6221):507–508.CrossrefGoogle Scholar
  • Pathak M, Rane S, Raj B (2010) Multiparty differential privacy via aggregation of locally trained classifiers. Lafferty JD, Williams CKI, Shawe-Taylor J, Zemel RS, Culotta A, eds. Adv. Neural Inform. Processing Systems (Curran Associates, Red Hook, NY), 1876–1884.Google Scholar
  • Popa RA, Blumberg AJ, Balakrishnan H, Li FH (2011) Privacy and accountability for location-based aggregate statistics. Proc. 18th ACM Conf. Comput. Comm. Security (ACM, New York), 653–666.CrossrefGoogle Scholar
  • Posner RA (1981) The economics of privacy. Amer. Econom. Rev. 71(2):405–409.Google Scholar
  • Powers DA, Xie Y (2000) Statistical Methods for Categorical Data Analysis, vol. 106 (Academic Press, New York).Google Scholar
  • Quandt RE, Ramsey JB (1978) Estimating mixtures of normal distributions and switching regressions. J. Amer. Statist. Assoc. 73(364):730–738.CrossrefGoogle Scholar
  • Shamir A (1979) How to share a secret. Commun. ACM 22(11):612–613.CrossrefGoogle Scholar
  • Skibba R (2016) Pollsters struggle to explain failures of US presidential forecasts. Nature 539(7629):339–339.CrossrefGoogle Scholar
  • Varian HR (1996) Economic aspects of personal privacy. Privacy and Self-Regulation in the Information Age (Springer, Boston), 101–109.Google Scholar
  • Yao AC-C (1982) Protocols for secure computations. 23rd Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society Press, Washington, DC), 160–164.CrossrefGoogle Scholar
  • Zhang Y, Duchi JC, Wainwright MJ (2013) Communication-efficient algorithms for statistical optimization. J. Mach. Learn. Res. 14(11):3321–3363.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.