On Adaptively Secure Multiparty Computation with a Short CRS
From MaRDI portal
Publication:2827714
DOI10.1007/978-3-319-44618-9_7zbMath1400.94182OpenAlexW2510832307MaRDI QIDQ2827714
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62)
Related Items
Adaptively secure computation for RAM programs ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Composition of secure multi-party protocols. A comprehensive study.
- Security and composition of multiparty cryptographic protocols
- On the limitations of universally composable two-party computation without set-up assumptions
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Leakage-Tolerant Interactive Protocols
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- On Complete Primitives for Fairness
- Universally composable two-party and multi-party secure computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Adaptively Secure Two-Party Computation with Erasures
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Advances in Cryptology – CRYPTO 2004
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Two-Round Secure MPC from Indistinguishability Obfuscation
- One-Sided Adaptively Secure Two-Party Computation
- Computational Complexity
