Muthuramakrishnan Venkitasubramaniam, Ph.D.
Affiliations: | 2011 | Cornell University, Ithaca, NY, United States |
Area:
Computer ScienceGoogle:
"Muthuramakrishnan Venkitasubramaniam"Parents
Sign in to add mentorRafael Pass | grad student | 2011 | Cornell | |
(A universal framework for concurrent security.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Hazay C, Venkitasubramaniam M. (2016) What security can we achieve within 4 rounds? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9841: 486-505 |
Hazay C, Venkitasubramaniam M. (2016) On the power of secure two-party computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9815: 397-429 |
Hazay C, Venkitasubramaniam M. (2015) On black-box complexity of universally composable security in the CRS model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9453: 183-209 |
Pass R, Dustin Tseng WL, Venkitasubramaniam M. (2014) Concurrent zero knowledge, revisited Journal of Cryptology. 27: 45-66 |
Chung KM, Ostrovsky R, Pass R, et al. (2014) 4-round resettably-sound zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 192-216 |
Venkitasubramaniam M. (2014) On adaptively secure protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8642: 455-475 |
Pass R, Venkitasubramaniam M. (2012) A parallel repetition theorem for constant-round Arthur-Merlin Proofs Acm Transactions On Computation Theory. 4 |
Pass R, Lin H, Venkitasubramaniam M. (2012) A unified framework for UC from only OT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7658: 699-717 |
Pass R, Tseng WLD, Venkitasubramaniam M. (2011) Towards non-black-box lower bounds in cryptography Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6597: 579-596 |
Lin H, Pass R, Tseng WLD, et al. (2010) Concurrent non-malleable zero knowledge proofs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6223: 429-446 |