scientific article; zbMATH DE number 7375951
From MaRDI portal
Publication:5002694
DOI10.4230/LIPIcs.ICALP.2018.24zbMath1499.68119MaRDI QIDQ5002694
Ching-Hua Yu, Manoj Prabhakaran, Abhishek Jain, Elette Boyle
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Communication complexity, information complexity (68Q11)
Related Items
On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ The more the merrier: reducing the cost of large scale MPC
Cites Work
- Unnamed Item
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- On the Communication Required for Unconditionally Secure Multiplication
- Spooky Encryption and Its Applications
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Secure Two-Party Computation with Low Communication
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
- On the (In)Security of SNARKs in the Presence of Oracles
- Multi-key FHE from LWE, Revisited
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Communication Complexity
- Communication Locality in Secure Multi-party Computation
- Communication preserving protocols for secure function evaluation
- Fast byzantine agreement
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Two Round Multiparty Computation via Multi-key FHE
- Scalable Secure Multiparty Computation
