All reports by Author Hemanta Maji:

__
TR14-069
| 5th May 2014
__

Shashank Agrawal, Divya Gupta, Hemanta Maji, Omkant Pandey, Manoj Prabhakaran#### Explicit Non-Malleable Codes Resistant to Permutations

__
TR13-137
| 29th September 2013
__

Mohammad Mahmoody, Hemanta Maji, Manoj Prabhakaran#### On the Power of Public-key Encryption in Secure Computation

__
TR12-065
| 16th May 2012
__

Mohammad Mahmoody, Hemanta Maji, Manoj Prabhakaran#### Limits of Random Oracles in Secure Computation

Revisions: 2

__
TR09-123
| 23rd November 2009
__

Hemanta Maji, Manoj Prabhakaran, Mike Rosulek#### Cryptographic Complexity Classes and Computational Intractability Assumptions

Shashank Agrawal, Divya Gupta, Hemanta Maji, Omkant Pandey, Manoj Prabhakaran

The notion of non-malleable codes was introduced as a relaxation of standard error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value.

In the information theoretic setting, although existence of such codes for various ... more >>>

Mohammad Mahmoody, Hemanta Maji, Manoj Prabhakaran

We qualitatively separate semi-honest secure computation of non-trivial secure-function evaluation (SFE) functionalities from existence of key-agreement protocols.

Technically, we show the existence of an oracle (namely, PKE-oracle) relative to which key-agreement protocols exist; but it is useless for semi-honest secure realization of symmetric 2-party (deterministic finite) SFE functionalities, i.e. any ...
more >>>

Mohammad Mahmoody, Hemanta Maji, Manoj Prabhakaran

The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme cannot be constructed using one-way functions as the sole source of computational hardness. In addition, this implied a black-box separation between one-way functions and protocols for ... more >>>

Hemanta Maji, Manoj Prabhakaran, Mike Rosulek

Which computational intractability assumptions are inherent to cryptography? We present a broad framework to pose and investigate this question.

We first aim to understand the “cryptographic complexity” of various tasks, independent of any computational assumptions. In our framework the cryptographic tasks are modeled as multi- party computation functionalities. We consider ...
more >>>