Article

Prio: private, robust, and scalable computation of aggregate statistics

Authors:

Henry Corrigan-Gibbs,

Dan BonehAuthors Info & Claims

NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation

Pages 259 - 282

Published: 27 March 2017 Publication History

Abstract

This paper presents Prio, a privacy-preserving system for the collection of aggregate statistics. Each Prio client holds a private data value (e.g., its current location), and a small set of servers compute statistical functions over the values of all clients (e.g., the most popular location). As long as at least one server is honest, the Prio servers learn nearly nothing about the clients' private data, except what they can infer from the aggregate statistics that the system computes. To protect functionality in the face of faulty or malicious clients, Prio uses secret-shared non-interactive proofs (SNIPs), a new cryptographic technique that yields a hundred-fold performance improvement over conventional zero-knowledge approaches. Prio extends classic private aggregation techniques to enable the collection of a large class of useful statistics. For example, Prio can perform a least-squares regression on high-dimensional client-provided data without ever seeing the data in the clear.

References

[1]

Abe, M., Cramer, R., and Fehr, S. Noninteractive distributed-verifier proofs and proving relations among commitments. In ASIACRYPT (2002), pp. 206-224.

Digital Library

[2]

Ajtai, M. Generating hard instances of lattice problems. In STOC (1996), ACM, pp. 99-108.

Digital Library

[3]

Alvisi, L., Clement, A., Epasto, A., Lattanzi, S., and Panconesi, A. SoK: The evolution of Sybil defense via social networks. In Security and Privacy (2013), IEEE, pp. 382-396.

Digital Library

[4]

Applebaum, B., Ringberg, H., Freedman, M. J., Caesar, M., and Rexford, J. Collaborative, privacy-preserving data aggregation at scale. In PETS (2010), Springer, pp. 56-74.

Digital Library

[5]

Archer, B., and Weisstein, E. W. Lagrange interpolating polynomial. http://mathworld.wolfram. com/LagrangeInterpolatingPolynomial.html. Accessed 16 September 2016.

[6]

Association, A. P. Beck depression inventory. http://www.apa.org/pi/about/publications/ caregivers/practice-settings/assessment/tools/ beck-depression.aspx. Accessed 15 September 2016.

[7]

Bassily, R., and Smith, A. Local, private, efficient protocols for succinct histograms. In STOC (2015), ACM, pp. 127-135.

Digital Library

[8]

Bayer, S., and Groth, J. Efficient zero-knowledge argument for correctness of a shuffle. In EUROCRYPT (2012), Springer, pp. 263-280.

Digital Library

[9]

Beaver, D. Efficient multiparty protocols using circuit randomization. In CRYPTO (1991), Springer, pp. 420-432.

Digital Library

[10]

Beaver, D. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. Journal of Cryptology 4, 2 (1991), 75-122.

Digital Library

[11]

Beaver, D., Micali, S., and Rogaway, P. The round complexity of secure protocols. In STOC (1990), ACM, pp. 503-513.

Digital Library

[12]

Bellare, M., Hoang, V. T., Keelveedhi, S., and Rogaway, P. Efficient garbling from a fixed-key blockcipher. In Security and Privacy (2013), IEEE, pp. 478-492.

Digital Library

[13]

Ben-David, A., Nisan, N., and Pinkas, B. FairplayMP: a system for secure multi-party computation. In CCS (2008), ACM, pp. 257-266.

Digital Library

[14]

Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A. Multi-prover interactive proofs: How to remove intractability assumptions. In STOC (1988), ACM, pp. 113-131.

Digital Library

[15]

Ben-Or, M., Goldwasser, S., and Wigderson, A. Completeness theorems for noncryptographic fault-tolerant distributed computation. In STOC (1988), ACM, pp. 1-10.

Digital Library

[16]

Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., and Virza, M. SNARKs for C: Verifying program executions succinctly and in zero knowledge. In CRYPTO. Springer, 2013, pp. 90-108.

[17]

Ben-Sasson, E., Chiesa, A., Tromer, E., and Virza, M. Scalable zero knowledge via cycles of elliptic curves. In CRYPTO (2014), Springer, pp. 276-294.

