Unbounded multi-party computation from learning with errors

DOI10.1007/978-3-030-77886-6_26MaRDI QIDQ2056765zbMATH OpenOpenAlexFDO

Authors Abhishek Jain, Zhengzhong Jin, Giulio Malavolta, Prabhanjan Ananth

Publication date 8 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-77886-6_26

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)

Cites work

• Bi-deniable public-key encryption
• Bonsai trees, or how to delegate a lattice basis
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Efficient non-interactive secure computation
• Fuzzy Identity-Based Encryption
• How to Garble Arithmetic Circuits
• Leveled fully homomorphic signatures from standard lattices
• Multi-key fully-homomorphic encryption in the plain model
• Multiparty reusable non-interactive secure computation from LWE
• New constructions of reusable designated-verifier NIZKs
• Non-interactive secure computation based on cut-and-choose
• Non-interactive secure computation from one-way functions
• Public-key encryption schemes with auxiliary inputs
• Reusable garbled circuits and succinct functional encryption
• Reusable non-interactive secure computation
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Two round multiparty computation via multi-key FHE
• Two-message statistically sender-private OT from LWE
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Two-round multiparty secure computation from minimal assumptions
• Two-round secure MPC from indistinguishability obfuscation
• Witness encryption and its applications
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

Cited in

(7)

• Brief Announcement
• Black-box reusable NISC with random oracles
• Reusable secure computation in the plain model
• mrNISC from LWE with polynomial modulus
• Secure quantum computation with classical communication
• mrNISC from LWE with polynomial modulus
• Maliciously-secure MrNISC in the plain model

This page was built for publication: Unbounded multi-party computation from learning with errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056765)