On compiling Boolean circuits optimized for secure multi-party computation

DOI10.1007/s10703-017-0300-0zbMath1386.68020OpenAlexW2756314484MaRDI QIDQ1696583

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

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

logic synthesissecure multi-party computationcompiler

Mathematics Subject Classification ID

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

Related Items (1)

Efficient and scalable universal circuits

Uses Software

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

Cites Work

• The complexity of Boolean formula minimization
• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
• On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
• Dishonest Majority Multi-Party Computation for Binary Circuits
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• The Multiplicative Complexity of Boolean Functions on Four and Five Variables
• Improved Garbled Circuit: Free XOR Gates and Applications
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Secure Multiparty Computation Goes Live
• Software protection and simulation on oblivious RAMs
• Tools and Algorithms for the Construction and Analysis of Systems

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