[18]

Ben-Sasson, E., Chiesa, A., Tromer, E., and Virza, M. Succinct non-interactive zero knowledge for a von Neumann architecture. In USENIX Security (2014), pp. 781-796.

Digital Library

[19]

Ben-Sasson, E., Fehr, S., and Ostrovsky, R. Nearlinear unconditionally-secure multiparty computation with a dishonest minority. In CRYPTO. Springer, 2012, pp. 663-680.

Digital Library

[20]

Berthold, O., and Langos, H. Dummy traffic against long term intersection attacks. In Workshop on Privacy Enhancing Technologies (2002), Springer, pp. 110-128.

Digital Library

[21]

Blum, A., Dwork, C., McSherry, F., and Nissim, K. Practical privacy: the SuLQ framework. In PODS (2005), ACM, pp. 128-138.

Digital Library

[22]

Blum, M., Feldman, P., and Micali, S. Noninteractive zero-knowledge and its applications. In STOC (1988), ACM, pp. 103-112.

Digital Library

[23]

Bogetoft, P., Christensen, D. L., Damgard, I., Geisler, M., Jakobsen, T., Kr_igaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., Schwartzbach, M., and Toft, T. Multiparty computation goes live. In Financial Cryptography (2000).

[24]

Boyle, E., Gilboa, N., and Ishai, Y. Function secret sharing. In CRYPTO (2015), Springer, pp. 337-367.

[25]

Boyle, E., Gilboa, N., and Ishai, Y. Function secret sharing: Improvements and extensions. In CCS (2016), ACM, pp. 1292-1303.

Digital Library

[26]

Braun, B., Feldman, A. J., Ren, Z., Setty, S., Blumberg, A. J., and Walfish, M. Verifying computations with state. In SOSP (2013), ACM, pp. 341-357.

Digital Library

[27]

Brickell, J., and Shmatikov, V. Efficient anonymity-preserving data collection. In KDD (2006), ACM, pp. 76-85.

Digital Library

[28]

Broadbent, A., and Tapp, A. Information-theoretic security without an honest majority. In ASIACRYPT (2007), Springer, pp. 410-426.

Digital Library

[29]

Burkhart, M., Strasser, M., Many, D., and Dimitropoulos, X. SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics. USENIX Security (2010).

Digital Library

[30]

Castelluccia, C., Mykletun, E., and Tsudik, G. Efficient aggregation of encrypted data in wireless sensor networks. In MobiQuitous (2005), IEEE, pp. 109-117.

Digital Library

[31]

Chaum, D. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1, 1 (1988), 65-75.

Digital Library

[32]

Chaum, D. L. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24, 2 (1981), 84-90.

Digital Library

[33]

Chen, R., Akkus, I. E., and Francis, P. SplitX: High-performance private analytics. SIGCOMM 43, 4 (2013), 315-326.

Digital Library

[34]

Chen, R., Reznichenko, A., Francis, P., and Gehrke, J. Towards statistical queries over distributed private user data. In NSDI (2012), pp. 169-182.

Digital Library

[35]

Chromium source code. https://chromium. googlesource.com/chromium/src/+/master/ tools/metrics/rappor/rappor.xml. Accessed 15 September 2016.

[36]

Cormode, G., and Muthukrishnan, S. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55, 1 (2005), 58-75.

Digital Library

[37]

Cormode, G., Thaler, J., and Yi, K. Verifying computations with streaming interactive proofs. VLDB 5, 1 (2011), 25-36.

Digital Library

[38]

Corrigan-Gibbs, H., Boneh, D., and Mazières, D. Riposte: An anonymous messaging system handling millions of users. In Security and Privacy (2015), IEEE, pp. 321-338.

Digital Library

[39]

Corrigan-Gibbs, H., and Ford, B. Dissent: accountable anonymous group messaging. In CCS (2010), ACM, pp. 340-350.

Digital Library

[40]

Corrigan-Gibbs, H., Wolinsky, D. I., and Ford, B. Proactively accountable anonymous messaging in Verdict. In USENIX Security (2013), pp. 147-162.

