On perfectly secure two-party computation for symmetric functionalities with correlated randomness

DOI10.1007/978-3-031-22365-5_19zbMath1521.94023OpenAlexW4313181121MaRDI QIDQ6169419

Olga Nissenbaum, Eran Omri, Bar Alon, Anat Paskin-Cherniavsky, Arpita Patra

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

two-party computationperfect securitycorrelated randomness

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14)

Cites Work

• Security and composition of multiparty cryptographic protocols
• Oblivious transfers and intersecting codes
• Oblivious Transfer Is Symmetric
• Privacy and Communication Complexity
• Foundations of Cryptography
• On the Power of Correlated Randomness in Secure Computation
• A Zero-One Law for Boolean Privacy
• On perfectly secure 2PC in the OT-hybrid model

This page was built for publication: On perfectly secure two-party computation for symmetric functionalities with correlated randomness