Skip to main content

Cryptography with Low Complexity

Searching for OpenAIRE data...

Publications

The Communication Complexity of Private Simultaneous Messages, Revisited

Author(s): Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz
Published in: 2018, Page(s) 261-286
DOI: 10.1007/978-3-319-78375-8_9

Low-Complexity Cryptographic Hash Functions

Author(s): Applebaum, Benny ; Haramaty-Krasne, Naama ; Ishai, Yuval ; Kushilevitz, Eyal ; Vaikuntanathan, Vinod
Published in: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017, Page(s) 7:1--7:31
DOI: 10.4230/LIPIcs.ITCS.2017.7

Algebraic attacks against random local functions and their countermeasures

Author(s): Benny Applebaum, Shachar Lovett
Published in: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016, 2016, Page(s) 1087-1100
DOI: 10.1145/2897518.2897554

Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations

Author(s): Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan
Published in: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Page(s) 727-757
DOI: 10.1007/978-3-319-63688-7_24

Exponentially-Hard Gap-CSP and Local PRG via Local Hardcore Functions

Author(s): Benny Applebaum
Published in: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, Page(s) 836-847
DOI: 10.1109/focs.2017.82

Secure Arithmetic Computation with Constant Computational Overhead

Author(s): Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Published in: Annual International Cryptology Conference CRYPTO 2017: Advances in Cryptology – CRYPTO 2017, 2017, Page(s) 223-254
DOI: 10.1007/978-3-319-63688-7_8

Algebraic Attacks against Random Local Functions and Their Countermeasures

Author(s): Benny Applebaum, Shachar Lovett
Published in: SIAM Journal on Computing, Issue 47/1, 2018, Page(s) 52-79, ISSN 0097-5397
DOI: 10.1137/16M1085942

Cryptographic Hardness of Random Local Functions

Author(s): Benny Applebaum
Published in: computational complexity, Issue 25/3, 2016, Page(s) 667-722, ISSN 1016-3328
DOI: 10.1007/s00037-015-0121-8

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

Author(s): Benny Applebaum, Pavel Raykov
Published in: Journal of Cryptology, 2016, ISSN 0933-2790
DOI: 10.1007/s00145-016-9239-3

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions

Author(s): Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang
Published in: computational complexity, Issue 25/2, 2016, Page(s) 349-418, ISSN 1016-3328
DOI: 10.1007/s00037-016-0128-9

Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings

Author(s): Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
Published in: Journal of Cryptology, 2016, ISSN 0933-2790
DOI: 10.1007/s00145-016-9244-6

Arithmetic Cryptography

Author(s): Benny Applebaum, Jonathan Avron, Chris Brzuska
Published in: Journal of the ACM, Issue 64/2, 2017, Page(s) 1-74, ISSN 0004-5411
DOI: 10.1145/3046675

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

Author(s): Benny Applebaum, Pavel Raykov
Published in: Advances in Cryptology – CRYPTO 2016, 2016, Page(s) 449-477
DOI: 10.1007/978-3-662-53015-3_16

Fast Pseudorandom Functions Based on Expander Graphs

Author(s): Benny Applebaum, Pavel Raykov
Published in: Theory of Cryptography, 2016, Page(s) 27-56
DOI: 10.1007/978-3-662-53641-4_2

Garbled Circuits as Randomized Encodings of Functions: a Primer

Author(s): Benny Applebaum
Published in: Tutorials on the Foundations of Cryptography, 2017, Page(s) 1-44
DOI: 10.1007/978-3-319-57048-8_1