Digital Library

[41]

Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., and Zahur, S. Geppetto: Versatile verifiable computation. In Security and Privacy (2015), IEEE, pp. 253- 270.

Digital Library

[42]

CPP. California Psychological Inventory. https://www.cpp.com/products/cpi/index.aspx. Accessed 15 September 2016.

[43]

Cramer, R., and Shoup, V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In CRYPTO (1998), Springer, pp. 13-25.

Digital Library

[44]

Damgård, I., Keller, M., Larraia, E., Miles, C., and Smart, N. P. Implementing AES via an actively /covertly secure dishonest-majority MPC protocol. In SCN (2012), Springer, pp. 241-263.

Digital Library

[45]

Damgård, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., and Smart, N. P. Practical covertly secure MPC for dishonest majority-or: Breaking the SPDZ limits. In ESORICS (2013), Springer, pp. 1-18.

[46]

Damgård, I., Pastro, V., Smart, N. P., and Zakarias, S. Multiparty computation from somewhat homomorphic encryption. In CRYPTO (2012), pp. 643-662.

Digital Library

[47]

Danezis, G. Better anonymous communications. PhD thesis, University of Cambridge, 2004.

[48]

Danezis, G., Fournet, C., Kohlweiss, M., and Zanella-Béguelin, S. Smart meter aggregation via secret-sharing. In Workshop on Smart Energy Grid Security (2013), ACM, pp. 75-80.

Digital Library

[49]

Danezis, G., and Serjantov, A. Statistical disclosure or intersection attacks on anonymity systems. In Information Hiding (2004), Springer, pp. 293-308.

Digital Library

[50]

DEDIS Research Lab at EPFL. Advanced crypto library for the Go language. https://github.com/dedis/crypto.

[51]

Dingledine, R., Mathewson, N., and Syverson, P. Tor: the second-generation onion router. In USENIX Security (2004), USENIX Association, pp. 21-21.

Digital Library

[52]

Douceur, J. R. The Sybil Attack. In International Workshop on Peer-to-Peer Systems (2002), Springer, pp. 251-260.

Digital Library

[53]

Duan, Y., Canny, J., and Zhan, J. P4P: practical large-scale privacy-preserving distributed computation robust against malicious users. In USENIX Security (Aug. 2010).

Digital Library

[54]

Dwork, C. Differential privacy. In ICALP (2006), pp. 1-12.

Digital Library

[55]

Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., and Naor, M. Our data, ourselves: Privacy via distributed noise generation. In EUROCRYPT. Springer, 2006, pp. 486-503.

Digital Library

[56]

Elahi, T., Danezis, G., and Goldberg, I. PrivEx: Private collection of traffic statistics for anonymous communication networks. In CCS (2014), ACM, pp. 1068-1079.

Digital Library

[57]

Erlingsson, Ú., Pihur, V., and Korolova, A. RAPPOR: Randomized aggregatable privacypreserving ordinal response. In CCS (2014), ACM, pp. 1054-1067.

Digital Library

[58]

Fanti, G., Pihur, V., and Erlingsson, Ú. Building a RAPPOR with the unknown: Privacy-preserving learning of associations and data dictionaries. PoPETS 2016, 3 (2016), 41-61.

[59]

FLINT: Fast Library for Number Theory. http://www.flintlib.org/.

[60]

Fortnow, L., Rompel, J., and Sipser, M. On the power of multi-prover interactive protocols. Theoretical Computer Science 134, 2 (1994), 545-557.

Digital Library

[61]

Freedman, M. J., and Morris, R. Tarzan: A peer-to-peer anonymizing network layer. In CCS (2002), ACM, pp. 193-206.

Digital Library

[62]

Gennaro, R., Gentry, C., Parno, B., and Raykova, M. Quadratic span programs and succinct NIZKs without PCPs. In CRYPTO (2013), pp. 626-645.

[63]

Gerard, A. B. Parent-Child Relationship Inventory. http://www.wpspublish.com/store/p/ 2898/parent-child-relationship-inventory-pcri. Accessed 15 September 2016.

