Benny Applebaum

Barak Arkis

Electron. Colloquium Comput. Complex., 2017

Garbled Circuits as Randomized Encodings of Functions: a Primer.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Low-Complexity Cryptographic Hash Functions .

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

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

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Secure Arithmetic Computation with Constant Computational Overhead.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

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

[BibT_eX]

[DOI]

Barak Arkis

Prashant Nalini Vasudevan

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Garbled Circuits as Randomized Encodings of Functions: a Primer.

[BibT_eX]

[DOI]

Proceedings of the Tutorials on the Foundations of Cryptography., 2017

2016

Clique Here: On the Distributed Complexity in Fully-Connected Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2016

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

[BibT_eX]

[DOI]

Comput. Complex., 2016

Fast Pseudorandom Functions Based on Expander Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

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

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Algebraic attacks against random local functions and their countermeasures.

[BibT_eX]

[DOI]

Shachar Lovett

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

Arithmetic Cryptography.

[BibT_eX]

[DOI]

Jonathan Avron

Christina Brzuska

Electron. Colloquium Comput. Complex., 2015

Obfuscating Circuits via Composite-Order Graded Encoding.

[BibT_eX]

[DOI]

Zvika Brakerski

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Deterministic Rateless Codes for BSC.

[BibT_eX]

[DOI]

Liron David

Guy Even

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Arithmetic Cryptography: Extended Abstract.

[BibT_eX]

[DOI]

Jonathan Avron

Christina Brzuska

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Cryptography in Constant Parallel Time.

[BibT_eX]

[DOI]

Information Security and Cryptography, Springer, ISBN: 978-3-642-17367-7, 2014

Related-Key Secure Pseudorandom Functions: The Case of Additive Attacks.

[BibT_eX]

[DOI]

Eyal Widder

IACR Cryptol. ePrint Arch., 2014

Bootstrapping Obfuscators via Fast Pseudorandom Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Cryptographic Hardness of Random Local Functions-Survey.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Garbling XOR Gates "For Free" in the Standard Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Locally Computable UOWHF with Linear Shrinkage.

[BibT_eX]

[DOI]

Yoni Moses

Proceedings of the Advances in Cryptology, 2013

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A Dichotomy for Local Small-Bias Generators.

[BibT_eX]

[DOI]

Andrej Bogdanov

Alon Rosen

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Pseudorandom generators with long stretch and low locality from random local one-way functions.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Semantic Security under Related-Key Attacks and Applications.

[BibT_eX]

[DOI]

Danny Harnik

Proceedings of the Innovations in Computer Science, 2011

Randomly Encoding Functions: A New Cryptographic Paradigm - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

How to Garble Arithmetic Circuits.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Key-Dependent Message Security: Generic Amplification and Completeness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

2010

Public-key cryptography from different assumptions.

[BibT_eX]

[DOI]

Boaz Barak

Avi Wigderson

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Collaborative, Privacy-Preserving Data Aggregation at Scale.

[BibT_eX]

[DOI]

Proceedings of the Privacy Enhancing Technologies, 10th International Symposium, 2010

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

From Secrecy to Soundness: Efficient Verification via Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

On Basing Lower-Bounds for Learning on Worst-Case Assumptions.

[BibT_eX]

[DOI]

Boaz Barak

David Xiao

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Cryptography in constant parallel time.

[BibT_eX]

[DOI]

PhD thesis, 2007

Cryptography with Constant Input Locality.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2007

2006

On Pseudorandom Generators with Linear Stretch in NC0.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

Computationally Private Randomizing Polynomials and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Cryptography in NC0.

[BibT_eX]

[DOI]