Multiparty Computation from Somewhat Homomorphic Encryption
From MaRDI portal
(Redirected from 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)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- An efficient structural attack on NIST submission DAGS
- Multi-party (leveled) homomorphic encryption on identity-based and attribute-based settings
- Encryption switching protocols revisited: switching modulo \(p\)
- On compiling Boolean circuits optimized for secure multi-party computation
- Fixed-point arithmetic in SHE schemes
- On multiparty garbling of arithmetic circuits
- Secure computation with low communication from cross-checking
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- When it's all just too much: outsourcing MPC-preprocessing
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Finding the maximal adversary structure from any given access structure
- What security can we achieve within 4 rounds?
- Privacy preserving anomaly detection based on local density estimation
- A note on secure multiparty computation via higher residue symbols
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Private information retrieval with sublinear online time
- Secure multi-party quantum computation with a dishonest majority
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- The more the merrier: reducing the cost of large scale MPC
- Generic compiler for publicly verifiable covert multi-party computation
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Masked triples. Amortizing multiplication triples across conditionals
- Actively secure setup for SPDZ
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient constant-round MPC with identifiable abort and public verifiability
- Black-box transformations from passive to covert security with public verifiability
- Improved primitives for MPC over mixed arithmetic-binary circuits
- Efficient two-party exponentiation from quotient transfer
- Efficient compiler to covert security with public verifiability for honest majority MPC
- P2DEX: privacy-preserving decentralized cryptocurrency exchange
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- The price of active security in cryptographic protocols
- Round efficient secure multiparty quantum computation with identifiable abort
- 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
- Sublinear GMW-style compiler for MPC with preprocessing
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Improving the efficiency of AES protocols in multi-party computation
- \( \mathsf{Rabbit} \): efficient comparison for secure 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
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data
- Enforcing input correctness via certification in garbled circuit evaluation
- Improved signature schemes for secure multi-party computation with certified inputs
- Garbled circuits with sublinear evaluator
- Highly efficient OT-based multiplication protocols
- Round-optimal multi-party computation with identifiable abort
- Secure multiparty computation with free branching
- Secure multiparty computation with sublinear preprocessing
- Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
- Secure non-interactive simulation: feasibility and rate
- Secure computation with preprocessing via function secret sharing
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks
- Efficient, actively secure MPC with a dishonest majority: a survey
- Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks
- Probabilistic termination and composability of cryptographic protocols
- Efficient constant-round multi-party computation combining BMR and SPDZ
- Naor-Yung paradigm with shared randomness and applications
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Fully homomorphic SIMD operations
- Bootstrapping for helib
- Cryptographic algorithms for privacy-preserving online applications
- A formal treatment of the role of verified compilers in secure computation
- Absentia: secure multiparty computation on ethereum
- Maliciously secure matrix multiplication with applications to private deep learning
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Efficient set intersection with simulation-based security
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
- Private database access with HE-over-ORAM architecture
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Better preprocessing for secure multiparty computation
- Linear overhead optimally-resilient robust MPC using preprocessing
- High-precision secure computation of satellite collision probabilities
- Network oblivious transfer
- On the communication required for unconditionally secure multiplication
- Probabilistic Termination and Composability of Cryptographic Protocols
- How to prove knowledge of small secrets
- Two-message, oblivious evaluation of cryptographic functionalities
- Encryption switching protocols
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Size-Hiding Computation for Multiple Parties
- Cheater detection in SPDZ multiparty computation
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- An equational approach to secure multi-party computation
- Semi-homomorphic encryption and multiparty computation
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- Efficient secure multiparty computation with identifiable abort
- More efficient constant-round multi-party computation from BMR and SHE
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
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)
