A5010795922- Cryptography and Data Security
- Complexity and Algorithms in Graphs
- Cryptographic Implementations and Security
- Privacy-Preserving Technologies in Data
- Cryptography and Residue Arithmetic
- Advanced Data Storage Technologies
- Blockchain Technology Applications and Security
- Adversarial Robustness in Machine Learning
- Coding theory and cryptography
- Security and Verification in Computing
- Chaos-based Image/Signal Encryption
- Geometric and Algebraic Topology
- Internet Traffic Analysis and Secure E-voting
- Big Data Technologies and Applications
- Natural Language Processing Techniques
- Quantum Computing Algorithms and Architecture
- Topic Modeling
- Information and Cyber Security
- Parallel Computing and Optimization Techniques
- Access Control and Trust
- Software Engineering Research
- Gene expression and cancer classification
- Spam and Phishing Detection
- graph theory and CDMA systems
- Cancer Genomics and Diagnostics
Data61
2018-2024
Commonwealth Scientific and Industrial Research Organisation
2019-2024
Aarhus University
2009-2020
University of Bristol
2012-2019
Multi-Protocol SPDZ (MP-SPDZ) is a fork of SPDZ-2 (Keller et al., CCS '13), an implementation the multi-party computation (MPC) protocol called (Damgård Crypto '12). MP-SPDZ extends to 30 MPC variants, all which can be used with same high-level programming interface based on Python. This considerably simplifies comparing cost different protocols and security models. The cover commonly models (honest/dishonest majority semi-honest/malicious corruption) as well binary arithmetic circuits (the...
We consider the task of secure multi-party computation arithmetic circuits over a finite field. Unlike Boolean circuits, allow natural computations on integers to be expressed easily and efficiently. In strongest setting malicious security with dishonest majority --- where any number parties may deviate arbitrarily from protocol most existing protocols require expensive public-key cryptography for each multiplication in preprocessing stage protocol, which leads high total cost. present new...
Abstract In many cases of machine learning, research suggests that the development training data might have a higher relevance than choice and modelling classifiers themselves. Thus, augmentation methods been developed to improve by artificially created data. NLP, there is challenge establishing universal rules for text transformations which provide new linguistic patterns. this paper, we present evaluate generation method suitable increase performance long short texts. We achieved promising...
At CRYPTO 2018 Cramer et al. presented SPDZ2k , a new secret-sharing based protocol for actively secure multi-party computation against dishonest majority, that works over rings instead of fields. Their uses slightly more communication than competitive schemes working However, implementation-wise, their approach allows arithmetic to be carried out using native 32 or 64-bit CPU operations rather modulo large prime. The authors thus conjectured the increased would made up by efficiency...
We present a runtime environment for executing secure programs via multi-party computation protocol in the preprocessing model. The is general and allows arbitrary reactive computations to be performed. A particularly novel aspect that it automatically determines minimum number of rounds needed computation, given specific instruction sequence, then uses this minimize overall cost computation. Various experiments are reported on, on various non-trivial functionalities. show how, by utilizing...
Abstract We investigate two questions in this paper: First , we ask to what extent “MPC friendly” models are already supported by major Machine Learning frameworks such as TensorFlow or PyTorch. Prior works provide protocols that only work on fixed-point integers and specialized activation functions, aspects not popular frameworks, the need for these model representations means it is hard, often impossible, use e.g., design, train test later have be evaluated securely. Second functionality...
Protocols for secure multiparty computation (MPC) enable a set of mutually distrusting parties to compute an arbitrary function their inputs while preserving basic security properties like privacy and correctness. The study MPC was initiated in the 1980s where it shown that any can be securely computed, thus demonstrating power this notion. However, these proofs feasibility were theoretical nature is only recently protocols started become efficient enough use practice. Today, we have carry...
Secure multiparty computation (MPC) allows a set of mutually distrustful parties to compute public function on their private inputs without revealing anything beyond the output computation. This paper focuses specific case actively secure three-party with an honest majority. In particular, we are interested in solutions which allow evaluate arithmetic circuits over real-world CPU word sizes, like 32- and 64-bit words. Our starting point is novel compiler Damgard et al. from CRYPTO 2018....