Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

56

ICS
2010
Tsinghua U.

favoriteEmaildiscussreport

153views Distributed And Parallel Com...» more ICS 2010»

Cryptographic Complexity Classes and Computational Intractability Assumptions

15 years 6 months ago

Cryptographic Complexity Classes and Computational Intractability Assumptions

Download www.cs.umt.edu

Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Real-time Traffic

ICS 2010 | Theoritical Computer Science |

claim paper

Related Content

» Robustness of the Learning with Errors Assumption

» On Cryptographic Assumptions and Challenges

» Secure Arithmetic Computation with No Honest Majority

» On the complexity of communication complexity

» Computationally Private Information Retrieval with Polylogarithmic Communication

» The Intractability of Computing the Hamming Distance

» On the Limitations of Universally Composable TwoParty Computation without Setup Assumption...

» Succinct NP Proofs from an Extractability Assumption

» On the complexity of query answering over incomplete XML documents

Post Info
More Details (n/a)

Added	02 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	ICS
Authors	Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek

Comments (0)