MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation

Riazi, M. Sadegh; Javaheripi, Mojan; Hussain, Siam U.; Koushanfar, Farinaz

doi:10.1109/hst.2019.8740831

Cited by 16 publications

(10 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In practice, data is distributed among different parties, in response to the problem of malicious destruction of the integrity of data, Sundari et al [36] expanded the field of secure computing, using secure multiparty computation technology for data integrity protection to prevent general or malicious destruction. Aiming at the strategy of using garbled circuit technology to replace functions only to solve the problem of two-party calculation, Riazi et al [37] extended it on multi-party computation and made some improvements to promote the implementation of scalable SMPC in practice. Due to the abusive use of a lot of data, in order to make the private data use pricing problem, Shen et al [38] used information entropy to quantitatively analyze the private data, so that the use of private data can be effectively and reasonably distributed, and discussed issues such as price measurement of private data.…”

Section: Related Workmentioning

confidence: 99%

An Entropy-View Secure Multi-Party Computation Protocol Based on Semi-honest Model

Luo

chen

et al. 2022

Preprint

View full text Add to dashboard Cite

Secure multi-party computation(SMPC) is an important research area in cryptography with many application scenarios, but there are still many problems to be solved. Aiming at security and fairness issues in SMPC, we consider that semi-honest participants are able to execute the protocol according to the specification, but there would be some additional malicious operations such as collusion and refuse to exchange information in the process of information interaction, which leads to deviations in the security and fairness of the protocol. To solve the above problems, we combine information entropy and mutual information to propose an n-round information exchange protocol, in which each participant broadcasts a relevant information value in each round without revealing additional information. The uncertainty of the correct result value is fuzzed by the interactive information in each round, and each participant cannot determine the correct result value until the end of the protocol, which effectively prevents malicious behavior and ensures the correct execution of the protocol. Security analysis and fairness analysis show that under the semi-honest model, our protocol guarantees the security and relative fairness of the output obtained by the participants after completing the protocol.

show abstract

Section: Related Workmentioning

confidence: 99%

An Entropy-View Secure Multi-Party Computation Protocol Based on Semi-honest Model

Luo

chen

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In SMPC, parties jointly compute a function over inputs, which the parties keep private. Most SMPC protocols, however, require translating all computations to binary circuits [17]. Employing SMPC for plagiarism detection would thus require new implementations of PD methods.…”

Section: Related Workmentioning

confidence: 99%

A First Step Towards Content Protecting Plagiarism Detection

Ihle¹,

Schubotz

Meuschke

et al. 2020

Proceedings of the ACM/IEEE Joint Conference on Digital Libraries in 2020

View full text Add to dashboard Cite

Plagiarism detection systems are essential tools for safeguarding academic and educational integrity. However, todays systems require disclosing the full content of the input documents and the document collection to which the input documents are compared. Moreover, the systems are centralized and under the control of individual, typically commercial providers. This situation raises procedural and legal concerns regarding the confidentiality of sensitive data, which can limit or prohibit the use of plagiarism detection services. To eliminate these weaknesses of current systems, we seek to devise a plagiarism detection approach that does not require a centralized provider nor exposing any content as cleartext. This paper presents the initial results of our research. Specifically, we employ Private Set Intersection to devise a content-protecting variant of the citation-based similarity measure Bibliographic Coupling implemented in our plagiarism detection system HyPlag. Our evaluation shows that the content-protecting method achieves the same detection effectiveness as the original method while making common attacks to disclose the protected content practically infeasible. Our future work will extend this successful proof-of-concept by devising plagiarism detection methods that can analyze the entire content of documents without disclosing it as cleartext.

show abstract

“…On one hand, several proposed emerging technologies exploit XOR gates [13], [27], [35], [38]. On the other hand, the growing relevance of cryptography-related applications has revived the interest in XOR gates [22], [26], [27], [33], [36], [37], [38]. For example, in high-level cryptography protocols such as secure multiparty computation, processing XOR gates is convenient since their evaluation is possible without any communication cost [28].…”

Section: Introductionmentioning

confidence: 99%

Multiplicative Complexity of XOR Based Regular Functions

Bernasconi

Cimato

Ciriani

et al. 2022

IEEE Trans. Comput.

View full text Add to dashboard Cite

XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs) with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters. Besides several emerging technologies applications, XAGs are often exploited in cryptography-related applications based on the multiplicative complexity of a Boolean function. The multiplicative complexity of a function is the minimum number of AND gates (i.e., multiplications) that are sufficient to represent the function over the basis {AND, XOR, NOT}. In fact, the minimization of the number of AND gates is important for high-level cryptography protocols such as secure multiparty computation, where processing AND gates is more expensive than processing XOR gates. Moreover, it is an indicator of the degree of vulnerability of the circuit, as a small number of AND gates corresponds to a high vulnerability to algebraic attacks. In this paper we study the multiplicative complexity of Boolean functions characterized by two particular regularities, called autosymmetry and D-reducibility. Moreover, we exploit these regularities for decreasing the number of AND nodes in XAGs. The experimental results validate the proposed approaches.

show abstract

MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation

Cited by 16 publications

References 26 publications

An Entropy-View Secure Multi-Party Computation Protocol Based on Semi-honest Model

An Entropy-View Secure Multi-Party Computation Protocol Based on Semi-honest Model

A First Step Towards Content Protecting Plagiarism Detection

Multiplicative Complexity of XOR Based Regular Functions

Contact Info

Product

Resources

About