On Adaptively Secure Multiparty Computation with a Short CRS

DOI10.1007/978-3-319-44618-9_7MaRDI QIDQ2827714zbMATH OpenOpenAlexFDO

Authors Ran Cohen, Chris Peikert

Publication date 21 October 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44618-9_7

zbMATH Keywords

common reference string (CRS)non-committing indistinguishability obfuscation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 1304080
• scientific article; zbMATH DE number 1256784
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Adaptively secure multi-party computation with dishonest majority
• Two-round adaptively secure multiparty computation from standard assumptions
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• scientific article; zbMATH DE number 1583776
• Adaptively Secure Two-Party Computation with Erasures
• Efficient general-adversary multi-party computation
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

Cites work

• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• Adaptively secure multi-party computation with dishonest majority
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure Two-Party Computation with Erasures
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Advances in Cryptology – CRYPTO 2004
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Composition of secure multi-party protocols. A comprehensive study.
• Computational Complexity
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Feasibility and infeasibility of adaptively secure fully homomorphic encryption
• Founding Cryptography on Oblivious Transfer – Efficiently
• scientific article; zbMATH DE number 5485432 (Why is no real title available?)
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 1302782 (Why is no real title available?)
• scientific article; zbMATH DE number 503347 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Leakage-Tolerant Interactive Protocols
• On complete primitives for fairness
• On the limitations of universally composable two-party computation without set-up assumptions
• One-Sided Adaptively Secure Two-Party Computation
• Security and composition of multiparty cryptographic protocols
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Two-round secure MPC from indistinguishability obfuscation
• Universally composable two-party and multi-party secure computation

Cited in

(6)

• Two-round adaptively secure multiparty computation from standard assumptions
• Adaptively secure computation for RAM programs
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Constant round adaptively secure protocols in the tamper-proof hardware model
• Adaptively secure MPC with sublinear communication complexity

This page was built for publication: On Adaptively Secure Multiparty Computation with a Short CRS

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