Processing math: 100%

Muthuramakrishnan Venkitasubramaniam
Contact
2313 Wegmans Hall
University of Rochester, Rochester, NY 14627
Mail: muthuv@cs.rochester.edu

I am an Associate Professor in the Department of Computer Science at University of Rochester. I got my Ph.D in the Computer Science Department at Cornell University under the supervision of Rafael Pass and spent a year as a CI Fellow at NYU and Columbia University. My research interests lie in cryptography, network security and complexity theory. My research is funded by the National Science Foundation and Google Faculty Research Award.

Teaching

PhD Students

  • Scott Ames (Graduated, 2019)
  • Mohammad H Faghihi (2016 - Present)
  • Laasya Bangalore (2018 - Present)

Postdoc

Program Committees

Recent Talks

Visitors

Publications: (click title for abstract)
 

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. (SBC 2020)
M. Chen, C. Hazay, Y. Ishai, Y. Kashnikov, D. Micciancio, T. Riviere, a. shelat, M. Venkitasubramaniam, R. Wang.

NEW
 

The Price of Active Security in Cryptographic Protocols. (EUROCRYPT 2020)
C. Hazay, M. Venkitasubramaniam, M. Weiss.

PDF NEW
 

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? (EUROCRYPT 2020)
C. Hazay, R. Pass, M. Venkitasubramaniam.

NEW
 

Going Beyond Dual Execution: MPC for Functions with Efficient Verification (PKC 2020)
C. Hazay, a. shelat, M. Venkitasubramaniam.

NEW
 

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland.
R. Pass, M. Venkitasubramaniam.

PDF NEW
 

LevioSA: Lightweight Secure Arithmetic Computation. (CCS 2019)
C. Hazay, Y. Ishai, A. Marcedone, M. Venkitasubramaniam.

NEW
 

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. (TCC 2018)
C. Hazay, M. Venkitasubramaniam.

PDF
 

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. (TCC 2018)
F. Benhamouda, H. Lin, A. Polychroniadou, M. Venkitasubramaniam.

 

Round-Optimal Secure Multi-Party Computation. (CRYPTO 2018)
S. Halevi, C. Hazay, A. Polychroniadou, M. Venkitasubramaniam.

PDF
 

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. (TCC 2017)
S. Kiyoshima, H. Lin, M. Venkitasubramaniam.

PDF
 

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. (TCC 2017)
C. Hazay, Y. Ishai, M. Venkitasubramaniam.

PDF
 

Ligero: Lightweight Sublinear Arguments without a Trusted Setup. (CCS 2017)
S. Ames, C. Hazay, Y. Ishai, M. Venkitasubramaniam.

 

Equivocating Yao: Constant-Rounds Adaptively Secure Multiparty Computation in the Plain Model. (STOC 2017)
R. Canetti, O. Poburinnaya, M. Venkitasubramaniam.
Invited to SIAM Journal of Computing, special issue for selected papers of STOC 2017.

PDF
 

Better Two-Round Adaptive Multi-Party Computation. (PKC 2017)
R. Canetti, O. Poburinnaya, M. Venkitasubramaniam.

PDF
 

Scalable Multi-Party Private Set-Intersection (PKC 2017)
C. Hazay, M. Venkitasubramaniam.

PDF
 

Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (PKC 2017)
C. Hazay, A. Polychroniadou, M. Venkitasubramaniam.

PDF
 

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions. (TCC 2016-B)
C. Hazay, M. Venkitasubramaniam.

PDF
 

Composable Security in the Tamper Proof Hardware Model under Minimal Complexity. (TCC 2016-B)
C. Hazay, A. Polychroniadou, M. Venkitasubramaniam.

PDF
 

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography (INDOCRYPT 2016)
D. Miller, A. Scrivener, J. Stern, M. Venkitasubramaniam.

PDF

 

On the Power of Two-Party Computation. (CRYPTO 2016)
C. Hazay, M. Venkitasubramaniam.

PDF

 

Privacy Enhancement for Interconnected Vehicles via Secure Multiparty Computation. (ITS World Congress 2016)
S. Markandeya, M. Venkitasubramaniam.

 

What Security Can We Achieve in 4-rounds. (SCN 2016)
C. Hazay, M. Venkitasubramaniam.

PDF
 

Secure Computation from Millionaires. (ASIACRYPT 2015)
a. shelat, M. Venkitasubramaniam

