Secure function evaluation (SFE) on mobile devices, such as smartphones, allows for the creation of new privacy-preserving applications. Generating the circuits on smartphones which allow for executing customized functions, however, is infeasible for most problems due to memory constraints. In this thesis, we develop a new methodology for generating circuits that is memory-efficient. Using the standard SFDL language for describing secure functions as input, we design a new pseudo- assembly language (PAL) and a template-driven compiler, generating circuits which can be evaluated with the canonical Fairplay evaluation framework. We deploy this compiler and demonstrate larger circuits can now be generated on smartphones. We show our compiler's ability to interface with other execution systems and perform optimizations on that execution system. We show how runtime generation of circuits can be used in practice. Our results demonstrate the feasibility of generating garbled circuits on mobile devices.
This thesis includes previously published co-authored material.
| Identifer | oai:union.ndltd.org:uoregon.edu/oai:scholarsbank.uoregon.edu:1794/12505 |
| Date | January 2012 |
| Creators | Mood, Benjamin, Mood, Benjamin |
| Contributors | Butler, Kevin |
| Publisher | University of Oregon |
| Source Sets | University of Oregon |
| Language | en_US |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Rights | All Rights Reserved. |
Page generated in 0.0275 seconds