Adaptively secure, universally composable, multiparty computation in constant rounds

Cited In (28)

Leakage resilience from program obfuscation
How to Generate and Use Universal Samplers
Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups
Better Two-Round Adaptive Multi-party Computation
Adaptively secure computation for RAM programs
On constructing one-way permutations from indistinguishability obfuscation
Deniable Attribute Based Encryption for Branching Programs from LWE
Adaptive versus non-adaptive security of multi-party protocols
Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Constant-round linear-broadcast secure computation with penalties
Two-round adaptively secure multiparty computation from standard assumptions
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
Deniable fully homomorphic encryption from learning with errors
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
Constant-round leakage-resilient zero-knowledge from collision resistance
Title not available (Why is that?)
On Constructing One-Way Permutations from Indistinguishability Obfuscation
Adaptive hardness and composable security in the plain model from standard assumptions
Candidate obfuscation via oblivious LWE sampling
Multiparty reusable non-interactive secure computation from LWE
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
Adaptively secure MPC with sublinear communication complexity
On Adaptively Secure Multiparty Computation with a Short CRS
Adaptive security of multi-party protocols, revisited
General composition and universal composability in secure multiparty computation
Efficient one-sided adaptively secure computation
Round-efficient black-box construction of composable multi-party computation
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

   Recommendations

Adaptively secure multi-party computation with dishonest majority 👍 👎
On Adaptively Secure Multiparty Computation with a Short CRS 👍 👎
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation 👍 👎
Title not available (Why is that?) 👍 👎
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model 👍 👎

This page was built for publication: Adaptively secure, universally composable, multiparty computation in constant rounds

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