[64]

Gilboa, N., and Ishai, Y. Distributed point functions and their applications. In EUROCRYPT (2014), Springer, pp. 640-658.

[65]

Glanz, J., Larson, J., and Lehren, A. W. Spy agencies tap data streaming from phone apps. http://www.nytimes.com/2014/01/28/world/spy-agencies-scour-phone-apps-for-personal-data. html, Jan. 27, 2014. Accessed 20 September 2016.

[66]

Goldreich, O. Foundations of Cryptography. Cambridge University Press, 2001.

[67]

Goldreich, O., Goldwasser, S., and Halevi, S. Collision-free hashing from lattice problems. Cryptology ePrint Archive, Report 1996/009, 1996. http://eprint.iacr.org/1996/009.

[68]

Goldreich, O., Micali, S., and Wigderson, A. How to play any mental game. In STOC (1987), ACM, pp. 218-229.

Digital Library

[69]

Goldwasser, S., Kalai, Y. T., and Rothblum, G. N. Delegating computation: Interactive proofs for Muggles. Journal of the ACM 62, 4 (2015), 27.

Digital Library

[70]

Goldwasser, S., Micali, S., and Rackoff, C. The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18, 1 (1989), 186-208.

Digital Library

[71]

Goldwasser, S., Micali, S., and Rivest, R. L. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing 17, 2 (1988), 281-308.

Digital Library

[72]

Greenberg, A. Apple's 'differential privacy' is about collecting your data--but not your data. https://www.wired.com/2016/06/ apples-differential-privacy-collecting-data/, June 13, 2016. Accessed 21 September 2016.

[73]

Gueron, S., Lindell, Y., Nof, A., and Pinkas, B. Fast garbling of circuits under standard assumptions. In CCS (2015), ACM, pp. 567-578.

Digital Library

[74]

Guha, S., and McGregor, A. Stream order and order statistics: Quantile estimation in random-order streams. SIAM Journal on Computing 38, 5 (2009), 2044-2059.

Digital Library

[75]

Hilts, A., Parsons, C., and Knockel, J. Every step you fake: A comparative analysis of fitness tracker privacy and security. Tech. rep., Open Effect, 2016. Accessed 16 September 2016.

[76]

Hohenberger, S., Myers, S., Pass, R., and shelat, a. ANONIZE: A large-scale anonymous survey system. In Security and Privacy (2014), IEEE, pp. 375-389.

Digital Library

[77]

Impagliazzo, R., and Naor, M. Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology 9, 4 (1996), 199-216.

Digital Library

[78]

Janosi, A., Steinbrunn, W., Pfisterer, M., and Detrano, R. Heart disease data set. https://archive.ics. uci.edu/ml/datasets/Heart+Disease, 22 July 1988. Accessed 15 September 2016.

[79]

Jawurek, M., and Kerschbaum, F. Fault-tolerant privacy-preserving statistics. In PETS (2012), Springer, pp. 221-238.

Digital Library

[80]

Jeske, T. Floating car data from smartphones: What Google and Waze know about you and how hackers can control traffic. BlackHat Europe (2013).

[81]

Joye, M., and Libert, B. A scalable scheme for privacy-preserving aggregation of time-series data. In Financial Cryptography (2013), pp. 111-125.

[82]

Karr, A. F., Lin, X., Sanil, A. P., and Reiter, J. P. Secure regression on distributed databases. Journal of Computational and Graphical Statistics 14, 2 (2005), 263-279.

[83]

Kedogan, D., Agrawal, D., and Penz, S. Limits of anonymity in open environments. In Information Hiding (2002), Springer, pp. 53-69.

Digital Library

[84]

Keller, J., Lai, K. R., and Perlroth, N. How many times has your personal information been exposed to hackers? http://www.nytimes.com/interactive/ 2015/07/29/technology/personaltech/what-parts-of-your-information-have-been-exposed-to-hackers-quiz.html, July 29, 2015.

[85]

Krawczyk, H. Secret sharing made short. In CRYPTO (1993), pp. 136-146.

