On compiling Boolean circuits optimized for secure multi-party computation

DOI10.1007/S10703-017-0300-0MaRDI QIDQ1696583zbMATH OpenOpenAlexFDO

Authors Niklas Büscher, Martin Franz, Andreas Holzer, Helmut Veith, Stefan Katzenbeisser

Publication date 14 February 2018

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-017-0300-0

zbMATH Keywords

secure multi-party computationcompilerlogic synthesis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Theory of compilers and interpreters (68N20) Distributed systems (68M14)

Recommendations

• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• Secure multiparty computation with free branching
• Secure two-party computation is practical
• Round-optimal secure multi-party computation
• scientific article; zbMATH DE number 2009982

Cites work

• A new approach to practical active-secure two-party computation
• Dishonest majority multi-party computation for binary circuits
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Improved Garbled Circuit: Free XOR Gates and Applications
• Multiparty Computation from Somewhat Homomorphic Encryption
• On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
• Secure multiparty computation goes live
• Software protection and simulation on oblivious RAMs
• The complexity of Boolean formula minimization
• The multiplicative complexity of Boolean functions on four and five variables
• Tools and Algorithms for the Construction and Analysis of Systems
• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen

Cited in

(6)

• Efficient and scalable universal circuits
• A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
• Overlaying conditional circuit clauses for secure computation
• BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
• Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work

Describes a project that uses

Uses Software

• Frigate
• TinyGarble
• Obliv-C
• ABY
• ObliVM
• JustGarble
• Sharemind
• ABC
• TASTY
• CBMC

This page was built for publication: On compiling Boolean circuits optimized for secure multi-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696583)