Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds

DOI10.1007/978-3-662-46497-7_23zbMath1382.94086OpenAlexW827517162MaRDI QIDQ5261692

Dana Dachman-Soled, Vanishree Rao, Jonathan N. 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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

Deniable fully homomorphic encryption from learning with errors ⋮ Two-round adaptively secure multiparty computation from standard assumptions ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Adaptively secure computation for RAM programs ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ How to Generate and Use Universal Samplers ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Adaptive security of multi-party protocols, revisited ⋮ Efficient one-sided adaptively secure computation ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ Leakage resilience from program obfuscation ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

This page was built for publication: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds