Unbounded multi-party computation from learning with errors
From MaRDI portal
Publication:2056765
DOI10.1007/978-3-030-77886-6_26OpenAlexW3158549038MaRDI QIDQ2056765
Giulio Malavolta, Zhengzhong Jin, Abhishek Jain, Prabhanjan V. Ananth
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_26
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)
Related Items
Black-box reusable NISC with random oracles ⋮ Maliciously-secure MrNISC in the plain model ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Reusable secure computation in the plain model ⋮ Secure quantum computation with classical communication
Cites Work
- Two-message statistically sender-private OT from LWE
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- Non-interactive secure computation from one-way functions
- Bonsai trees, or how to delegate a lattice basis
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty reusable non-interactive secure computation from LWE
- Reusable non-interactive secure computation
- New constructions of reusable designated-verifier NIZKs
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Efficient Non-interactive Secure Computation
- Public-Key Encryption Schemes with Auxiliary Inputs
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Trapdoors for hard lattices and new cryptographic constructions
- Bi-Deniable Public-Key Encryption
- Fuzzy Identity-Based Encryption
- Non-Interactive Secure Computation Based on Cut-and-Choose
- How to Garble Arithmetic Circuits
- Witness encryption and its applications
- Reusable garbled circuits and succinct functional encryption
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
