Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces

DOI10.1007/978-3-642-27954-6_26zbMath1292.94047OpenAlexW1540408657MaRDI QIDQ2890025

Kyung-Wook Hwang, Seung Geol Choi, Tal Malkin, Dan Rubenstein, Jonathan N. Katz

Publication date: 8 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_26

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Privacy Assurances in Multiple Data-Aggregation Transactions ⋮ More efficient oblivious transfer extensions ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer

Uses Software

• VIFF
• TASTY
• FairplayMP
• VMCrypt
• Sharemind

Cites Work

• Unnamed Item
• Unnamed Item
• Computationally secure oblivious transfer
• Trading grid services - a multi-attribute combinatorial approach
• Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Efficient Implementation of the Orlandi Protocol
• Asynchronous Multiparty Computation: Theory and Implementation
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Secure Two-Party Computation Is Practical
• Secure Multiparty Computation Goes Live
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces