Mohammad Mahmoody

IACR Cryptol. ePrint Arch., 2023

Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Lower Bounds on Assumptions Behind Registration-Based Encryption.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Black-Box Separations for Non-interactive Classical Commitments in a Quantum World.

[BibT_eX]

[DOI]

Kai-Min Chung

Yao-Ting Lin

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Online Mergers and Applications to Registration-Based Encryption and Accumulators.

[BibT_eX]

[DOI]

Wei Qi

Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

2022

Deletion inference, reconstruction, and compliance in machine (un)learning.

[BibT_eX]

[DOI]

Ji Gao

Sanjam Garg

Prashant Nalini Vasudevan

Proc. Priv. Enhancing Technol., 2022

Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption.

[BibT_eX]

[DOI]

Wei Qi

Ahmadreza Rahimi

IACR Cryptol. ePrint Arch., 2022

On the Impossibility of Key Agreements from Quantum Random Oracles.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Overparameterized (robust) models from computational constraints.

[BibT_eX]

[DOI]

CoRR, 2022

On Optimal Learning Under Targeted Data Poisoning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Overparameterization from Computational Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Polynomial-time targeted attacks on coin tossing for any number of corruptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Black-Box Uselessness: Composing Separations in Cryptography.

[BibT_eX]

[DOI]

Geoffroy Couteau

Pooya Farshim

IACR Cryptol. ePrint Arch., 2021

NeuraCrypt is not private.

[BibT_eX]

[DOI]

CoRR, 2021

Learning and certification under instance-targeted poisoning.

[BibT_eX]

[DOI]

Ji Gao

Amin Karbasi

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Is Private Learning Possible with Instance Encoding?

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks.

[BibT_eX]

[DOI]

Abhradeep Guha Thakurta

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

An Attack on InstaHide: Is Private Learning Possible with Instance Encoding?

[BibT_eX]

[DOI]

CoRR, 2020

Obliviousness Makes Poisoning Adversaries Weaker.

[BibT_eX]

[DOI]

CoRR, 2020

Learning under p-tampering poisoning attacks.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2020

Computational Concentration of Measure: Optimal Bounds, Reductions, and More.

[BibT_eX]

[DOI]

Omid Etesami

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Lower Bounds for Adversarially Robust PAC Learning.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2020

Lower Bounds for Adversarially Robust PAC Learning under Evasion and Hybrid Attacks.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE International Conference on Machine Learning and Applications, 2020

Can Verifiable Delay Functions Be Based on Random Oracles?

[BibT_eX]

[DOI]

Caleb Smith

David J. Wu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Adversarially Robust Learning Could Leverage Computational Hardness.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

2019

A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model.

[BibT_eX]

[DOI]

Caleb Smith

David J. Wu

IACR Cryptol. ePrint Arch., 2019

Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Data Poisoning Attacks in Multi-Party Learning.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Can Adversarially Robust Learning LeverageComputational Hardness?

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2019

The Curse of Concentration in Robust Learning: Evasion and Poisoning Attacks from Concentration of Measure.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Multi-party Poisoning through Generalized p-Tampering.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption: Removing Private-Key Generator from IBE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Limits on the Power of Garbling Techniques for Public-Key Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Optimizing Trees for Static Searchable Encryption.

[BibT_eX]

[DOI]

Mohammad Etemad

David Evans

IACR Cryptol. ePrint Arch., 2018

Can Adversarially Robust Learning Leverage Computational Hardness?

[BibT_eX]

[DOI]

CoRR, 2018

Adversarial Risk and Robustness: General Definitions and Implications for the Uniform Distribution.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning under $p$-Tampering Attacks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2018

2017

Merkle's Key Agreement Protocol is Optimal: An O(n2) Attack on Any Key Agreement from Random Oracles.

[BibT_eX]

[DOI]

J. Cryptol., 2017

Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

On the Round Complexity of OT Extension.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

When does Functional Encryption Imply Obfuscation?

[BibT_eX]

[DOI]

Sanjam Garg

IACR Cryptol. ePrint Arch., 2017

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives.

[BibT_eX]

[DOI]

Sanjam Garg

IACR Cryptol. ePrint Arch., 2017

On the Impossibility of Cryptography with Tamperable Randomness.

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

A Note on Black-Box Complexity of Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models.

[BibT_eX]

[DOI]

Soheil Nematihaji

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

2015

Lower Bounds on Assumptions behind Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

More on Impossibility of Virtual Black-Box Obfuscation in Idealized Models.

[BibT_eX]

[DOI]

Soheil Nematihaji

IACR Cryptol. ePrint Arch., 2015

On the Power of Hierarchical Identity-Based Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

[BibT_eX]

[DOI]

Dana Dachman-Soled

Tal Malkin

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

On the Power of Public-key Encryption in Secure Computation.

[BibT_eX]

[DOI]

Hemanta K. Maji

Manoj Prabhakaran

Electron. Colloquium Comput. Complex., 2013

Publicly verifiable proofs of sequential work.

[BibT_eX]

[DOI]

Tal Moran

Salil P. Vadhan

Proceedings of the Innovations in Theoretical Computer Science, 2013

On the power of nonuniformity in proofs of security.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Languages with Efficient Zero-Knowledge PCP's are in SZK.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

The Curious Case of Non-Interactive Commitments.

[BibT_eX]

[DOI]

Rafael Pass

IACR Cryptol. ePrint Arch., 2012

Unprovable Security of Two-Message Zero Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Languages with Efficient Zero-Knowledge PCPs are in SZK.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Limits of Random Oracles in Secure Computation.

[BibT_eX]

[DOI]

Hemanta K. Maji

Manoj Prabhakaran

Electron. Colloquium Comput. Complex., 2012

On Efficient Zero-Knowledge PCPs.

[BibT_eX]

[DOI]

Yuval Ishai

Amit Sahai

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

On Black-Box Reductions between Predicate Encryption Schemes.

[BibT_eX]

[DOI]

Vipul Goyal

Virendra Kumar

Satyanarayana V. Lokam

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

The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives.

[BibT_eX]

[DOI]

Rafael Pass

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

Non-Interactive Time-Stamping and Proofs of Work in the Random Oracle Model.

[BibT_eX]

[DOI]

Tal Moran

Salil P. Vadhan

IACR Cryptol. ePrint Arch., 2011

On the Black-Box Complexity of Optimally-Fair Coin Tossing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Time-Lock Puzzles in the Random Oracle Model.

[BibT_eX]

[DOI]

Tal Moran

Salil P. Vadhan

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP.

[BibT_eX]

[DOI]

Iftach Haitner

Electron. Colloquium Comput. Complex., 2010

Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

2009

On the Power of Randomized Reductions and the Checkability of SAT.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2009

Merkle Puzzles Are Optimal - An O(n2)-Query Attack on Any Key Exchange from a Random Oracle.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Lower Bounds on Signatures From Symmetric Primitives.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Merkle Puzzles are Optimal.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Load sensitive topology control: Towards minimum energy consumption in dense ad hoc sensor networks.

[BibT_eX]

[DOI]

Amir Nayyeri

Sajjad Zarifzadeh

Nasser Yazdani