Digital Library

[86]

Kursawe, K., Danezis, G., and Kohlweiss, M. Privacy-friendly aggregation for the smart-grid. In PETS (2011), pp. 175-191.

Digital Library

[87]

Kwon, A., Lazar, D., Devadas, S., and Ford, B. Ri_e. Proceedings on Privacy Enhancing Technologies 2016, 2 (2015), 115-134.

[88]

Le Blond, S., Choffnes, D., Zhou, W., Druschel, P., Ballani, H., and Francis, P. Towards efficient traffic-analysis resistant anonymity networks. In SIGCOMM (2013), ACM.

Digital Library

[89]

Lindell, Y. Fast cut-and-choose-based protocols for malicious and covert adversaries. Journal of Cryptology 29, 2 (2016), 456-490.

Digital Library

[90]

Lindell, Y., and Pinkas, B. A proof of security of Yao's protocol for two-party computation. Journal of Cryptology 22, 2 (2009), 161-188.

Digital Library

[91]

Malkhi, D., Nisan, N., Pinkas, B., Sella, Y., et al. Fairplay-secure two-party computation system. In USENIX Security (2004).

Digital Library

[92]

Melis, L., Danezis, G., and De Cristofaro, E. Efficient private statistics with succinct sketches. In NDSS (Feb. 2016), Internet Society.

[93]

Mohassel, P., Rosulek, M., and Zhang, Y. Fast and secure three-party computation: The Garbled Circuit approach. In CCS (2015), ACM, pp. 591- 602.

Digital Library

[94]

Murdoch, S. J., and Danezis, G. Low-cost traffic analysis of Tor. In Security and Privacy (2005), IEEE, pp. 183-195.

Digital Library

[95]

Neff, C. A. A verifiable secret shu_e and its application to e-voting. In CCS (2001), ACM, pp. 116-125.

Digital Library

[96]

Nikolaenko, V., Ioannidis, S., Weinsberg, U., Joye, M., Taft, N., and Boneh, D. Privacy-preserving matrix factorization. In CCS (2013), ACM, pp. 801-812.

Digital Library

[97]

Parno, B., Howell, J., Gentry, C., and Raykova, M. Pinocchio: Nearly practical verifiable computation. In Security and Privacy (2013), IEEE, pp. 238-252.

Digital Library

[98]

Pinkas, B., Schneider, T., Smart, N. P., and Williams, S. C. Secure two-party computation is practical. In CRYPTO (2009), Springer, pp. 250-267.

Digital Library

[99]

Popa, R. A., Balakrishnan, H., and Blumberg, A. J. VPriv: Protecting privacy in location-based vehicular services. In USENIX Security (2009), pp. 335-350.

Digital Library

[100]

Popa, R. A., Blumberg, A. J., Balakrishnan, H., and Li, F. H. Privacy and accountability for location-based aggregate statistics. In CCS (2011), ACM, pp. 653-666.

Digital Library

[101]

Reiter, M. K., and Rubin, A. D. Crowds: Anonymity for web transactions. TISSEC 1, 1 (1998), 66-92.

Digital Library

[102]

Rogaway, P., and Bellare, M. Robust computational secret sharing and a unified account of classical secret-sharing goals. In CCS (2007), ACM, pp. 172-184.

Digital Library

[103]

Schnorr, C.-P. Efficient signature generation by smart cards. Journal of Cryptology 4, 3 (1991), 161-174.

Digital Library

[104]

Schwartz, J. T. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 4 (1980), 701-717.

Digital Library

[105]

Serjantov, A., Dingledine, R., and Syverson, P. From a trickle to a flood: Active attacks on several mix types. In Information Hiding (2002), Springer, pp. 36-52.

Digital Library

[106]

Shamir, A. How to share a secret. Communications of the ACM 22, 11 (1979), 612-613.

Digital Library

[107]

Shi, E., Chan, T. H., Rieffel, E., Chow, R., and Song, D. Privacy-preserving aggregation of timeseries data. In NDSS (2011), vol. 2, Internet Society, pp. 1-17.

[108]

