pith. sign in

arxiv: 1906.09652 · v1 · pith:P5CSGFZFnew · submitted 2019-06-23 · 📡 eess.SY · cs.CR· cs.SY

Secure Multi-party Computation for Cloud-based Control

Andreea B. Alexandru , George J. Pappas This is my paper

Pith reviewed 2026-05-25 17:32 UTC · model grok-4.3

classification 📡 eess.SY cs.CRcs.SY
keywords secure multi-party computationhomomorphic encryptionmodel predictive controlcloud-based controlprivacy-preserving optimizationsecret sharing
0
0 comments X

The pith

Multi-party privacy can be enforced in the implementation of a Model Predictive Controller by solving its optimization problem on encrypted data.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper establishes that a controller can be outsourced to the cloud while computing stabilizing actions from encrypted measurements without revealing more than the inputs and outputs of the computation. It defines cryptographic multi-party privacy and shows how homomorphic encryption, which supports sums and products on ciphertexts, combines with secret sharing to meet that privacy standard. The approach directly addresses the fact that control data changes over time, unlike static data problems. A sympathetic reader would care because it opens the possibility of using remote computation for real-time control without exposing private system states.

Core claim

The computation of stabilizing control actions by solving an optimization problem on encrypted data can be performed while satisfying the cryptographic multi-party privacy notion, using homomorphic encryption combined with secret sharing to handle the dynamical nature of the measurements.

What carries the argument

Homomorphic encryption, which permits sums and products on encrypted data, combined with secret sharing to enforce multi-party privacy in the Model Predictive Controller optimization.

If this is right

  • Stabilizing control inputs can be generated from encrypted sensor data without exposing the underlying system states.
  • The same encryption-plus-sharing construction applies to any Model Predictive Controller whose optimization can be expressed with additions and multiplications.
  • Cloud servers can perform the full receding-horizon computation while each party learns only its own prescribed outputs.
  • The privacy guarantee holds for distributed plants where multiple sensors contribute encrypted measurements.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same machinery could be tested on linear systems first, then extended to nonlinear or hybrid controllers whose optimizations remain compatible with the encryption primitives.
  • If the encryption overhead proves acceptable for slow dynamics, the method could be applied to networked control of smart grids or building systems.
  • A natural next measurement would be the growth in ciphertext size and computation time as the prediction horizon lengthens.

Load-bearing premise

The dynamical challenges of control data can be handled by homomorphic encryption plus secret sharing without violating the multi-party privacy definition.

What would settle it

A concrete demonstration that the combined scheme reveals information beyond the inputs and outputs of the controller optimization on a time-varying system would falsify the claim.

Figures

Figures reproduced from arXiv: 1906.09652 by Andreea B. Alexandru, George J. Pappas.

