• DocumentCode
    1802585
  • Title

    Adapting Privacy-Preserving Computation to the Service Provider Model

  • Author

    Kerschbaum, Florian

  • Author_Institution
    SAP Res., Karlsruhe, Germany
  • Volume
    3
  • fYear
    2009
  • fDate
    29-31 Aug. 2009
  • Firstpage
    34
  • Lastpage
    41
  • Abstract
    There are many applications for secure multi-party computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not match the system architecture of regular secure computation. An important business model is that of a single service provider dealing with many customers. Applications with this business model are e.g. auctions or benchmarking. This paper provides SMC in a system architecture for service providers. Furthermore we achieve an interesting performance improvement. Our SMC protocol has a significantly improved complexity if all parties behave semi-honest, but can still deal with a minority of malicious parties at the usual complexity.The solution also relates to distributed algorithmic mechanism design which proposes to build distributed algorithms that implement mechanisms that compute the result given rational players.
  • Keywords
    communication complexity; cryptographic protocols; data privacy; distributed algorithms; auctions; benchmarking; business model; cryptographic protocols; distributed algorithmic mechanism design; privacy-preserving computation; secure multiparty computation; service provider model; Algorithm design and analysis; Circuits; Complexity theory; Computer architecture; Cryptographic protocols; Distributed algorithms; Distributed computing; Network servers; Service oriented architecture; Sliding mode control; Distributed Algorithmic Mechanism Design; Rational Security; Secure Multi-Party Computation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Engineering, 2009. CSE '09. International Conference on
  • Conference_Location
    Vancouver, BC
  • Print_ISBN
    978-1-4244-5334-4
  • Electronic_ISBN
    978-0-7695-3823-5
  • Type

    conf

  • DOI
    10.1109/CSE.2009.261
  • Filename
    5283230