From Keys to Databases - Real-World Applications of Secure Multi-Party Computation

@article{Archer2018FromKT,
  title={From Keys to Databases - Real-World Applications of Secure Multi-Party Computation},
  author={David W. Archer and Dan Bogdanov and Yehuda Lindell and Liina Kamm and Kurt Nielsen and Jakob Illeborg Pagter and Nigel P. Smart and Rebecca N. Wright},
  journal={Comput. J.},
  year={2018},
  volume={61},
  pages={1749-1771}
}
We discuss the widely increasing range of applications of a cryptographic technique called Multi-Party Computation. For many decades this was perceived to be of purely theoretical interest, but now it has started to find application in a number of use cases. We highlight in this paper a number of these, ranging from securing small high value items such as cryptographic keys, through to securing an entire database. 

Figures from this paper

Recent Advances in Information-Theoretically Secure Data Outsourcing
TLDR
This tutorial provides a review of recent secret-sharing-based techniques based on the security they offer and discusses database systems developed using such techniques and, particularly, discusses a recentsecret-sharing based system, namely Obscure.
Advances in Cryptography and Secure Hardware for Data Outsourcing
TLDR
This tutorial focuses on recent advances in secure cloud-based data outsourcing based on cryptographic (encryption, secret-sharing, and multi-party computation (MPC) and hardware-based approaches, and concludes that no single approach is likely to emerge as a silver bullet.
Performance Impact Analysis of Rounds and Amounts of Communication in Secure Multiparty Computation Based on Secret Sharing
TLDR
Two sets of MPC subprotocols are benchmarked and compared considering the number of rounds and the communication cost, in order to assess which one of these parameters has a bigger impact on performance.
Scaling Cryptographic Techniques by Exploiting Data Sensitivity at a Public Cloud
TLDR
This poster outlines a new secure keyword search approach, called query keyword binning (QB), that allows non-sensitive parts of the data to be outsourced in clear-text while guaranteeing that no information is leaked by joint processing of non- sensitive data and sensitive data (in encrypted form).
Cryptographic Techniques for Data Processing
  • Shantanu Sharma, S. Mehrotra
  • Computer Science, Mathematics
    5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD)
  • 2022
TLDR
This tutorial compares encryption and secret-sharing-based approaches that have been developed over the last two decades with an orthogonal approach designed around the concept of data partitioning, i.e., splitting the data processing into cryptographically secure and non-secure parts.
Panda: Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data
TLDR
This paper continues along with the emerging trend in secure data processing over outsourced data, where secure and efficient query processing over Outsourced data remains an open challenge.
Multiparty Computation in Practice: Increasing Security of Documents in Enterprise Content Management Systems
TLDR
The presented architecture can be used as a solid starting point for building secure enterprise systems that generate negligible costs in relation to their counterparts based on hardware-based cryptographic modules.
PANDA
TLDR
This article proposes a new secure approach, entitled query binning (QB), that allows secure execution of queries over non-sensitive and sensitive parts of the data and actually strengthens the security of the underlying cryptographic technique by preventing size, frequency-count, and workload-skew attacks.
Binary Search in Secure Computation
TLDR
A suite of protocols with different properties and of different structure for searching a private dataset of m elements by a private numeric key using only standard and readily available operations based on secret sharing is developed.
Panda: Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data
TLDR
A new secure approach, entitled query binning (QB) that allows secure execution of queries over non-sensitive and sensitive parts of the data and actually strengthens the security of the underlying cryptographic technique by preventing size, frequency-count, and workload-skew attacks.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Secure Two-Party Computation is Practical
TLDR
An implementation of the two-party case, using Yao's garbled circuits, is described, and various algorithmic protocol improvements are presented, which are analysed both theoretically and empirically.
Fast Distributed RSA Key Generation for Semi-Honest and Malicious Adversaries
TLDR
Two new, highly efficient, protocols for securely generating a distributed RSA key pair in the two-party setting are presented and improve significantly over the state-of-the-art by allowing a slight leakage.
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
We explore cryptographic primitives with low multiplicative complexity. This is motivated by recent progress in practical applications of secure multi-party computation (MPC), fully homomorphic
High-performance secure multi-party computation for data mining applications
TLDR
New protocols in the Sharemind model for secure multiplication, share conversion, equality, bit shift, bit extraction, and division are described and benchmarked, showing that the current approach provides remarkable speed improvements over the previous work.
Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper)
TLDR
This is the first time where the actual MPC computation on real data was done over the internet with computing nodes spread geographically apart, revealing that MPC techniques give sufficient assurance for data donors to submit their sensitive information.
Secure Multiparty Computation Goes Live
TLDR
The first large-scale and practical application of secure multiparty computation, which took place in January 2008, is reported on and the novel cryptographic protocols used are reported on.
The Low-Call Diet: Authenticated Encryption for Call Counting HSM Users
We present a new mode of operation for obtaining authenticated encryption suited for use in environments, e.g. banking and government, where cryptographic services are only available via a Hardware
From Input Private to Universally Composable Secure Multi-party Computation Primitives
TLDR
The standard notions of universally compos able security are overly restrictive in this context and can lead to protocols with sub-optimal performance, so a weaker notion of privacy is introduced that is satisfied by simpler protocols and is preserved by composition.
Fast and Secure Three-party Computation: The Garbled Circuit Approach
TLDR
This work proposes a new approach for secure three-party computation (3PC) that improves security while maintaining practical efficiency that is competitive with traditional information-theoretic protocols.
A Secure Multi-Party Computation Protocol Suite Inspired by Shamir's Secret Sharing Scheme
TLDR
This thesis designed and implemented a protocol suite, that was inspired by Shamir's secret sharing scheme, and implemented protocols for addition, multiplication, boolean arithmetic and comparison operations, that can be used to write secure applications in the SecreC language.
...
1
2
3
4
5
...