Publications

August 2022 42nd Annual International Cryptology Conference, CRYPTO 2022
Practical Statistically-Sound Proofs of Exponentiation in Any Group
PDF Cite DOI
July 2022 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA
On the Distributed Discrete Logarithm Problem with Preprocessing
PDF Cite DOI
July 2022 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA
On the Distributed Discrete Logarithm Problem with Preprocessing
PDF Cite DOI
January 2021 Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Be’er Sheva, Israel, July 8-9, 2021, Proceedings
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies
PDF Cite DOI
January 2021 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia
On Search Complexity of Discrete Logarithm
PDF Cite DOI
January 2020 Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III
On Average-Case Hardness in TFNP from One-Way Functions
PDF Cite DOI
January 2020 SIAM J. Comput.
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
PDF Cite DOI
April 2019
An example preprint / working paper

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis posuere tellus ac convallis placerat. Proin tincidunt magna sed ex sollicitudin condimentum.
PDF Code Dataset Project Poster Slides Video Source Document Custom Link
January 2019 Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II
Stronger Lower Bounds for Online ORAM
PDF Cite DOI
January 2019 IACR Cryptol. ePrint Arch.
PPAD-Hardness via Iterated Squaring Modulo a Composite
PDF Cite
January 2019 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
PDF Cite DOI
January 2018 Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part III
Must the Communication Graph of MPC Protocols be an Expander?
PDF Cite DOI
January 2018 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic
ARRIVAL: Next Stop in CLS
PDF Cite DOI
January 2018 Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
PDF Cite DOI
January 2017 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA
The Journey from NP to TFNP Hardness
PDF Cite DOI
January 2017 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
PDF Cite DOI
January 2016 Theory Comput. Syst.
When Can Limited Randomness Be Used in Repeated Games?
PDF Cite DOI
January 2016 Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II
Rational Sumchecks
PDF Cite DOI
September 2015 Journal of Source Themes, 1(1)
An example journal article

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis posuere tellus ac convallis placerat. Proin tincidunt magna sed ex sollicitudin condimentum.
PDF Slides
January 2015 Algorithmic Game Theory - 8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28-30, 2015, Proceedings
When Can Limited Randomness Be Used in Repeated Games?
PDF Cite DOI
January 2015 Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11-13, 2015
On the Communication Complexity of Secure Function Evaluation with Long Output
PDF Cite DOI
January 2014 Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014
Rational arguments: single round delegation with sublinear verification
PDF Cite DOI
January 2014 ACM Conference on Economics and Computation, EC ‘14, Stanford , CA, USA, June 8-12, 2014
Cryptographically blinded games: leveraging players' limitations for equilibria and profit
PDF Cite DOI
July 2013 In STC
An example conference paper

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Duis posuere tellus ac convallis placerat. Proin tincidunt magna sed ex sollicitudin condimentum.
PDF Code Dataset Project Poster Slides Video Source Document Custom Link
January 2013 Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I
Limits on the Power of Cryptographic Cheap Talk
PDF Cite DOI