Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275)

scientific article; zbMATH DE number 7694635

Language	Label	Description	Also known as
English	Maliciously secure massively parallel computation for all-but-one corruptions	scientific article; zbMATH DE number 7694635

Statements

instance of

scholarly article

0 references

title

Maliciously secure massively parallel computation for all-but-one corruptions (English)

0 references

0 references

0 references

0 references

0 references

Advances in Cryptology – CRYPTO 2022

0 references

publication date

12 June 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-15802-5_24

0 references

cites work

Parallel algorithms for geometric graph problems

0 references

Q5091162

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

0 references

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

0 references

On the (im)possibility of obfuscating programs

0 references

Massively Parallel Computation of Matching and MIS in Sparse Graphs

0 references

Scalable zero knowledge via cycles of elliptic curves

0 references

Recursive composition and bootstrapping for SNARKS and proof-carrying data

0 references

Threshold cryptosystems from threshold fully homomorphic encryption

0 references

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs

0 references

Q5002694

0 references

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

0 references

Proof-carrying data without succinct arguments

0 references

Recursive proof composition from accumulation schemes

0 references

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

0 references

The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation

0 references

Cluster Computing in Zero Knowledge

0 references

Round compression for parallel matching algorithms

0 references

Spooky Encryption and Its Applications

0 references

Secure massively parallel computation for dishonest majority

0 references

Weighted Matchings via Unweighted Augmentations

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

Fully homomorphic encryption using ideal lattices

0 references

Separating succinct non-interactive arguments from all falsifiable assumptions

0 references

Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation

0 references

Foundations of Cryptography

0 references

On the Size of Pairing-Based Non-interactive Arguments

0 references

Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence

0 references

On the Communication Complexity of Secure Function Evaluation with Long Output

0 references

Q5417679

0 references

Q4434900

0 references

Hiding the Input-Size in Secure Two-Party Computation

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

Q2958605

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Communication preserving protocols for secure function evaluation

0 references

Bounded-concurrent secure multi-party computation with a dishonest majority

0 references

Multi-key FHE from LWE, Revisited

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Identifiers

DOI

10.1007/978-3-031-15802-5_24

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6155275