Tech Talk: Building Systems that Effectively and Cryptographically Protect User Privacy

George Nychis

About Our Guest Speaker

Soroco invited Sam Kumar, a current 5th year Ph.D. student from U.C. Berkeley and prior U.C. Berkeley B.S. CS graduate, to give a talk on his and his colleague’s novel computer security and privacy research. The work that Sam presented at Soroco, which you can watch below, was published in the top Computer Science system design conferences NSDI 2020 and OSDI 2021. The latter of which was awarded best paper of that year’s OSDI conference. These two pieces of work that Sam gave his talk on were centered around how to build systems that effectively and cryptographically protect user privacy.

Why this talk at Soroco

Building systems that effectively and cryptographically protect user privacy is highly relevant to the work we do at Soroco. At Soroco, we are building the work graph to understand how digital work happens at the last mile.

A work graph is a connected sequence of steps that teams execute to get work done. It is, in essence, a map of how teams execute digital work, and it lies at the intersection of people, work, and technology. Once discovered, the work graph enables teams to collaborate and work more effectively.

Since the work graph is a sequence of steps that teams execute and sourced from the activities that the teams perform, a major role of the work graph’s design and information access is to ensure end-user privacy is protected. How we protect end-user privacy is and will always be a focus of our team.

Watch the Talk

Powerful ideas from Ghostor and MAGE

Layers of Anonymity: The author’s work around Ghostor first illustrates multiple layers of protection required to provide stronger guarantees of user privacy. While many readers of this blog post may think one of the strongest aspects to providing user privacy is simply encrypting that user’s information, there are far more layers of security required to ensure user information is kept private.

As shown above, protecting user privacy goes far beyond simply encrypting their information (i.e., the 4th layer down – hiding the data in each object). It is important to protect what users are part of the system (i.e., who has an account, who is participating), hiding timing of object accesses, and even hiding which user makes each access. For example, although the contents or even who an object in the system belongs to can be hidden, timings of access to that file or correlating those times with other information can eventually help an adversary conclude who it belongs to even if not knowing what is in it. It is first this end-to-end thinking about protecting user privacy that we found extremely valuable in system design.

Verifiable Linearizability: Second, the author’s present the importance of not just protecting the contents of information and that it is valid (e.g., via a signature), but also being able to provide guarantees that it is the most up-to-date version of the information. This is because encrypting information and signing it does not necessarily guarantee that an adversary could not simply present back an older representation of that information which could no longer be valid or missing a sensitive update to it. The author’s work in Ghostor provides a simple example of a patient system in the medical field, where an adversary could return a valid older copy of data before an individual had more recent updates to their medical records that are important to protecting their health (e.g., notes of recent allergies).

Ghostor is the author’s proposed system design that can provide the multiple layers of anonymity with variable linearizability. This incorporates a blockchain that could provide decentralized trust. That would hide user identity from even the servers that process the information, which we find is a powerful concept. The decentralized verifiability of the blockchain can also provide the verifiable linearizability of the data. Both the user and the server can validate that the information being processed is the most recent. Since there are concerns of overhead in updating the blockchain, it is proposed that a single hash that represents the entire system is updated every epoch. That provides verifiability of the entire system and its information.

Additionally, there are several properties of the system design that are important to protecting the user anonymity along with the verifiability and anonymous properties of the blockchain. For example, ensuring there are no server-visible ACLs and no server-visible user public keys as being important. There are several others that the authors present that we encourage the reader to get more details from their paper.

MAGE further builds on the principals of security and privacy by focusing on proposed improvements to Secure Computation. Secure Computation being privacy preserving technology that protects the identity of parties involved and the information being input to the cryptographic function. The only information being disclosed being the output of the function. This can allow different parties to participate in an agreed upon computation, without ever knowing the input to that function. An example being, two websites being able to use Secure Computation to collaborate and know whether a user has used the same password on their sites (which can weaken security) without knowing the actual password or the user in question.

Where MAGE’s work focuses is on the system challenges in providing Secure Computation when there is substantial overhead from the underlying cryptography. The key focuses in MAGE being providing a paging system that allows MAGE to provide highly efficient virtual memory abstractions for Secure Computation. This enables Secure Computations that potentially do not fit in memory at nearly the same speed. Doing so required the authors to carefully plan the memory access to reduce paging, in what they called memory programming. That concept being quite unique and what we believe is powerful to furthering the field of Secure Computation. Making it more scalable for functions with large memory requirements.

Additional Thoughts and Conclusions

Both Ghostor and MAGE are unique pieces of work that we believe can help further security and privacy in technology globally. As future work, we imagine a few areas to be strengthened. For example, Ghostor’s exact implementation protects user identity over the network via an implementation on top of Tor. While this can be a valid implementation, it does come with additional high latency and overhead of that network associated with it. Overall, Ghostor’s overall system design is one in which latency is traded off for additional privacy, so we wonder what improvements can be made to further extend Ghostor’s work to improve latency. The author’s of MAGE also introduce future work in their paper around how to other oblivious memory workloads (i.e., workloads whose memory access patterns are independent of the input).

We encourage our readers to watch Sam’s talk and read the author’s articles of work that was published in the conferences.

Ghostor: Toward a Secure Data-Sharing System from Decentralized Trust. NSDI 2020.

MAGE: Nearly Zero-Cost Virtual Memory for Secure Computation.

Like this article? Spread the word 

Share on facebook
Share on twitter
Share on linkedin
Share on reddit
Share on mix
Share on email

Content Explorer

Leave a Reply

Your email address will not be published. Required fields are marked *