Mohammad Mahmoody

نویسنده

  • Mohammad Mahmoody
چکیده

Cryptography is the science of secure computation and communication. The scope of cryptosystems, nowadays, ranges from private-key encryption and authentication to more complex systems such as publickey encryption, electronic voting, secure multi-party computation on large data sets, etc. My specialization is in foundations of cryptography, a field that aims at designing cryptographic protocols with provable security, and computational complexity theory which provides the framework for such studies. My research has significantly improved our understanding of the assumptions behind the way modern cryptosystems are modeled and proved to be secure. Cryptographic assumptions exist in two forms:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Black-Box Separations for Indistinguishability Obfuscation

Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a black-box way is as hard as basing public-key cryptography on one-way functions. The list included any primitive P that could be realized relative to random trapdoor permutation or degree-O(1) graded encoding oracle models in a secure way against computationally unbounded pol...

متن کامل

A Note on Black-Box Complexity of Indistinguishability Obfuscation

Mahmoody et al. (TCC 2016-A) showed that basing indistinguishability obfuscation (IO) on a wide range of primitives in a semi-black-box way is as hard as basing public-key cryptography on one-way functions. The list included any primitive P that can be realized relative to random trapdoor permutations or degree-O(1) graded encoding model for any finite ring secure against computationally unboun...

متن کامل

Merkle Puzzles are Optimal

We prove that every key exchange protocol in the random oracle model in which the honest users make at most n queries to the oracle can be broken by an adversary making O(n) queries to the oracle. This improves on the previous Ω̃(n) query attack given by Impagliazzo and Rudich (STOC ’89). Our bound is optimal up to a constant factor since Merkle (CACM ’78) gave an n query key exchange protocol i...

متن کامل

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

We prove that every key exchange protocol in the random oracle model in which the honest users make at most n queries to the oracle can be broken by an adversary making O(n) queries to the oracle. This improves on the previous Ω̃(n) query attack given by Impagliazzo and Rudich (STOC ’89), and answers an open question posed by them. Our bound is optimal up to a constant factor since Merkle (CACM ...

متن کامل

Learning under p-Tampering Attacks

Recently, Mahloujifar and Mahmoody (TCC’17) studied attacks against learning algorithms using a special case of Valiant’s malicious noise, called p-tampering, in which the adversary gets to change any training example with independent probability p but is limited to only choose ‘adversarial’ examples with correct labels. They obtained p-tampering attacks that increase the error probability in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013