Maliciously secure massively parallel computation for all-but-one corruptions
From MaRDI portal
Publication:6155275
DOI10.1007/978-3-031-15802-5_24OpenAlexW4312827809MaRDI QIDQ6155275
Yuval Gelles, Elaine Shi, Ilan Komargodski, Rex Fernando
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15802-5_24
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Threshold cryptosystems from threshold fully homomorphic encryption
- Scalable zero knowledge via cycles of elliptic curves
- Recursive proof composition from accumulation schemes
- Secure massively parallel computation for dishonest majority
- Proof-carrying data without succinct arguments
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Spooky Encryption and Its Applications
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Hiding the Input-Size in Secure Two-Party Computation
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Cluster Computing in Zero Knowledge
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Multi-key FHE from LWE, Revisited
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Foundations of Cryptography
- Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
- Massively Parallel Computation of Matching and MIS in Sparse Graphs
- Weighted Matchings via Unweighted Augmentations
- Fully homomorphic encryption using ideal lattices
- Communication preserving protocols for secure function evaluation
- Round compression for parallel matching algorithms
- Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
- Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
- Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence
- Parallel algorithms for geometric graph problems
- On the (im)possibility of obfuscating programs
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Two Round Multiparty Computation via Multi-key FHE
- MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
- On lattices, learning with errors, random linear codes, and cryptography
