Search Results - "Applebaum, Benny"

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.

Authors: Applebaum, Benny Vasudevan, Prashant Nalini

Source: Journal of Cryptology; 2021, Vol. 34 Issue 2, p1-45, 45p

The Communication Complexity of Private Simultaneous Messages, Revisited.

Authors: Applebaum, Benny Holenstein, Thomas Mishra, Manoj et al.

Source: Journal of Cryptology; Jul2020, Vol. 33 Issue 3, p917-953, 37p

Correction: Locally Computable UOWHF with Linear Shrinkage.

Authors: Applebaum, Benny Moses, Yoni

Source: Journal of Cryptology; Apr2023, Vol. 36 Issue 2, p1-2, 2p

Cryptographic Primitives with Hinting Property.

Authors: Alamati, Navid Patranabis, Sikhar

Source: Journal of Cryptology; Sep2024, Vol. 37 Issue 3, p1-49, 49p

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.

Authors: Hazay, Carmit Ishai, Yuval Venkitasubramaniam, Muthuramakrishnan

Source: Journal of Cryptology; Jul2023, Vol. 36 Issue 3, p1-66, 66p

From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back.

Authors: Applebaum, Benny Raykov, Pavel

Source: Journal of Cryptology; Oct2017, Vol. 30 Issue 4, p961-988, 28p

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings.

Authors: Applebaum, Benny Raykov, Pavel

Source: Computational Complexity; Dec2019, Vol. 28 Issue 4, p573-616, 44p

Round-Optimal Secure Multi-party Computation.

Authors: Halevi, Shai Hazay, Carmit Polychroniadou, Antigoni et al.

Source: Journal of Cryptology; Jul2021, Vol. 34 Issue 3, p1-63, 63p

Arithmetic Cryptography.

Authors: APPLEBAUM, BENNY AVRON, JONATHAN BRZUSKA, CHRIS

Source: Journal of the ACM. Apr2017, Vol. 64 Issue 2, p10-74. 74p.

Fine-Grained Cryptography Revisited.

Authors: Egashira, Shohei Wang, Yuyu Tanaka, Keisuke

Source: Journal of Cryptology; Jul2021, Vol. 34 Issue 3, p1-3, 3p