Multiparty Computation from Somewhat Homomorphic Encryption

DOI10.1007/978-3-642-32009-5_38zbMATH Open1296.94104OpenAlexW2402235285MaRDI QIDQ2914293FDOQ2914293

Authors: Valerio Pastro, Sarah Zakarias, Ivan B. Damgård, N. P. Smart 

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

Recommendations

• scientific article
• Semi-homomorphic encryption and multiparty computation
• Secure Multiparty Computation
• Secure multi-party computation
• Secure multiparty computation and secret sharing
• Multiparty Computations in Non-private Environments
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1583776
• Generalizing efficient multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (only showing first 100 items - show all)

• Efficient, actively secure MPC with a dishonest majority: a survey
• Compilation of function representations for secure computing paradigms
• Oblivious TLS via multi-party computation
• Multi-party revocation in sovrin: performance through distributed trust
• Secure fast evaluation of iterative methods: with an application to secure PageRank
• Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
• High throughput secure MPC over small population in hybrid networks (extended abstract)
• Block cipher invariants as eigenvectors of correlation matrices
• Secure multi-party quantum computation with a dishonest majority
• Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
• Finding the maximal adversary structure from any given access structure
• Efficient set intersection with simulation-based security
• Better Preprocessing for Secure Multiparty Computation
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
• Probabilistic termination and composability of cryptographic protocols
• What security can we achieve within 4 rounds?
• Secure computation using leaky correlations (asymptotically optimal constructions)
• Secure multi-party computation minimizing online rounds
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Fast cut-and-choose-based protocols for malicious and covert adversaries
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Secure computation with preprocessing via function secret sharing
• Title not available (Why is that?)
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings
• Secure multiparty computation with sublinear preprocessing
• Private Database Access with HE-over-ORAM Architecture
• Fixed-point arithmetic in SHE schemes
• On multiparty garbling of arithmetic circuits
• Privacy preserving anomaly detection based on local density estimation
• Secret computation of purchase history data using somewhat homomorphic encryption
• A note on secure multiparty computation via higher residue symbols
• How to Prove Knowledge of Small Secrets
• High-performance multi-party computation for binary circuits based on oblivious transfer
• Network Oblivious Transfer
• Pseudorandom correlation functions from variable-density LPN, revisited
• Efficient compiler to covert security with public verifiability for honest majority MPC
• Semi-homomorphic encryption and multiparty computation
• Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
• Private information retrieval with sublinear online time
• Constant-overhead unconditionally secure multiparty computation over binary fields
• Generic compiler for publicly verifiable covert multi-party computation
• Large scale, actively secure computation from LPN and free-XOR garbled circuits
• The more the merrier: reducing the cost of large scale MPC
• Black-box transformations from passive to covert security with public verifiability
• Efficient pseudorandom correlation generators from ring-LPN
• Efficient constant-round MPC with identifiable abort and public verifiability
• The price of active security in cryptographic protocols
• An equational approach to secure multi-party computation
• On the Computational Overhead of MPC with Dishonest Majority
• Probabilistic Termination and Composability of Cryptographic Protocols
• Secure Computation with Minimal Interaction, Revisited
• Fast large-scale honest-majority MPC for malicious adversaries
• Adaptively secure MPC with sublinear communication complexity
• A formal treatment of the role of verified compilers in secure computation
• Secure non-interactive simulation: feasibility and rate
• Scalable Multi-party Private Set-Intersection
• On compiling Boolean circuits optimized for secure multi-party computation
• Encryption Switching Protocols
• Quantum oblivious transfer based on entanglement swapping
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• An efficient structural attack on NIST submission DAGS
• Fully homomorphic SIMD operations
• Efficient Secure Multiparty Computation with Identifiable Abort
• Advances in Cryptology - CRYPTO 2003
• Quantum private comparison over noisy channels
• Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
• Secure computation with low communication from cross-checking
• Efficient one-sided adaptively secure computation
• High-throughput secure three-party computation with an honest majority
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
• One-Shot Verifiable Encryption from Lattices
• Secure Arithmetic Computation with No Honest Majority
• MPClan: protocol suite for privacy-conscious computations
• Minimal-latency secure function evaluation
• More Efficient Constant-Round Multi-party Computation from BMR and SHE
• Privacy-preserving distributed machine learning based on secret sharing
• Maliciously circuit-private multi-key FHE and MPC based on LWE
• On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
• A new approach to efficient and secure fixed-point computation
• Improved primitives for MPC over mixed arithmetic-binary circuits
• Efficient two-party exponentiation from quotient transfer
• On the local leakage resilience of linear secret sharing schemes
• Enhancing privacy preservation and trustworthiness for decentralized federated learning
• Amortizing division and exponentiation
• On rejection sampling in Lyubashevsky's signature scheme
• Efficient constant-round multi-party computation combining BMR and SPDZ
• Secure non-interactive simulation from arbitrary joint distributions
• Attaining GOD beyond honest majority with friends and foes
• Secure two-party computation via measurement-based quantum computing
• The hardness of LPN over any integer ring and field for PCG applications
• Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems
• Eagle: efficient privacy preserving smart contracts
• Practical construction for secure trick-taking games even with cards set aside
• Secure multi-party SM2 signature based on SPDZ protocol
• Two-Message, Oblivious Evaluation of Cryptographic Functionalities
• Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
• \textsc{SuperPack}: dishonest majority MPC with constant online communication

Uses Software

• BKZ

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

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