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

DOI10.1007/978-3-031-17143-7_15zbMath1524.68143OpenAlexW3208671521MaRDI QIDQ6109459

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

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

Cites Work

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

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