Multiparty Computation from Somewhat Homomorphic Encryption
From MaRDI portal
Publication:2914293
DOI10.1007/978-3-642-32009-5_38zbMath1296.94104OpenAlexW2402235285MaRDI QIDQ2914293
Valerio Pastro, Sarah Zakarias, Nigel P. Smart, Ivan B. Damgård
Publication date: 25 September 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-32009-5_38
Related Items (only showing first 100 items - show all)
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN ⋮ Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption ⋮ Quantum oblivious transfer based on entanglement swapping ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Putting the online phase on a diet: covert security from short MACs ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Verifiable decryption in the head ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ High-throughput secure three-party computation with an honest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Authenticated garbling from simple correlations ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Enhancing privacy preservation and trustworthiness for decentralized federated learning ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ Amortizing division and exponentiation ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Financially backed covert security ⋮ (Public) verifiability for composable protocols without adaptivity or zero-knowledge ⋮ Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Finding and evaluating parameters for BGV ⋮ On linear communication complexity for (maximally) fluid MPC ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ A detailed analysis of Fiat-Shamir with aborts ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ On the Computational Overhead of MPC with Dishonest Majority ⋮ Scalable Multi-party Private Set-Intersection ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ On the exact round complexity of secure three-party computation ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Round efficient secure multiparty quantum computation with identifiable abort ⋮ Efficient set intersection with simulation-based security ⋮ Secure fast evaluation of iterative methods: with an application to secure PageRank ⋮ Compilation of function representations for secure computing paradigms ⋮ Oblivious TLS via multi-party computation ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Fluid MPC: secure multiparty computation with dynamic participants ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ An efficient structural attack on NIST submission DAGS ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Improving the efficiency of AES protocols in multi-party computation ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Full-threshold actively-secure multiparty arithmetic circuit garbling ⋮ The cost of IEEE arithmetic in secure computation ⋮ When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ Garbled circuits with sublinear evaluator ⋮ Highly efficient OT-based multiplication protocols ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Secure multiparty computation with free branching ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Secure non-interactive simulation: feasibility and rate ⋮ Bootstrapping for helib ⋮ Secure computation with preprocessing via function secret sharing ⋮ MArBLed circuits: mixing arithmetic and Boolean circuits with active security ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ A formal treatment of the role of verified compilers in secure computation ⋮ Absentia: secure multiparty computation on ethereum ⋮ A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ Cheater Detection in SPDZ Multiparty Computation ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Fixed-point arithmetic in SHE schemes
Uses Software
This page was built for publication: Multiparty Computation from Somewhat Homomorphic Encryption