PDF
 

On the Black-Box Complexity of UC-Commitments. (ASIACRYPT 2015)
C. Hazay, M. Venkitasubramaniam.

PDF
 

Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way. (TCC 2015)
R. Ostrovsy, A. Scafuro, M. Venkitasubramaniam.

PDF
 

Concurrent Zero Knowledge, Revisited (Journal of Cryptology, 2014)
R. Pass, W. Tseng, M. Venkitasubramaniam.

PDF
 

Cloud-based Secure Health Monitoring: Optimizing Fully-Homomorphic Encryption for Streaming Algorithms (CCSNA 2014)
A. Page, O. Kocabas, S. Ames, M. Venkitasubramaniam, T. Soyata.

 

4-Round Resettably- Sound Zero Knowledge (TCC 2014)
K. Chung, R. Ostrovsky, R. Pass, M. Venkitasubramaniam, I. Visconti.

PDF
 

On Adaptively Secure Protocols (SCN 2014)
M. Venkitasubramaniam

PDF

Adaptive and Concurrent Secure Computation from New Adaptive, Non-Malleable Commitments (Asiacrypt 2013)
D. Dachman-Soled, T. Malkin, M. Raykova, M. Venkitasubramaniam.

PDF
 

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions (Asiacrypt 2012)
S. Ames, R. Gennaro, M. Venkitasubramaniam.

PDF
 

A Unified Framework for UC from Only OT (Asiacrypt 2012)
H. Lin, R. Pass, M. Venkitasubramaniam.

PDF
 

Towards Non-Black-Box Lower Bounds in Cryptography (TCC 2011)
R. Pass, Wei-Lung D. Tseng, M. Venkitasubramaniam.

PDF
 

Concurrent Non-Malleable Zero Knowledge Proofs (CRYPTO 2010)
H. Lin, R. Pass, Wei-Lung D. Tseng, M. Venkitasubramaniam.

PDF
 

Eye for an Eye: On Concurrent Zero-Knowledge in the Timing Model. (TCC 2010)
R. Pass, Wei-Lung D. Tseng, M. Venkitasubramaniam.

PDF
 

Private Coins versus Public Coins in Zero-Knowledge Proof Systems. (TCC 2010)
R. Pass, M. Venkitasubramaniam.

PDF
 

A Unified Framework for Concurrent Security: Universal Composability from Stand-alone Non-malleability. (STOC 2009)
H. Lin, R. Pass and M. Venkitasubramaniam.

PDF
 

Precise Concurrent Zero Knowledge. (EUROCRYPT 2008)
O. Pandey, R. Pass, A. Sahai, W. Tseng and M. Venkitasubramaniam.

PDF
 

On Constant-Round Concurrent Zero-Knowledge. (TCC 2008)
R. Pass, M. Venkitasubramaniam.

PDF
 

Concurrent Non-Malleable Commitments from One-way Functions (TCC 2008)
H. Lin, R. Pass, M. Venkitasubramaniam.

PDF
 

An Efficient Parallel Repetition Theorem for Arthur-Merlin Games. (STOC 2007)
R. Pass, A. M. Venkitasubramaniam.

PDF
 

l-Diversity: Privacy Beyond k-Anonymity. (TKDD 2007)
A. Machanavajjhala, D. Kifer, J.Gehrke and M. Venkitasubramaniam.

PDF
 

l-Diversity: Privacy Beyond k-Anonymity. (ICDE 2006)
A. Machanavajjhala, J.Gehrke, D. Kifer and M. Venkitasubramaniam.
Winner of the IEEE ICDE Influential Paper 2017

PDF
 

Trusted CVS. (STD3S - ICDE Workshops)
M. Venkitasubramaniam, A. Machanavajjhala, D. Martin and J. Gehrke.

PDF
 

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. (DISC 2004)
D. V. S. Ravikant, M. Venkitasubramaniam, V. Srikanth, K. Srinathan and C. P. Rangan.

PDF
 

Brief announcement: On the round complexity of distributed consensus over synchronous networks. (PODC 2004)
D. V. S. Ravikant, M. Venkitasubramaniam, V. Srikanth, K. Srinathan and C. P. Rangan.

PDF

This material is based upon work supported by the National Science Foundation and Google. Any opinions, findings, and conclusions or recommendations expressed in these publications are those of the author(s) and do not necessarily reflect the views of the National Science Foundation and Google.