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 CryptographyLow-Communication Multiparty Triple Generation for SPDZ from Ring-LPNGladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed DecryptionQuantum oblivious transfer based on entanglement swapping\textsc{SuperPack}: dishonest majority MPC with constant online communicationSok: vector OLE-based zero-knowledge protocolsPseudorandom correlation functions from variable-density LPN, revisitedPutting the online phase on a diet: covert security from short MACsFrom Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applicationsConstrained pseudorandom functions from homomorphic secret sharingLe Mans: dynamic and fluid MPC for dishonest majorityMuSig-L: lattice-based multi-signature with single-round online phaseVerifiable decryption in the headMixed-technique multi-party computations composed of two-party computationsHigh-throughput secure three-party computation with an honest majorityMPClan: protocol suite for privacy-conscious computationsSharing transformation and dishonest majority MPC with packed secret sharingAuthenticated garbling from simple correlationsSecure non-interactive simulation from arbitrary joint distributionsEnhancing privacy preservation and trustworthiness for decentralized federated learningOn rejection sampling in Lyubashevsky's signature schemeAmortizing division and exponentiationAttaining GOD beyond honest majority with friends and foesMultikey Fully Homomorphic Encryption and ApplicationsTwo-round MPC without round collapsing revisited -- towards efficient malicious protocolsMore efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois ringsHomomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomialsCorrelated pseudorandomness from expand-accumulate codesFinancially backed covert security(Public) verifiability for composable protocols without adaptivity or zero-knowledgeManticore: a framework for efficient multiparty computation supporting real number and Boolean arithmeticHalf-tree: halving the cost of tree expansion in COT and DPFFinding and evaluating parameters for BGVOn linear communication complexity for (maximally) fluid MPCBest of both worlds. Revisiting the spymasters double agent problemOne-message secure reductions: on the cost of converting correlationsSecure multiparty computation from threshold encryption based on class groupsCorrelated pseudorandomness from the hardness of quasi-abelian decodingA detailed analysis of Fiat-Shamir with abortsToward practical lattice-based proof of knowledge from Hint-MLWEFast large-scale honest-majority MPC for malicious adversariesOn the Computational Overhead of MPC with Dishonest MajorityScalable Multi-party Private Set-IntersectionOne-Shot Verifiable Encryption from LatticesAmortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness SlackHigh-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest MajorityBlock cipher invariants as eigenvectors of correlation matricesOn the local leakage resilience of linear secret sharing schemesOn the exact round complexity of secure three-party computationMulti-theorem preprocessing NIZKs from latticesLow cost constant round MPC combining BMR and oblivious transferAdaptively secure MPC with sublinear communication complexityRound efficient secure multiparty quantum computation with identifiable abortEfficient set intersection with simulation-based securitySecure fast evaluation of iterative methods: with an application to secure PageRankCompilation of function representations for secure computing paradigmsOblivious TLS via multi-party computationMulti-party revocation in sovrin: performance through distributed trustFluid MPC: secure multiparty computation with dynamic participantsMhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKPSublinear GMW-style compiler for MPC with preprocessingAsymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPCFast cut-and-choose-based protocols for malicious and covert adversariesSecure computation using leaky correlations (asymptotically optimal constructions)Two attacks on rank metric code-based schemes: RankSign and an IBE schemeAn efficient structural attack on NIST submission DAGSEfficient Secure Multiparty Computation with Identifiable AbortMore Efficient Constant-Round Multi-party Computation from BMR and SHESecure Computation with Minimal Interaction, RevisitedImproving the efficiency of AES protocols in multi-party computation\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computationFull-threshold actively-secure multiparty arithmetic circuit garblingThe cost of IEEE arithmetic in secure computationWhen HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overheadHigh throughput secure MPC over small population in hybrid networks (extended abstract)A Secure Priority Queue; Or: On Secure Datastructures from Multiparty ComputationLabeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced dataEnforcing input correctness via certification in garbled circuit evaluationImproved signature schemes for secure multi-party computation with certified inputsNaor-Yung paradigm with shared randomness and applicationsGarbled circuits with sublinear evaluatorHighly efficient OT-based multiplication protocolsRound-optimal multi-party computation with identifiable abortSecure multiparty computation with free branchingSecure multiparty computation with sublinear preprocessingLimits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)Secure non-interactive simulation: feasibility and rateBootstrapping for helibSecure computation with preprocessing via function secret sharingMArBLed circuits: mixing arithmetic and Boolean circuits with active securityCryptographic algorithms for privacy-preserving online applicationsA formal treatment of the role of verified compilers in secure computationAbsentia: secure multiparty computation on ethereumA Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of EquationsSecret computation of purchase history data using somewhat homomorphic encryptionCheater Detection in SPDZ Multiparty ComputationEncoding Functions with Constant Online Rate, or How to Compress Garbled Circuit KeysEfficient RSA key generation and threshold Paillier in the two-party settingOn compiling Boolean circuits optimized for secure multi-party computationFixed-point arithmetic in SHE schemes


Uses Software



This page was built for publication: Multiparty Computation from Somewhat Homomorphic Encryption