Two round multiparty computation via multi-key FHE

Recommendations

Towards round-optimal secure multiparty computations: multikey FHE without a CRS
Towards round-optimal secure multiparty computations: multikey FHE without a CRS
Secure MPC: laziness leads to GOD
Maliciously circuit-private multi-key FHE and MPC based on LWE
Multiparty computation with low communication, computation and interaction via threshold FHE

Cited in

(only showing first 100 items - show all)

Statistical security in two-party computation revisited
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
A practical TFHE-based multi-key homomorphic encryption with linear complexity and low noise growth
On the enumeration of minimal non-pairwise compatibility graphs
Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping
NTRU-based bootstrapping for MK-FHEs without using overstretched parameters
Multi-key Homomorphic Proxy Re-Encryption
mrNISC from LWE with polynomial modulus
Non-interactive blind signatures: post-quantum and stronger security
Three-round secure multiparty computation from black-box two-round oblivious transfer
Post-quantum multi-party computation
On the communication complexity of secure multi-party computation with aborts
Beyond honest majority: the round complexity of fair and robust multi-party computation
Reusable two-round MPC from LPN
Indistinguishability obfuscation from well-founded assumptions
An improved affine equivalence algorithm for random permutations
A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
Broadcast-optimal two-round MPC
Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
Probabilistic termination and composability of cryptographic protocols
Multi-key and multi-input predicate encryption from learning with errors
Toward non-interactive zero-knowledge proofs for NP from LWE
scientific article; zbMATH DE number 6866298 (Why is no real title available?)
On the exact round complexity of secure three-party computation
Broadcast-optimal four-round MPC in the plain model
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Two-round MPC: information-theoretic and black-box
Two-round adaptively secure multiparty computation from standard assumptions
Chosen-Ciphertext Secure Fully Homomorphic Encryption
Four round secure computation without setup
Round-optimal secure multi-party computation
Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
YOSO: You only speak once. Secure MPC with stateless ephemeral roles
Watermarking cryptographic functionalities from standard lattice assumptions
Lattice-based fully dynamic multi-key FHE with short ciphertexts
Breaking the circuit size barrier for secure computation under DDH
Multi-key FHE from LWE, revisited
Practical and efficient FHE-based MPC
Private puncturable PRFs from standard lattice assumptions
Yet another compiler for active security or: efficient MPC over arbitrary rings
Foundations of homomorphic secret sharing
Improved universal thresholdizer from iterative Shamir secret sharing
Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
Batched fully dynamic multi-key FHE from FHEW-like cryptosystems
Multi-input laconic function evaluation
Secure quantum computation with classical communication
Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
Between a rock and a hard place: interpolating between MPC and FHE
Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
Multi-bit leveled homomorphic encryption via dual LWE-based
Scooby: improved multi-party homomorphic secret sharing based on FHE
Maliciously secure massively parallel computation for all-but-one corruptions
Two-round adaptively secure MPC from isogenies, LPN, or CDH
Round-preserving parallel composition of probabilistic-termination cryptographic protocols
Broadcast-optimal secure computation from black-box oblivious transfer
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Bootstrappable fully homomorphic attribute-based encryption with unbounded circuit depth
Succinct witness encryption for batch languages and applications
Towards round-optimal secure multiparty computations: multikey FHE without a CRS
The bottleneck complexity of secure multiparty computation
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
Towards round-optimal secure multiparty computations: multikey FHE without a CRS
Authorized multi-key fully homomorphic encryption scheme with compact ciphertext
Spooky Encryption and Its Applications
Round-optimal and communication-efficient multiparty computation
Toward practical privacy-preserving linear regression
Candidate obfuscation via oblivious LWE sampling
Multiparty reusable non-interactive secure computation from LWE
Unbounded multi-party computation from learning with errors
Towards accountability in CRS generation
Scooby: improved multi-party homomorphic secret sharing based on FHE
Multi-theorem preprocessing NIZKs from lattices
Homomorphic encryption
Combiners for functional encryption, unconditionally
Functional encryption with secure key leasing
From FE combiners to secure MPC and back
Probabilistic Termination and Composability of Cryptographic Protocols
Towards practical multi-key TFHE: parallelizable, key-compatible, quasi-linear complexity
Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
BETA: biometric-enabled threshold authentication
Multi-input attribute based encryption and predicate encryption
Reverse firewalls for actively secure MPCs
Multiparty computation with low communication, computation and interaction via threshold FHE
Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHE
Honest majority MPC with \(\tilde{O}(|C|)\) communication in Minicrypt
Multi-key homomorphic secret sharing
Succinct LWE sampling, random polynomials, and obfuscation
Adaptively secure MPC with sublinear communication complexity
Multikey fully homomorphic encryption and applications
Attribute based encryption for Turing machines from lattices
Scalable multiparty computation from non-linear secret sharing
Secure MPC: laziness leads to GOD
Attribute-based keyed fully homomorphic encryption
On the exact round complexity of best-of-both-worlds multi-party computation
SLAP: simpler, improved private stream aggregation from ring learning with errors
Privacy preserving multi-party computation delegation for deep learning in cloud computing
Towards accountability in CRS generation
Blockchains enable non-interactive MPC
Maliciously circuit-private multi-key FHE and MPC based on LWE

This page was built for publication: Two round multiparty computation via multi-key FHE

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