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: http://hdl.handle.net/10289/11002
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.
IEEE Computer Society
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.