Adaptively secure, universally composable, multiparty computation in constant rounds

DOI10.1007/978-3-662-46497-7_23zbMATH Open1382.94086OpenAlexW827517162MaRDI QIDQ5261692FDOQ5261692

Authors: Dana Dachman-Soled, Vanishree Rao, Jonathan Katz 

Publication date: 6 July 2015

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46497-7_23

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
• scientific article; zbMATH DE number 1256784
• Constant round adaptively secure protocols in the tamper-proof hardware model

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (33)

• 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
• Adaptively secure computation for RAM programs
• On constructing one-way permutations from indistinguishability obfuscation
• Adaptively secure multi-party computation with dishonest majority
• 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
• Deniable fully homomorphic encryption from learning with errors
• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• Limits on the power of indistinguishability obfuscation and functional encryption
• Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
• Better two-round adaptive multi-party computation
• 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
• On adaptively secure protocols
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Adaptive hardness and composable security in the plain model from standard assumptions
• Adaptively Secure Two-Party Computation with Erasures
• Candidate obfuscation via oblivious LWE sampling
• Multiparty reusable non-interactive secure computation from LWE
• 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

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)