A Practical, Secure, and Verifiable Cloud Computing for Mobile Systems
Sriram N. Premnath, Zygmunt J. Haas

TL;DR
This paper introduces a secure, verifiable cloud computing framework tailored for mobile devices, enabling privacy-preserving computations with multiple servers and efficient verification mechanisms.
Contribution
It adapts garbled circuit and secure multiparty computation techniques for mobile cloud environments, incorporating a novel pseudo-random generator for efficiency and verification.
Findings
System effectively preserves privacy even with colluding servers.
Demonstrates practical feasibility with real-world data.
Achieves efficient computation and verification for mobile cloud tasks.
Abstract
Cloud computing systems, in which clients rent and share computing resources of third party platforms, have gained widespread use in recent years. Furthermore, cloud computing for mobile systems (i.e., systems in which the clients are mobile devices) have too been receiving considerable attention in technical literature. We propose a new method of delegating computations of resource-constrained mobile clients, in which multiple servers interact to construct an encrypted program known as garbled circuit. Next, using garbled inputs from a mobile client, another server executes this garbled circuit and returns the resulting garbled outputs. Our system assures privacy of the mobile client's data, even if the executing server chooses to collude with all but one of the other servers. We adapt the garbled circuit design of Beaver et al. and the secure multiparty computation protocol of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Cloud Data Security Solutions
