MAGE: Nearly Zero-Cost Virtual Memory for Secure Computation

06/23/2021
by   Sam Kumar, et al.
0

Secure Computation (SC) is a family of cryptographic primitives for computing on encrypted data in single-party and multi-party settings. SC is being increasingly adopted by industry for a variety of applications. A significant obstacle to using SC for practical applications is the memory overhead of the underlying cryptography. We develop MAGE, an execution engine for SC that efficiently runs SC computations that do not fit in memory. We observe that, due to their intended security guarantees, SC schemes are inherently oblivious – their memory access patterns are independent of the input data. Using this property, MAGE calculates the memory access pattern ahead of time and uses it to produce a memory management plan. This formulation of memory management, which we call memory programming, is a generalization of paging that allows MAGE to provide a highly efficient virtual memory abstraction for SC. MAGE outperforms the OS virtual memory system by up to an order of magnitude, and in many cases, runs SC computations that do not fit in memory at nearly the same speed as if the underlying machines had unbounded physical memory to fit the entire computation.

READ FULL TEXT

page 5

page 7

page 12

page 13

page 15

page 16

page 17

page 18

research
09/22/2018

In-memory multiplication engine with SOT-MRAM based stochastic computing

Processing-in-memory (PIM) turns out to be a promising solution to break...
research
11/21/2019

LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS

The Load-Link/Store-Conditional (LL/SC) primitive is considered the most...
research
07/12/2023

B-CLEAN-SC: CLEAN-SC for broadband sources

This paper presents B-CLEAN-SC, a variation of CLEAN-SC for broadband so...
research
09/25/2019

VirtSC: Combining Virtualization Obfuscation with Self-Checksumming

Self-checksumming (SC) is a tamper-proofing technique that ensures certa...
research
04/14/2018

Reasoning About TSO Programs Using Reduction and Abstraction

We present a method for proving that a program running under the Total S...
research
05/19/2019

Toward Scalable Fully Homomorphic Encryption Through Light Trusted Computing Assistance

It has been a long standing problem to securely outsource computation ta...
research
03/04/2022

Homomorphically Encrypted Computation using Stochastic Encodings

Homomorphic encryption (HE) is a privacy-preserving technique that enabl...

Please sign up or login with your details

Forgot password? Click here to reset