Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Privacy preserving computation by fragmenting individual bits and distributing gates

      Will, Mark Antony; Ko, Ryan K.L.; Witten, Ian H.
      Thumbnail
      Files
      processingdatasecurely.pdf
      Accepted version, 547.9Kb
      DOI
       10.1109/TrustCom.2016.0154
      Find in your library  
      Citation
      Export citation
      Will, M. A., Ko, R. K. L., & Witten, I. H. (2016). Privacy preserving computation by fragmenting individual bits and distributing gates. In Proceedings of 15th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (pp. 900–908). Washington, DC, USA: IEEE Computer Society. https://doi.org/10.1109/TrustCom.2016.0154
      Permanent Research Commons link: https://hdl.handle.net/10289/11002
      Abstract
      Solutions that allow the computation of arbitrary operations over data securely in the cloud are currently impractical. The holy grail of cryptography, fully homomorphic encryption, still requires minutes to compute a single operation. In order to provide a practical solution, this paper proposes taking a different approach to the problem of securely processing data. FRagmenting Individual Bits (FRIBs), a scheme which preserves user privacy by distributing bit fragments across many locations, is presented. Privacy is maintained by each server only receiving a small portion of the actual data, and solving for the rest results in a vast number of possibilities. Functions are defined with NAND logic gates, and are computed quickly as the performance overhead is shifted from computation to network latency. This paper details our proof of concept addition algorithm which took 346ms to add two 32-bit values-paving the way towards further improvements to get computations completed under 100ms.
      Date
      2016
      Type
      Conference Contribution
      Publisher
      IEEE Computer Society
      Rights
      This is an author’s accepted version of an article published in the Proceedings of 15th IEEE International Conference on Trust, Security and Privacy in Computing and Communications. ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      89
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement