Round-optimal black-box protocol compilers
From MaRDI portal
Publication:2170000
DOI10.1007/978-3-031-06944-4_8zbMath1499.68118OpenAlexW4285125835MaRDI QIDQ2170000
Dakshita Khurana, Akshayaram Srinivasan, Yuval Ishai, Amit Sahai
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_8
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Theory of compilers and interpreters (68N20)
Related Items (2)
Black-box reusable NISC with random oracles ⋮ Round-optimal black-box secure computation from two-round malicious OT
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-round MPC: information-theoretic and black-box
- Two-round multiparty secure computation from minimal assumptions
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- On the round complexity of black-box secure MPC
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Reusable non-interactive secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Black-Box Constructions of Protocols for Secure Computation
- The random oracle methodology, revisited
- Round-Optimal Black-Box Two-Party Computation
- Secure Computation with Minimal Interaction, Revisited
- Secure Multiparty Computation with Minimal Interaction
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
This page was built for publication: Round-optimal black-box protocol compilers
