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 local leakage resilience of linear secret sharing schemes
- 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
- Secure Arithmetic Computation with No Honest Majority
- Efficient, actively secure MPC with a dishonest majority: a survey
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Enhancing privacy preservation and trustworthiness for decentralized federated learning
- Amortizing division and exponentiation
- On rejection sampling in Lyubashevsky's signature scheme
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Secure non-interactive simulation from arbitrary joint distributions
- Scalable multi-party private set-intersection
- Block cipher invariants as eigenvectors of correlation matrices
- Attaining GOD beyond honest majority with friends and foes
- Secure multi-party quantum computation with a dishonest majority
- Secure two-party computation via measurement-based quantum computing
- Efficient set intersection with simulation-based security
- Finding the maximal adversary structure from any given access structure
- The hardness of LPN over any integer ring and field for PCG applications
- 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
- 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
- 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
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- Probabilistic termination and composability of cryptographic protocols
- Private database access with HE-over-ORAM architecture
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Secure Multi-Party Computation for Elliptic Curves
- Sharing transformation and dishonest majority MPC with packed secret sharing
- When it's all just too much: outsourcing MPC-preprocessing
- On the communication required for unconditionally secure multiplication
- What security can we achieve within 4 rounds?
- On the exact round complexity of secure three-party computation
- DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- One-shot verifiable encryption from lattices
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Secure computation using leaky correlations (asymptotically optimal constructions)
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Linear overhead optimally-resilient robust MPC using preprocessing
- Faster secure multi-party computation of AES and DES using lookup tables
- 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
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- How to prove knowledge of small secrets
- Secure multi-party computation minimizing online rounds
- Correlated pseudorandomness from expand-accumulate codes
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Financially backed covert security
- Secure computation with preprocessing via function secret sharing
- Network oblivious transfer
- Secure computation with minimal interaction, revisited
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians
- Practical and efficient FHE-based MPC
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- 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
- High-precision secure computation of satellite collision probabilities
- Half-tree: halving the cost of tree expansion in COT and DPF
- Le Mans: dynamic and fluid MPC for dishonest majority
- Fixed-point arithmetic in SHE schemes
- \( \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
- On multiparty garbling of arithmetic circuits
- 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
- Privacy preserving anomaly detection based on local density estimation
- Sok: vector OLE-based zero-knowledge protocols
- Finding and evaluating parameters for BGV
- Best of both worlds. Revisiting the spymasters double agent problem
- On linear communication complexity for (maximally) fluid MPC
- One-message secure reductions: on the cost of converting correlations
- Secure multiparty computation from threshold encryption based on class groups
- Secret computation of purchase history data using somewhat homomorphic encryption
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Size-Hiding Computation for Multiple Parties
- A note on secure multiparty computation via higher residue symbols
- The price of active security in cryptographic protocols
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
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)