Shoup, V. OAEP reconsidered. In CRYPTO (2001), Springer, pp. 239-259.

Digital Library

[109]

Shoup, V. A proposal for an ISO standard for public key encryption (version 2.1). Cryptology ePrint Archive, Report 2001/112 (2001). http://eprint.iacr. org/2001/112.

[110]

Sirer, E. G., Goel, S., Robson, M., and Engin, D. Eluding carnivores: File sharing with strong anonymity. In ACM SIGOPS European Workshop (2004), ACM, p. 19.

Digital Library

[111]

Smart, N. FHE-MPC notes. https://www.cs.bris. ac.uk/~nigel/FHE-MPC/Lecture8.pdf, Nov. 2011. Scribed by Peter Scholl.

[112]

Smith, B. Uber executive suggests digging up dirt on journalists. https: //www.buzzfeed.com/bensmith/uber-executive-suggests-digging-up-dirt-on-journalists, Nov. 17, 2014. Accessed 20 September 2016.

[113]

U.S. Department of Health and Human Services. AIDSinfo. https://aidsinfo.nih.gov/apps.

[114]

Viswanath, B., Post, A., Gummadi, K. P., and Mislove, A. An analysis of social network-based Sybil defenses. SIGCOMM 40, 4 (2010), 363-374.

Digital Library

[115]

Wahby, R. S., Setty, S. T., Ren, Z., Blumberg, A. J., and Walfish, M. Efficient RAM and control flow in verifiable outsourced computation. In NDSS (2016).

[116]

Walfish, M., and Blumberg, A. J. Verifying computations without reexecuting them. Communications of the ACM 58, 2 (2015), 74-84.

Digital Library

[117]

Wang, G., Wang, B., Wang, T., Nika, A., Zheng, H., and Zhao, B. Y. Defending against Sybil devices in crowdsourced mapping services. In MobiSys (2016), ACM, pp. 179-191.

Digital Library

[118]

Warner, S. L. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association 60, 309 (1965), 63-69.

[119]

Williams, R. R. Strong ETH breaks with Merlin and Arthur: Short non-interactive proofs of batch evaluation. In 31st Conference on Computational Complexity (2016).

Digital Library

[120]

Wolberg, W. H., Street, W. N., and Mangasarian, O. L. Wisconsin prognostic breast cancer data set. https://archive.ics.uci.edu/ml/machine-learning-databases/breast-cancer-wisconsin/, Dec. 1995. Accessed 15 September 2016.

[121]

Wolinsky, D. I., Corrigan-Gibbs, H., Ford, B., and Johnson, A. Dissent in numbers: Making strong anonymity scale. In OSDI (2012), pp. 179-182.

Digital Library

[122]

Wolinsky, D. I., Syta, E., and Ford, B. Hang with your buddies to resist intersection attacks. In CCS (2013), ACM, pp. 1153-1166.

Digital Library

[123]

Yao, A. C.-C. How to generate and exchange secrets. In FOCS (1986), IEEE, pp. 162-167.

Digital Library

[124]

Yu, H., Gibbons, P. B., Kaminsky, M., and Xiao, F. SybilLimit: A near-optimal social network defense against Sybil attacks. In Security and Privacy (2008), IEEE, pp. 3-17.

Digital Library

[125]

Yu, H., Kaminsky, M., Gibbons, P. B., and Flaxman, A. SybilGuard: defending against Sybil attacks via social networks. In SIGCOMM (2006), vol. 36, ACM, pp. 267-278.

Digital Library

[126]

Zippel, R. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposiumon on Symbolic and Algebraic Computation (1979), Springer-Verlag, pp. 216-226.

Digital Library

Cited By

Dauterman EFeng ELuo EPopa RStoica ILu SHowell J(2020)DORYProceedings of the 14th USENIX Conference on Operating Systems Design and Implementation10.5555/3488766.3488828(1101-1119)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.5555/3488766.3488828
Burkhalter LHithnawi AViand AShafagh HRatnasamy SBhagwan RPorter G(2020)TimeCryptProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388302(835-850)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388302
Erlingsson ÚFeldman VMironov IRaghunathan ATalwar KThakurta AChan T(2019)Amplification by shufflingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310586(2468-2479)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310586
Show More Cited By

