On perfectly secure 2PC in the OT-hybrid model
From MaRDI portal
Publication:5918800
DOI10.1007/978-3-030-36030-6_22zbMath1455.94106OpenAlexW2991229659MaRDI QIDQ5918800
Anat Paskin-Cherniavsky, Bar Alon
Publication date: 30 April 2020
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_22
Related Items
On perfectly secure two-party computation for symmetric functionalities with correlated randomness ⋮ On perfectly secure 2PC in the OT-hybrid model
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
- 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$
This page was built for publication: On perfectly secure 2PC in the OT-hybrid model
