Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > INTRACTABILITY ASSUMPTIONS:
Reports tagged with intractability assumptions:
TR09-123 | 23rd November 2009
Hemanta Maji, Manoj Prabhakaran, Mike Rosulek

Cryptographic Complexity Classes and Computational Intractability Assumptions

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 >>>




ISSN 1433-8092 | Imprint