Reusable two-round MPC from LPN

DOI10.1007/978-3-030-97121-2_7MaRDI QIDQ5087256zbMATH OpenOpenAlexFDO

Authors James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang

Publication date 8 July 2022

Published in Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-97121-2_7

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer security (68M25)

Recommendations

• Reusable two-round MPC from DDH
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Two-round oblivious transfer from CDH or LPN
• Two-round multiparty secure computation from minimal assumptions
• Two round multiparty computation via multi-key FHE

Cites work

• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Breaking the circuit size barrier for secure computation under DDH
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Computationally private randomizing polynomials and their applications
• Cryptography with constant input locality
• Distributed Point Functions and Their Applications
• Efficient pseudorandom correlation generators: silent OT extension and more
• Mr NISC: multiparty reusable non-interactive secure computation
• Multi-key fully-homomorphic encryption in the plain model
• Multiparty reusable non-interactive secure computation from LWE
• On lattices, learning with errors, random linear codes, and cryptography
• Reusable two-round MPC from LPN
• Spooky Encryption and Its Applications
• Two round multiparty computation via multi-key FHE
• Two-round MPC: information-theoretic and black-box
• Two-round multiparty secure computation from minimal assumptions
• Two-round oblivious transfer from CDH or LPN
• Two-round secure MPC from indistinguishability obfuscation
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

Cited in

(10)

• mrNISC from LWE with polynomial modulus
• Reusable two-round MPC from LPN
• Black-box reusable NISC with random oracles
• Maliciously-secure MrNISC in the plain model
• Two-round adaptively secure MPC from isogenies, LPN, or CDH
• Reusable secure computation in the plain model
• Reusable two-round MPC from DDH
• Malicious security for SCALES. Outsourced computation with ephemeral servers
• SCALES. MPC with small clients and larger ephemeral servers
• mrNISC from LWE with polynomial modulus

This page was built for publication: Reusable two-round MPC from LPN

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