Figure 3
Figure 3. Figure 3: Consider a cloud server that collects encrypted data from several clients. [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
read the original abstract

In this chapter, we will explore the cloud-outsourced privacy-preserving computation of a controller on encrypted measurements from a (possibly distributed) system, taking into account the challenges introduced by the dynamical nature of the data. The privacy notion used in this work is that of cryptographic multi-party privacy, i.e., the computation of a functionality should not reveal anything more than what can be inferred only from the inputs and outputs of the functionality. The main theoretical concept used towards this goal is Homomorphic Encryption, which allows the evaluation of sums and products on encrypted data, and, when combined with other cryptographic techniques, such as Secret Sharing, results in a powerful tool for solving a wide range of secure multi-party problems. We will rigorously define these concepts and discuss how multi-party privacy can be enforced in the implementation of a Model Predictive Controller, which encompasses computing stabilizing control actions by solving an optimization problem on encrypted data.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 0 minor

Summary. The manuscript is a tutorial-style chapter that surveys the use of homomorphic encryption combined with secret sharing to enforce cryptographic multi-party privacy in cloud-outsourced Model Predictive Control. It claims that the dynamical challenges of the data can be addressed while satisfying the privacy notion that the computation reveals nothing beyond what is inferable from the inputs and outputs alone, with the core application being the solution of the MPC optimization problem on encrypted measurements to compute stabilizing control actions for a (possibly distributed) system.

Significance. If the explanations and discussions hold, the work provides a clear, rigorous introduction to established cryptographic primitives and their application to privacy-preserving dynamical control, which may help bridge control theory and cryptography for cloud-based systems. It does not introduce new theorems, parameter-dependent results, or empirical validations, but its value lies in surveying how standard techniques can be composed for MPC without internal inconsistencies.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their review and the recommendation to accept the manuscript. The referee's summary correctly identifies the tutorial nature of the work and its focus on composing established cryptographic primitives for privacy-preserving MPC.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The manuscript is a tutorial-style survey that defines standard cryptographic primitives (homomorphic encryption, secret sharing) and discusses their application to encrypted MPC without introducing any novel derivations, fitted parameters, or self-referential theorems. All load-bearing steps rely on externally established properties of the cited primitives rather than reducing to the paper's own inputs or self-citations. No equations or claims equate a prediction to a fitted input by construction, and the central claim about handling dynamical data within the stated privacy notion is presented as an application rather than a self-derived result.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

The abstract introduces no free parameters, axioms, or invented entities beyond referencing standard cryptographic tools.

pith-pipeline@v0.9.0 · 5685 in / 846 out tokens · 44101 ms · 2026-05-25T17:32:56.217869+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

82 extracted references · 82 canonical work pages · 2 internal anchors

  1. [1]

    In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp

    Abadi,M.,Chu,A.,Goodfellow,I.,McMahan,H.B.,Mironov,I.,Talwar,K.,Zhang,L.:Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 308–318. ACM (2016)

    work page 2016

  2. [2]

    In: International Workshop on Information Hiding, pp

    Ács, G., Castelluccia, C.: I have a DREAM!(DiffeRentially privatE smArt Metering). In: International Workshop on Information Hiding, pp. 118–132. Springer (2011)

    work page 2011

  3. [3]

    arXiv preprint arXiv:1809.02267 (2018)

    Alexandru, A.B., Gatsis, K., Shoukry, Y., Seshia, S.A., Tabuada, P., Pappas, G.J.: Cloud- based quadratic optimization with partially homomorphic encryption. arXiv preprint arXiv:1809.02267 (2018)

    work page arXiv 2018

  4. [4]

    In: IEEE Conference on Decision and Control (CDC), pp

    Alexandru, A.B., Morari, M., Pappas, G.J.: Cloud-based MPC with encrypted data. In: IEEE Conference on Decision and Control (CDC), pp. 5014–5019 (2018)

    work page 2018

  5. [5]

    In: 10th ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS), pp

    Alexandru, A.B., Pappas, G.J.: Encrypted LQG using Labeled Homomorphic Encryption. In: 10th ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS), pp. 129–140 (2019)

    work page 2019

  6. [6]

    Information sciences305, 357–383 (2015)

    Ali, M., Khan, S.U., Vasilakos, A.V.: Security in cloud computing: Opportunities and chal- lenges. Information sciences305, 357–383 (2015)

    work page 2015

  7. [7]

    Archer, D., Chen, L., Cheon, J.H., Gilad-Bachrach, R., Hallman, R.A., Huang, Z., Jiang, X., Kumaresan, R., Malin, B.A., Sofia, H., Song, Y., Wang, S.: Applications of homomorphic encryption. Tech. rep., Microsoft Research (2017)

    work page 2017

  8. [8]

    A review of homomorphic encryption and software tools for encrypted statistical machine learning

    Aslett,L.J.,Esperança,P.M.,Holmes,C.C.:Areviewofhomomorphicencryptionandsoftware tools for encrypted statistical machine learning. arXiv preprint arXiv:1508.06574 (2015)

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  9. [9]

    In: European Sym- posium on Research in Computer Security, pp

    Barbosa, M., Catalano, D., Fiore, D.: Labeled homomorphic encryption. In: European Sym- posium on Research in Computer Security, pp. 146–166. Springer (2017)

    work page 2017

  10. [10]

    In: International Conference on Coding and Cryptology, pp

    Beimel, A.: Secret-sharing schemes: a survey. In: International Conference on Coding and Cryptology, pp. 11–46. Springer (2011)

    work page 2011

  11. [11]

    In: Conference on Computer and Communications Security, pp

    Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Conference on Computer and Communications Security, pp. 784–796. ACM (2012)

    work page 2012

  12. [12]

    Cryptologia 35(3),203–222(2011)

    Bellovin,S.M.:FrankMiller:Inventoroftheone-timepad. Cryptologia 35(3),203–222(2011)

    work page 2011

  13. [13]

    Cambridge University Press (2017)

    Borrelli, F., Bemporad, A., Morari, M.: Predictive control for linear and hybrid systems. Cambridge University Press (2017)

    work page 2017

  14. [14]

    In: Network & Distributed System Security Symposium (NDSS) (2015)

    Bost, R., Popa, R.A., Tu, S., Goldwasser, S.: Machine learning classification over encrypted data. In: Network & Distributed System Security Symposium (NDSS) (2015)

    work page 2015

  15. [15]

    Future generation computer systems56, 684–700 (2016)

    Botta,A.,DeDonato,W.,Persico,V.,Pescapé,A.:Integrationofcloudcomputingandinternet of things: a survey. Future generation computer systems56, 684–700 (2016)

    work page 2016

  16. [16]

    In: Annual Cryptology Conference, pp

    Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapsvp. In: Annual Cryptology Conference, pp. 868–886. Springer (2012)

    work page 2012

  17. [17]

    ACM Transactions on Computation Theory (TOCT)6(3), 13 (2014) Secure Multi-party Computation for Cloud-based Control 27

    Brakerski,Z.,Gentry,C.,Vaikuntanathan,V.:(leveled)fullyhomomorphicencryptionwithout bootstrapping. ACM Transactions on Computation Theory (TOCT)6(3), 13 (2014) Secure Multi-party Computation for Cloud-based Control 27

    work page 2014

  18. [18]

    In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp

    Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-lwe and secu- rity for key dependent messages. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 505–524. Springer (2011)

    work page 2011

  19. [19]

    Cryptology ePrint Archive, Report 2014/813 (2015)

    Catalano,D.,Fiore,D.:Boostinglinearly-homomorphicencryptiontoevaluatedegree-2func- tions on encrypted data. Cryptology ePrint Archive, Report 2014/813 (2015). https: //eprint.iacr.org/2014/813

    work page 2014

  20. [20]

    In: 22nd ACM SIGSAC Conference on Computer and Communications Security, pp

    Catalano,D.,Fiore,D.:Usinglinearly-homomorphicencryptiontoevaluatedegree-2functions on encrypted data. In: 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1518–1529. ACM (2015)

    work page 2015

  21. [21]

    Chase, M., Gilad-Bachrach, R., Laine, K., Lauter, K., Rindal, P.: Private collaborative neural network learning. Tech. rep., Cryptology ePrint Archive, Report 2017/762 (2017). URL https://eprint.iacr.org/2017/762

    work page 2017

  22. [22]

    BMC medical genomics 11(4), 81 (2018)

    Chen, H., Gilad-Bachrach, R., Han, K., Huang, Z., Jalali, A., Laine, K., Lauter, K.: Logistic regression over encrypted data from fully homomorphic encryption. BMC medical genomics 11(4), 81 (2018)

    work page 2018

  23. [23]

    In:InternationalConferenceontheTheoryandApplicationofCryptologyand Information Security, pp

    Cheon,J.H.,Kim,A.,Kim,M.,Song,Y.:Homomorphicencryptionforarithmeticofapproxi- matenumbers. In:InternationalConferenceontheTheoryandApplicationofCryptologyand Information Security, pp. 409–437. Springer (2017)

    work page 2017

  24. [24]

    Cryptology ePrint Archive, Report 2016/544 (2016)

    Couteau, G.: Efficient secure comparison protocols. Cryptology ePrint Archive, Report 2016/544 (2016). http://eprint.iacr.org/2016/544

    work page 2016

  25. [25]

    Book draft (2012)

    Cramer, R., Damgård, I., Nielsen, J.B.: Secure multiparty computation and secret sharing-an information theoretic approach. Book draft (2012)

    work page 2012

  26. [26]

    Cambridge Uni- versity Press (2015)

    Cramer, R., Damgård, I.B., Nielsen, J.B.: Secure Multiparty Computation. Cambridge Uni- versity Press (2015)

    work page 2015

  27. [27]

    In:AustralasianConferenceonInformationSecurityandPrivacy,pp.416–430.Springer(2007)

    Damgård,I.,Geisler,M.,Krøigaard,M.:Efficientandsecurecomparisonforon-lineauctions. In:AustralasianConferenceonInformationSecurityandPrivacy,pp.416–430.Springer(2007)

    work page 2007

  28. [28]

    Efficient and secure comparison for on-line auctions

    Damgård, I., Geisler, M., Krøigaard, M.: A correction to “Efficient and secure comparison for on-line auctions”. International Journal of Applied Cryptography1(4), 323–324 (2009)

    work page 2009

  29. [29]

    In: Annual Cryptology Conference, pp

    Damgård, I., Orlandi, C.: Multiparty computation for dishonest majority: From passive to active security at low cost. In: Annual Cryptology Conference, pp. 558–576. Springer (2010)

    work page 2010

  30. [30]

    In: International Workshop on Public Key Cryptography, pp

    Damgård,I.B.,Jurik,M.:Ageneralisation,asimplificationandsomeapplicationsofPaillier’s probabilistic public-key system. In: International Workshop on Public Key Cryptography, pp. 119–136. Springer (2001)

    work page 2001

  31. [31]

    In:Proceed- ings of the 2012 Joint EDBT/ICDT Workshops, pp

    Dankar,F.K.,ElEmam,K.:Theapplicationofdifferentialprivacytohealthdata. In:Proceed- ings of the 2012 Joint EDBT/ICDT Workshops, pp. 158–166. ACM (2012)

    work page 2012

  32. [32]

    In: International Conference on Theory and Applications of Models of Computation, pp

    Dwork, C.: Differential privacy: A survey of results. In: International Conference on Theory and Applications of Models of Computation, pp. 1–19. Springer (2008)

    work page 2008

  33. [33]

    In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp

    Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: Privacy via distributed noise generation. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 486–503. Springer (2006)

    work page 2006

  34. [34]

    In: Annual International Cryptology Conference, pp

    Dwork,C.,Nissim,K.:Privacy-preservingdataminingonverticallypartitioneddatabases. In: Annual International Cryptology Conference, pp. 528–544. Springer (2004)

    work page 2004

  35. [35]

    Foundations and Trends® in Theoretical Computer Science9(3–4), 211–407 (2014)

    Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science9(3–4), 211–407 (2014)

    work page 2014

  36. [36]

    IACRCryptology ePrint Archive2012, 144 (2012)

    Fan,J.,Vercauteren,F.:Somewhatpracticalfullyhomomorphicencryption. IACRCryptology ePrint Archive2012, 144 (2012)

    work page 2012

  37. [37]

    Control Engineering Practice67, 13–20 (2017)

    Farokhi, F., Shames, I., Batterham, N.: Secure and private control using semi-homomorphic encryption. Control Engineering Practice67, 13–20 (2017)

    work page 2017

  38. [38]

    Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Department of Computer Science, Stanford University (2009).crypto.stanford.edu/craig

    work page 2009

  39. [39]

    Gentry, C., Boneh, D.: A fully homomorphic encryption scheme, vol. 20, no. 09. Stanford University Stanford (2009)

    work page 2009

  40. [40]

    In: Annual Cryptology Con- ference, pp

    Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Annual Cryptology Con- ference, pp. 75–92. Springer (2013) 28 Andreea B. Alexandru and George J. Pappas

    work page 2013

  41. [41]

    Cambridge University Press (2003)

    Goldreich, O.: Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press (2003)

    work page 2003

  42. [42]

    Cambridge University Press (2004)

    Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press (2004)

    work page 2004

  43. [43]

    In:19thannualACM symposium on Theory of computing, pp

    Goldreich,O.,Micali,S.,Wigderson,A.:Howtoplayanymentalgame. In:19thannualACM symposium on Theory of computing, pp. 218–229. ACM (1987)

    work page 1987

  44. [44]

    In: 14th annual ACM symposium on Theory of Computing, pp

    Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: 14th annual ACM symposium on Theory of Computing, pp. 365–377. ACM (1982)

    work page 1982

  45. [45]

    In:IEEEInternationalWorkshop on Information Forensics and Security (WIFS), pp

    Gonzalez-Serrano,F.J.,Amor-Martın,A.,Casamayon-Anton,J.:Stateestimationusinganex- tendedKalmanfilterwithprivacy-protectedobservedinputs. In:IEEEInternationalWorkshop on Information Forensics and Security (WIFS), pp. 54–59. IEEE (2014)

    work page 2014

  46. [46]

    Goyal, V., Khurana, D., Mironov, I., Pandey, O., Sahai, A.: Do distributed differentially- private protocols require oblivious transfer? In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 55. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)

    work page 2016

  47. [47]

    Hamlin, A., Schear, N., Shen, E., Varia, M., Yakoubov, S., Yerukhimovich, A.: Cryptography for big data security. In: F. Hu (ed.) Big Data: Storage, Sharing, and Security, chap. 10, pp. 241–288. Taylor & Francis LLC, CRC Press (2016)

    work page 2016

  48. [48]

    In: Annual International Cryptology Conference, pp

    Ishai,Y.,Prabhakaran,M.,Sahai,A.:Foundingcryptographyonoblivioustransfer–efficiently. In: Annual International Cryptology Conference, pp. 572–591. Springer (2008)

    work page 2008

  49. [49]

    In: Proc

    Jeckmans,A.,Peter,A.,Hartel,P.:Efficientprivacy-enhancedfamiliarity-basedrecommender system. In: Proc. European Symposium on Research in Computer Security, pp. 400–417. Springer (2013)

    work page 2013

  50. [50]

    In: Interna- tional Conference on the Theory and Applications of Cryptographic Techniques, pp

    Joye, M., Libert, B.: Efficient cryptosystems from2k-th power residue symbols. In: Interna- tional Conference on the Theory and Applications of Cryptographic Techniques, pp. 76–92. Springer (2013)

    work page 2013

  51. [51]

    IFAC-PapersOnLine 49(22), 175–180 (2016)

    Kim,J.,Lee,C.,Shim,H.,Cheon,J.H.,Kim,A.,Kim,M.,Song,Y.:Encryptingcontrollerusing fully homomorphic encryption for security of cyber-physical systems. IFAC-PapersOnLine 49(22), 175–180 (2016)

    work page 2016

  52. [52]

    In: Tutorials on the Foundations of Cryptography, pp

    Lindell, Y.: How to simulate it–a tutorial on the simulation proof technique. In: Tutorials on the Foundations of Cryptography, pp. 277–346. Springer International Publishing (2017)

    work page 2017

  53. [53]

    ACM Computing Surveys (CSUR)50(6), 83 (2018)

    Martins,P.,Sousa,L.,Mariano,A.:Asurveyonfullyhomomorphicencryption:Anengineer- ing perspective. ACM Computing Surveys (CSUR)50(6), 83 (2018)

    work page 2018

  54. [54]

    Automatica36(6), 789–814 (2000)

    Mayne,D.Q.,Rawlings,J.B.,Rao,C.V.,Scokaert,P.O.:Constrainedmodelpredictivecontrol: Stability and optimality. Automatica36(6), 789–814 (2000)

    work page 2000

  55. [55]

    Mell, P., Grance, T., et al.: The nist definition of cloud computing (2011)

    work page 2011

  56. [56]

    In: IEEE International Symposium on Hardware Oriented Security and Trust (HOST), pp

    Mirhoseini, A., Sadeghi, A.R., Koushanfar, F.: Cryptoml: Secure outsourcing of big data machine learning applications. In: IEEE International Symposium on Hardware Oriented Security and Trust (HOST), pp. 149–154. IEEE (2016)

    work page 2016

  57. [57]

    http://eprint.iacr.org/2017/ 396

    Mohassel, P., Zhang, Y.: SecureML: A system for scalable privacy-preserving machine learn- ing.CryptologyePrintArchive,Report2017/396(2017). http://eprint.iacr.org/2017/ 396

    work page 2017

  58. [58]

    Secure and Private Implementation of Dynamic Controllers Using Semi-Homomorphic Encryption

    Murguia,C.,Farokhi,F.,Shames,I.:Secureandprivateimplementationofdynamiccontrollers using semi-homomorphic encryption. arXiv preprint arXiv:1812.04168 (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  59. [59]

    Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: 3rd ACM workshop on Cloud computing security workshop, pp. 113–124. ACM (2011)

    work page 2011

  60. [60]

    In: 12th annual ACM-SIAM Symposium on Discrete Algorithms, pp

    Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: 12th annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448–457. SIAM (2001)

    work page 2001

  61. [61]

    Nesterov, Y.: Introductory lectures on convex optimization: A basic course, vol. 87. Springer Science & Business Media (2013)

    work page 2013

  62. [62]

    In:AdvancesinCryptology–CRYPTO,pp.681–700.Springer(2012)

    Nielsen,J.B.,Nordholt,P.S.,Orlandi,C.,Burra,S.S.:Anewapproachtopracticalactive-secure two-partycomputation. In:AdvancesinCryptology–CRYPTO,pp.681–700.Springer(2012)

    work page 2012

  63. [63]

    Paillier,P.:Public-keycryptosystemsbasedoncompositedegreeresiduosityclasses.In:Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223–238. Springer (1999) Secure Multi-party Computation for Cloud-based Control 29

    work page 1999

  64. [64]

    In: Annual International Cryptology Conference, pp

    Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Annual International Cryptology Conference, pp. 129–140. Springer (1991)

    work page 1991

  65. [65]

    In: 31st Annual Computer Security Applications Conference, pp

    Pettai, M., Laud, P.: Combining differential privacy and secure multiparty computation. In: 31st Annual Computer Security Applications Conference, pp. 421–430. ACM (2015)

    work page 2015

  66. [66]

    Cryptology ePrint Archive, Report 2005/187 (2005).https://eprint.iacr.org/2005/187

    Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005/187 (2005).https://eprint.iacr.org/2005/187

    work page 2005

  67. [67]

    In: ACM SIGMOD International Conference on Management of data, pp

    Rastogi, V., Nath, S.: Differentially private aggregation of distributed time-series with trans- formation and encryption. In: ACM SIGMOD International Conference on Management of data, pp. 735–746. ACM (2010)

    work page 2010

  68. [68]

    IEEESecurityand Privacy Magazine (2018)

    Riazi,M.S.,Rouhani,B.D.,Koushanfar,F.:Deeplearningonprivatedata. IEEESecurityand Privacy Magazine (2018)

    work page 2018

  69. [69]

    CRC press (2016)

    Rittinghouse, J.W., Ransome, J.F.: Cloud computing: implementation, management, and se- curity. CRC press (2016)

    work page 2016

  70. [70]

    Foundations of secure computation4(11), 169–180 (1978)

    Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of secure computation4(11), 169–180 (1978)

    work page 1978

  71. [71]

    In: Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference, pp

    Sala, A., Zhao, X., Wilson, C., Zheng, H., Zhao, B.Y.: Sharing graphs using differentially private graph models. In: Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference, pp. 81–98. ACM (2011)

    work page 2011

  72. [72]

    IEEE Control Systems Letters2(2), 195–200 (2018)

    Schulze Darup, M., Redder, A., Shames, I., Farokhi, F., Quevedo, D.: Towards encrypted mpc for linear constrained systems. IEEE Control Systems Letters2(2), 195–200 (2018)

    work page 2018

  73. [73]

    Communications of the ACM22(11), 612–613 (1979)

    Shamir, A.: How to share a secret. Communications of the ACM22(11), 612–613 (1979)

    work page 1979

  74. [74]

    In: Network & Distributed System Security Symposium (NDSS) (2011)

    Shi, E., Chan, H.T.H., Rieffel, E., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: Network & Distributed System Security Symposium (NDSS) (2011)

    work page 2011

  75. [75]

    Journal of Network and Computer Applications75, 200–222 (2016)

    Singh, S., Jeong, Y.S., Park, J.H.: A survey on cloud computing security: Issues, threats, and solutions. Journal of Network and Computer Applications75, 200–222 (2016)

    work page 2016

  76. [76]

    In: Tutorials on the Foundations of Cryp- tography, pp

    Vadhan, S.: The complexity of differential privacy. In: Tutorials on the Foundations of Cryp- tography, pp. 347–450. Springer (2017)

    work page 2017

  77. [77]

    Differential Privacy Meets Multi-Party Computa- tion (DPMPC) Workshop https://www.bu.edu/hic/dpmpc-2018/ (2018)

    Vadhan, S.: Multiparty differential privacy. Differential Privacy Meets Multi-Party Computa- tion (DPMPC) Workshop https://www.bu.edu/hic/dpmpc-2018/ (2018)

    work page 2018

  78. [78]

    Journal of the AIEE45(2), 109–115 (1926)

    Vernam, G.S.: Cipher printing telegraph systems: For secret wire and radio telegraphic com- munications. Journal of the AIEE45(2), 109–115 (1926)

    work page 1926

  79. [79]

    In: International Workshop on Information Forensics and Security, pp

    Veugen, T.: Encrypted integer division. In: International Workshop on Information Forensics and Security, pp. 1–6. IEEE (2010)

    work page 2010

  80. [80]

    In: International Workshop on Infor- mation Forensics and Security, pp

    Veugen, T.: Improving the DGK comparison protocol. In: International Workshop on Infor- mation Forensics and Security, pp. 49–54. IEEE (2012)

    work page 2012

Showing first 80 references.