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 constant-round multi-party computation combining BMR and SPDZ
\textsc{SuperPack}: dishonest majority MPC with constant online communication
P2DEX: privacy-preserving decentralized cryptocurrency exchange
TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
Round efficient secure multiparty quantum computation with identifiable abort
An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
On the communication required for unconditionally secure multiplication
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
Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
Sublinear GMW-style compiler for MPC with preprocessing
\( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
Improving the efficiency of AES protocols in 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
Enforcing input correctness via certification in garbled circuit evaluation
Improved signature schemes for secure multi-party computation with certified inputs
Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks
Secure Multiparty AES
Low-communication multiparty triple generation for SPDZ from ring-LPN
Encryption switching protocols
Efficient secure multiparty computation with identifiable abort
More efficient constant-round multi-party computation from BMR and SHE
Maliciously secure matrix multiplication with applications to private deep learning
Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
Garbled circuits with sublinear evaluator
Highly efficient OT-based multiplication protocols
Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
Round-optimal multi-party computation with identifiable abort
Secure multiparty computation with free branching
Constant-overhead unconditionally secure multiparty computation over binary fields
Large scale, actively secure computation from LPN and free-XOR garbled circuits
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
Masked triples. Amortizing multiplication triples across conditionals
Authenticated garbling from simple correlations
Efficient RSA key generation and threshold Paillier in the two-party setting
Multikey fully homomorphic encryption and applications
Naor-Yung paradigm with shared randomness and applications
Actively secure setup for SPDZ
Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
Minimal-latency secure function evaluation
Universally verifiable multiparty computation from threshold homomorphic cryptosystems
Two-message, oblivious evaluation of cryptographic functionalities
Cheater detection in SPDZ multiparty computation
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
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
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)
Scalable multi-party private set-intersection
Block cipher invariants as eigenvectors of correlation matrices
Secure multi-party quantum computation with a dishonest majority
Finding the maximal adversary structure from any given access structure
Efficient set intersection with simulation-based security
A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
Probabilistic termination and composability of cryptographic protocols
Private database access with HE-over-ORAM architecture
When it's all just too much: outsourcing MPC-preprocessing
What security can we achieve within 4 rounds?
One-shot verifiable encryption from lattices
High-throughput secure three-party computation for malicious adversaries and an honest majority
On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
Faster secure multi-party computation of AES and DES using lookup tables
Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
Secure computation using leaky correlations (asymptotically optimal constructions)
Secure multi-party computation minimizing online rounds
How to prove knowledge of small secrets
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 minimal interaction, revisited
Network oblivious transfer
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
Fixed-point arithmetic in SHE schemes
On multiparty garbling of arithmetic circuits
Privacy preserving anomaly detection based on local density estimation
Constant-overhead secure computation of Boolean circuits using preprocessing
Secret computation of purchase history data using somewhat homomorphic encryption
A note on secure multiparty computation via higher residue symbols
High-performance multi-party computation for binary circuits based on 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

Uses Software

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)