Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Manoj Prabhakaran
Resource Fairness and Composability of Cryptographic Protocols
Journal of Cryptology
Applied Mathematics
Computer Science Applications
Software
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Robust Pseudorandom Generators
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Exploring the Limits of Common Coins Using Frontier Analysis of Protocols
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Power of Public-Key Encryption in Secure Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Non-Interactive Secure Computation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Zero-One Law for Cryptographic Complexity With Respect to Computational UC Security
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Obfuscation-Based Non-Black-Box Simulation and Four Message Concurrent Zero Knowledge for NP
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Positive Results and Techniques for Obfuscation
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
1
2
›