Recommendations

Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares
Security and Cryptography for Networks
Abstract
This paper introduces Prio+, a privacy-preserving system for the collection of aggregate statistics, with the same model and goals in mind as the original and highly influential Prio paper by Henry Corrigan-Gibbs and Dan Boneh (NSDI 2017). As in ...
Analysis of inverted PBI and comparison with other scalarizing functions in decomposition based MOEAs

MOEA/D is one of the promising evolutionary approaches for solving multi and many-objective optimization problems. MOEA/D decomposes a multi-objective optimization problem into a number of single objective optimization problems. Each single objective ...
Inverted PBI in MOEA/D and its impact on the search performance on multi and many-objective optimization
GECCO '14: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation

MOEA/D decomposes a multi-objective optimization problem into a number of single objective optimization problems. Each single objective optimization problem is defined by a scalarizing function using a weight vector. In MOEA/D, there are several ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

NSDI'17: Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation

March 2017

749 pages

ISBN:9781931971379

Program Chairs:
Aditya Akella
University of Wisconsin-Madison
,
Jon Howell
Google

Sponsors

VMware
NetApp
NSF
Microsoft: Microsoft
Facebook: Facebook

Publisher

USENIX Association

United States

Publication History

Published: 27 March 2017

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dauterman EFeng ELuo EPopa RStoica ILu SHowell J(2020)DORYProceedings of the 14th USENIX Conference on Operating Systems Design and Implementation10.5555/3488766.3488828(1101-1119)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.5555/3488766.3488828
Burkhalter LHithnawi AViand AShafagh HRatnasamy SBhagwan RPorter G(2020)TimeCryptProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388302(835-850)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388302
Erlingsson ÚFeldman VMironov IRaghunathan ATalwar KThakurta AChan T(2019)Amplification by shufflingProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310586(2468-2479)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310586
Gupta PLi YMehrotra SPanwar NSharma SAlmanee S(2019)ObscureProceedings of the VLDB Endowment10.14778/3329772.332977912:9(1030-1043)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.14778/3329772.3329779
Zhao PSun JZhang ANi SZhang G(2019)P3S2Proceedings of the ACM Turing Celebration Conference - China10.1145/3321408.3321595(1-5)Online publication date: 17-May-2019
https://dl.acm.org/doi/10.1145/3321408.3321595
Primault VLampos VCox IDe Cristofaro E(2019)Privacy-Preserving Crowd-Sourcing of Web Searches with Private Data DonorThe World Wide Web Conference10.1145/3308558.3313474(1487-1497)Online publication date: 13-May-2019
https://dl.acm.org/doi/10.1145/3308558.3313474
Grining KKlonowski MSyga P(2019)On practical privacy-preserving fault-tolerant data aggregationInternational Journal of Information Security10.1007/s10207-018-0413-518:3(285-304)Online publication date: 1-Jun-2019
https://dl.acm.org/doi/10.1007/s10207-018-0413-5
Narula NVasquez WVirza MSeshan SBanerjee S(2018)zkledgerProceedings of the 15th USENIX Conference on Networked Systems Design and Implementation10.5555/3307441.3307448(65-80)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.5555/3307441.3307448
Palkar SZaharia M(2017)DIY Hosting for Online PrivacyProceedings of the 16th ACM Workshop on Hot Topics in Networks10.1145/3152434.3152459(1-7)Online publication date: 30-Nov-2017
https://dl.acm.org/doi/10.1145/3152434.3152459
Bittau AErlingsson ÚManiatis PMironov IRaghunathan ALie DRudominer MKode UTinnes JSeefeld B(2017)ProchloProceedings of the 26th Symposium on Operating Systems Principles10.1145/3132747.3132769(441-459)Online publication date: 14-Oct-2017
https://dl.acm.org/doi/10.1145/3132747.3132769

View Options

View options

Media

Figures

Other

Tables

View Table of Contents