Mixed-technique multi-party computations composed of two-party computations

DOI10.1007/978-3-031-17143-7_15MaRDI QIDQ6109459zbMATH OpenOpenAlexFDO

Authors Erik-Oliver Blass, Florian Kerschbaum

Publication date 28 July 2023

Published in Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-17143-7_15

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• Batching multiple protocols to improve efficiency of multi-party computation
• Privacy-preserving mixed set operations
• Composition of secure multi-party protocols. A comprehensive study.
• scientific article; zbMATH DE number 1952886

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• Advances in Cryptology - EUROCRYPT 2004
• An efficient toolkit for computing private set operations
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Efficient circuit-based PSI via cuckoo hashing
• Efficient circuit-based PSI with linear communication
• Efficient constant-round multi-party computation combining BMR and SPDZ
• Efficient Disjointness Tests for Private Datasets
• Efficient maliciously secure multiparty computation for RAM
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• Financial Cryptography and Data Security
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Improved primitives for MPC over mixed arithmetic-binary circuits
• Improved private set intersection against malicious adversaries
• LEGO for Two-Party Secure Computation
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• More efficient constant-round multi-party computation from BMR and SHE
• Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
• Multiparty cardinality testing for threshold private intersection
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Overdrive: making SPDZ great again
• Privacy-Preserving Set Operations
• Scalable multi-party private set-intersection
• Secure and efficient multiparty private set intersection cardinality
• Secure multi-party computation without agreement
• TFHE: fast fully homomorphic encryption over the torus
• Threshold cryptosystems from threshold fully homomorphic encryption
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions

This page was built for publication: Mixed-technique multi-party computations composed of two-party computations

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