☰

Muthuramakrishnan Venkitasubramaniam, Ph.D. - Publications

Affiliations: 
2011 Cornell University, Ithaca, NY, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

18 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Hazay C, Venkitasubramaniam M. 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. DOI: 10.1007/S00145-019-09323-1  0.451
2016 Hazay C, Venkitasubramaniam M. 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. DOI: 10.1007/S00145-019-09314-2  0.48
2015 Hazay C, Venkitasubramaniam M. 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. DOI: 10.1007/S00145-019-09326-Y  0.437
2014 Pass R, Dustin Tseng WL, Venkitasubramaniam M. Concurrent zero knowledge, revisited Journal of Cryptology. 27: 45-66. DOI: 10.1007/S00145-012-9137-2  0.55
2014 Chung KM, Ostrovsky R, Pass R, Venkitasubramaniam M, Visconti I. 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. DOI: 10.1007/978-3-642-54242-8_9  0.579
2014 Venkitasubramaniam M. On adaptively secure protocols Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8642: 455-475.  0.349
2012 Pass R, Venkitasubramaniam M. A parallel repetition theorem for constant-round Arthur-Merlin Proofs Acm Transactions On Computation Theory. 4. DOI: 10.1145/2382559.2382561  0.58
2012 Pass R, Lin H, Venkitasubramaniam M. 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. DOI: 10.1007/978-3-642-34961-4_42  0.572
2011 Pass R, Tseng WLD, Venkitasubramaniam M. 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. DOI: 10.1007/978-3-642-19571-6_35  0.561
2010 Lin H, Pass R, Tseng WLD, Venkitasubramaniam M. 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. DOI: 10.1007/978-3-642-14623-7_23  0.6
2010 Pass R, Venkitasubramaniam M. Private coins versus public coins in zero-knowledge proof systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5978: 588-605. DOI: 10.1007/978-3-642-11799-2_35  0.521
2010 Pass R, Tseng WLD, Venkitasubramaniam M. Eye for an eye: Efficient concurrent zero-knowledge in the timing model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5978: 518-534. DOI: 10.1007/978-3-642-11799-2_31  0.537
2009 Lin H, Pass R, Venkitasubramaniam M. A unified framework for concurrent security: Universal composability from stand-alone non-malleability Proceedings of the Annual Acm Symposium On Theory of Computing. 179-188. DOI: 10.1145/1536414.1536441  0.542
2008 Pandey O, Pass R, Sahai A, Tseng WLD, Venkitasubramaniam M. Precise concurrent zero knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4965: 397-414. DOI: 10.1007/978-3-540-78967-3_23  0.601
2008 Lin H, Pass R, Venkitasubramaniam M. Concurrent non-malleable commitments from any one-way function Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4948: 571-588. DOI: 10.1007/978-3-540-78524-8_31  0.578
2008 Pass R, Venkitasubramaniam M. On constant-round concurrent zero-knowledge Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4948: 553-570. DOI: 10.1007/978-3-540-78524-8_30  0.562
2007 Pass R, Venkitasubramaniam M. An efficient parallel repetition theorem for Arthur-Merlin games Proceedings of the Annual Acm Symposium On Theory of Computing. 420-429. DOI: 10.1145/1250790.1250853  0.54
2007 Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M. ℓ-diversity: Privacy beyond k-anonymity Acm Transactions On Knowledge Discovery From Data. 1. DOI: 10.1145/1217299.1217302  0.326
Show low-probability matches.