Reusable secure computation in the plain model

DOI10.1007/978-3-031-38557-5_14MaRDI QIDQ6186599zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38557-5_14

zbMATH Keywords

MPC2PCplain modelreusable oblivious transferreusable secure computationreusable zero-knowledgeround optimal

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Exact Round Complexity of Secure Computation
• Advances in Cryptology – CRYPTO 2004
• On secure two-party computation in three rounds
• Secure multi-party computation minimizing online rounds
• Round optimal secure multiparty computation from minimal assumptions

Cites work

• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
• A new approach to round-optimal secure multiparty computation
• Advances in Cryptology – CRYPTO 2004
• Bit commitment using pseudorandomness
• Efficient non-interactive secure computation
• Efficient oblivious transfer protocols
• Founding Cryptography on Oblivious Transfer – Efficiently
• Four round secure computation without setup
• Maliciously-secure MrNISC in the plain model
• 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
• Oblivious transfer from trapdoor permutations in minimal rounds
• Promise zero knowledge and its applications to round optimal MPC
• Reusable two-round MPC from DDH
• Reusable two-round MPC from LPN
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal black-box two-party computation
• Round-optimal secure multi-party computation
• Secure computation on the web: computing without simultaneous interaction
• The Exact Round Complexity of Secure Computation
• Two-round multiparty secure computation from minimal assumptions
• Unbounded multi-party computation from learning with errors
• Zaps and Their Applications
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

This page was built for publication: Reusable secure computation in the plain model

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