Multiparty Computation from Somewhat Homomorphic Encryption
From MaRDI portal
Publication:2914293
Recommendations
- scientific article; zbMATH DE number 1808209
- 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
Cited in
(only showing first 100 items - show all)- 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
- Minimal-latency secure function evaluation
- Masked triples. Amortizing multiplication triples across conditionals
- Enforcing input correctness via certification in garbled circuit evaluation
- Improved signature schemes for secure multi-party computation with certified inputs
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Multikey fully homomorphic encryption and applications
- Two-message, oblivious evaluation of cryptographic functionalities
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- Maliciously secure matrix multiplication with applications to private deep learning
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Cheater detection in SPDZ multiparty computation
- Round efficient secure multiparty quantum computation with identifiable abort
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Authenticated garbling from simple correlations
- Low-communication multiparty triple generation for SPDZ from ring-LPN
- Naor-Yung paradigm with shared randomness and applications
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- On the local leakage resilience of linear secret sharing schemes
- Secure Multiparty AES
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- On the communication required for unconditionally secure multiplication
- Actively secure setup for SPDZ
- 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
- 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
- Encryption switching protocols
- Efficient secure multiparty computation with identifiable abort
- More efficient constant-round multi-party computation from BMR and SHE
- The price of active security in cryptographic protocols
- \( \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
- 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
- Network oblivious transfer
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Efficient set intersection with simulation-based security
- An equational approach to secure multi-party computation
- Secure computation with preprocessing via function secret sharing
- On multiparty garbling of arithmetic circuits
- High-throughput secure three-party computation with an honest majority
- A note on secure multiparty computation via higher residue symbols
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Secret computation of purchase history data using somewhat homomorphic encryption
- Advances in Cryptology - CRYPTO 2003
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Pseudorandom correlation functions from variable-density LPN, revisited
- Fast large-scale honest-majority MPC for malicious adversaries
- On compiling Boolean circuits optimized for secure multi-party computation
- One-shot verifiable encryption from lattices
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Privacy preserving anomaly detection based on local density estimation
- Secure computation using leaky correlations (asymptotically optimal constructions)
- Efficient compiler to covert security with public verifiability for honest majority MPC
- Probabilistic Termination and Composability of Cryptographic Protocols
- Efficient, actively secure MPC with a dishonest majority: a survey
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Private information retrieval with sublinear online time
- Generic compiler for publicly verifiable covert multi-party computation
- The more the merrier: reducing the cost of large scale MPC
- 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
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Quantum private comparison over noisy channels
- On the computational overhead of MPC with dishonest majority
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Scalable multi-party private set-intersection
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Secure non-interactive simulation: feasibility and rate
- An efficient structural attack on NIST submission DAGS
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Better preprocessing for secure multiparty computation
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Probabilistic termination and composability of cryptographic protocols
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Adaptively secure MPC with sublinear communication complexity
- Quantum oblivious transfer based on entanglement swapping
- Encryption switching protocols revisited: switching modulo \(p\)
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)
