On perfectly secure 2PC in the OT-hybrid model
From MaRDI portal
Publication:5919118
DOI10.1016/j.tcs.2021.08.035OpenAlexW4207055653MaRDI QIDQ5919118
Bar Alon, Anat Paskin-Cherniavsky
Publication date: 21 October 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.035
Related Items (2)
Oblivious transfer with constant computational overhead ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Singularity of random Bernoulli matrices
- On the Classification of Finite Boolean Functions up to Fairness
- Efficient Non-interactive Secure Computation
- How to share a secret
- Oblivious transfers and intersecting codes
- Oblivious Transfer Is Symmetric
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Oblivious Transfer from Weak Noisy Channels
- On the Power of Correlated Randomness in Secure Computation
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Security in Communication Networks
- Secure Computation from Elastic Noisy Channels
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- Cryptography in $NC^0$
- On perfectly secure 2PC in the OT-hybrid model
This page was built for publication: On perfectly secure 2PC in the OT-hybrid model
