mrNISC from LWE with polynomial modulus

DOI10.1007/978-3-031-14791-3_21MaRDI QIDQ6134835zbMATH OpenOpenAlexFDO

Authors Sina Shiehian

Publication date 25 July 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_21

zbMATH Keywords

multi-party reusable non-interactive secure computation protocolpublic-key encryption

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Reusable non-interactive secure computation
• Non-interactive secure computation from one-way functions
• Concurrently composable non-interactive secure computation
• Reusable two-round MPC from LPN
• Non-interactive secure computation based on cut-and-choose

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Classical hardness of learning with errors
• Computationally private randomizing polynomials and their applications
• Degree 2 is complete for the round-complexity of malicious MPC
• Fully homomorphic encryption using ideal lattices
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• Lattice-based FHE as secure as PKE
• Leveled fully homomorphic signatures from standard lattices
• Mr NISC: multiparty reusable non-interactive secure computation
• Multiparty reusable non-interactive secure computation from LWE
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On lattices, learning with errors, random linear codes, and cryptography
• On perfect correctness in (lockable) obfuscation
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Pseudorandomness of ring-LWE for any ring and modulus
• Public-key cryptosystems from the worst-case shortest vector problem
• Two round information-theoretic MPC with malicious security
• Two round multiparty computation via multi-key FHE
• Two-message statistically sender-private OT from LWE
• Two-round multiparty secure computation from minimal assumptions
• Two-round secure MPC from indistinguishability obfuscation
• Unbounded multi-party computation from learning with errors

Cited in

(7)

• Succinct non-interactive secure computation
• Mr NISC: multiparty reusable non-interactive secure computation
• Black-box reusable NISC with random oracles
• Maliciously-secure MrNISC in the plain model
• Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Simulation-secure threshold PKE from LWE with polynomial modulus

This page was built for publication: mrNISC from LWE with polynomial modulus

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