Reusable secure computation in the plain model
From MaRDI portal
Publication:6186599
DOI10.1007/978-3-031-38557-5_14OpenAlexW4385654328MaRDI QIDQ6186599
Akshayaram Srinivasan, Vipul Goyal, 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
MPC2PCplain modelreusable oblivious transferreusable secure computationreusable zero-knowledgeround optimal
Cites Work
- Unnamed Item
- Bit commitment using pseudorandomness
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Promise zero knowledge and its applications to round optimal MPC
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty reusable non-interactive secure computation from LWE
- Unbounded multi-party computation from learning with errors
- Round optimal secure multiparty computation from minimal assumptions
- Reusable two-round MPC from DDH
- Mr NISC: multiparty reusable non-interactive secure computation
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Oblivious transfer from trapdoor permutations in minimal rounds
- Efficient Non-interactive Secure Computation
- Round-Optimal Black-Box Two-Party Computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Reusable Two-Round MPC from LPN
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Advances in Cryptology – CRYPTO 2004
- Zaps and Their Applications
- The Exact Round Complexity of Secure Computation
- Round-optimal secure multi-party computation
- Maliciously-secure MrNISC in the plain model
This page was built for publication: Reusable secure computation in the plain model
