| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2012 | New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation | crypto | 443-460 |
| 2 | 2012 | Hardness Preserving Constructions of Pseudorandom Functions | tcc | 369-382 |
| 3 | 2012 | Counterexamples to Hardness Amplification beyond Negligible | tcc | 476-493 |
| 4 | 2012 | Concurrently Secure Computation in Constant Rounds | eurocrypt | 99-116 |
| 5 | 2012 | Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE | eurocrypt | 483-501 |
| 6 | 2011 | Leakage-Resilient Zero Knowledge | crypto | 293 |
| 7 | 2011 | Efficient Authentication from Hard Learning Problems | eurocrypt | 7 |
| 8 | 2011 | Parallel Repetition for Leakage Resilience Amplification Revisited | tcc | 58 |
| 9 | 2011 | Bringing People of Different Beliefs Together to do UC | tcc | 311 |
| 10 | 2010 | On the Round Complexity of Covert Computation | eprint | online |
| 11 | 2010 | Password-Authenticated Session-Key Generation on the Internet in the Plain Model | crypto | 277-294 |
Coauthors of Abhishek Jain |