Brief announcement: on the round complexity of distributed consensus over synchronous networks. - D. V. S. Ravikant; Muthuramakrishnan Venkitasubramaniam; V. Srikanth; K. Srinathan 001; C. Pandu Rangan (PODC, 2004)

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. - D. V. S. Ravikant; Muthuramakrishnan Venkitasubramaniam; V. Srikanth; K. Srinathan 001; C. Pandu Rangan (DISC, 2004)

l-Diversity: Privacy Beyond k-Anonymity. - Ashwin Machanavajjhala; Johannes Gehrke; Daniel Kifer; Muthuramakrishnan Venkitasubramaniam (ICDE, 2006)

Trusted CVS. - Muthuramakrishnan Venkitasubramaniam; Ashwin Machanavajjhala; David J. Martin 001; Johannes Gehrke (ICDE Workshops, 2006)

An efficient parallel repetition theorem for Arthur-Merlin games. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (STOC, 2007)

Precise Concurrent Zero Knowledge. - Omkant Pandey; Rafael Pass; Amit Sahai; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2007)

L-diversity: Privacy beyond k-anonymity. - Ashwin Machanavajjhala; Daniel Kifer; Johannes Gehrke; Muthuramakrishnan Venkitasubramaniam (ACM Trans. Knowl. Discov. Data, 2007)

Concurrent Non-malleable Commitments from Any One-Way Function. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2008)

On Constant-Round Concurrent Zero-Knowledge. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2008)

A unified framework for concurrent security: universal composability from stand-alone non-malleability. - Huijia Lin; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (STOC, 2009)

Concurrent Non-Malleable Zero Knowledge Proofs. - Huijia Lin; Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (CRYPTO, 2010)

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (TCC, 2010)

Private Coins versus Public Coins in Zero-Knowledge Proof Systems. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (TCC, 2010)

Towards Non-Black-Box Lower Bounds in Cryptography. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (TCC, 2011)

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability. - Dana Dachman-Soled; Tal Malkin; Mariana Raykova 001; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2011)

Unified Framework for Concurrent Security. - Muthuramakrishnan Venkitasubramaniam (2011)

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions. - Scott Ames; Rosario Gennaro; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT, 2012)

A Unified Framework for UC from Only OT. - Rafael Pass; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT, 2012)

A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (ACM Trans. Comput. Theory, 2012)

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. - Dana Dachman-Soled; Tal Malkin; Mariana Raykova 001; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT (1), 2013)

Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms. - Alex Page; Övünç Kocabas; Scott Ames; Muthuramakrishnan Venkitasubramaniam; Tolga Soyata (GLOBECOM Workshops, 2014)

On Adaptively Secure Protocols. - Muthuramakrishnan Venkitasubramaniam (SCN, 2014)

4-Round Resettably-Sound Zero Knowledge. - Kai-Min Chung; Rafail Ostrovsky; Rafael Pass; Muthuramakrishnan Venkitasubramaniam; Ivan Visconti (TCC, 2014)

Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way. - Rafail Ostrovsky; Alessandra Scafuro; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2014)

Concurrent Zero Knowledge, Revisited. - Rafael Pass; Wei-Lung Dustin Tseng; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2014)

Secure Computation from Millionaire. - Abhi Shelat; Muthuramakrishnan Venkitasubramaniam (ASIACRYPT (1), 2015)

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. - Rafail Ostrovsky; Alessandra Scafuro; Muthuramakrishnan Venkitasubramaniam (TCC (1), 2015)

Round-Optimal Token-Based Secure Computation. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2015)

What Security can we Achieve in 4-Rounds? - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2015)

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (TCC (B1), 2016)

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2016)

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography. - Douglas Miller; Adam Scrivener; Jesse Stern; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2016)

Better Two-Round Adaptive Multi-party Computation. - Ran Canetti; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam (Public Key Cryptography (2), 2017)

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. - Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

Scalable Multi-Party Private Set-Intersection. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models. - Susumu Kiyoshima; Huijia Lin; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2017)

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. - Fabrice Benhamouda; Huijia Lin; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (TCC (1), 2018)

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation. - Siddharth Garg; Zahra Ghodsi; Carmit Hazay; Yuval Ishai; Antonio Marcedone; Muthuramakrishnan Venkitasubramaniam (CoRR, 2018)

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2018)

A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2019)

On Black-Box Complexity of Universally Composable Security in the CRS Model. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2019)

What Security Can We Achieve Within 4 Rounds? - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2019)

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC. - Jackson Abascal; Mohammad Hossein Faghihi Sereshgi; Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (CCS, 2020)

Ligero++: A New Optimized Sublinear IOP. - Rishabh Bhadauria; Zhiyong Fang; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Tiancheng Xie; Yupeng Zhang 001 (CCS, 2020)

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? - Carmit Hazay; Rafael Pass; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (3), 2020)

Is it Easier to Prove Theorems that are Guaranteed to be True? - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (Electron. Colloquium Comput. Complex., 2020)

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. - Megan Chen; Carmit Hazay; Yuval Ishai; Yuriy Kashnikov; Daniele Micciancio; Tarik Riviere; Abhi Shelat; Muthuramakrishnan Venkitasubramaniam; Ruihan Wang (IACR Cryptol. ePrint Arch., 2020)

LevioSA: Lightweight Secure Arithmetic Computation. - Carmit Hazay; Yuval Ishai; Antonio Marcedone; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2020)

Going Beyond Dual Execution: MPC for Functions with Efficient Verification. - Carmit Hazay; Abhi Shelat; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2020)

On the Power of Secure Two-Party Computation. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2020)

Round-Optimal Secure Multi-party Computation. - Shai Halevi; Carmit Hazay; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2021)

Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles. - Rafael Pass; Muthuramakrishnan Venkitasubramaniam (SIGACT News, 2021)

Adaptively Secure Computation for RAM Programs. - Laasya Bangalore; Rafail Ostrovsky; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (2), 2022)

Asymptotically Quasi-Optimal Cryptography. - Leo de Castro; Carmit Hazay; Yuval Ishai; Vinod Vaikuntanathan; Muthuramakrishnan Venkitasubramaniam (EUROCRYPT (1), 2022)

On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. - Laasya Bangalore; Rishabh Bhadauria; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2022)

Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (IACR Cryptol. ePrint Arch., 2022)

ZK-PCPs from Leakage-Resilient Secret Sharing. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2022)

Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model. - Ran Canetti; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam (SIAM J. Comput., 2022)

Flag: A Framework for Lightweight Robust Secure Aggregation. - Laasya Bangalore; Mohammad Hossein Faghihi Sereshgi; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (AsiaCCS, 2023)

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem. - Anasuya Acharya; Carmit Hazay; Oxana Poburinnaya; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

Can Alice and Bob Guarantee Output to Carol? - Bar Alon; Eran Omri; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

Private Polynomial Commitments and Applications to MPC. - Rishabh Bhadauria; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Wenxuan Wu; Yupeng Zhang 001 (IACR Cryptol. ePrint Arch., 2023)

Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (IACR Cryptol. ePrint Arch., 2023)

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. - Yibin Yang 001; David Heath; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. - Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (J. Cryptol., 2023)

Ligero: lightweight sublinear arguments without a trusted setup. - Scott Ames; Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (Des. Codes Cryptogr., 2023)

sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (ASIACRYPT (5), 2024)

Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser. - Ruihan Wang; Carmit Hazay; Muthuramakrishnan Venkitasubramaniam (SP, 2024)

PRIME: Differentially Private Distributed Mean Estimation with Malicious Security. - Laasya Bangalore; Albert Cheu; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2024)

LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. - Carmit Hazay; David Heath; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam; Yibin Yang 001 (IACR Cryptol. ePrint Arch., 2024)

SCIF: Privacy-Preserving Statistics Collection with Input Validation and Full Security. - Jianan Su; Laasya Bangalore; Harel Berger; Jason Yi; Alivia Castor; Micah Sherr; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2024)

Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. - Yibin Yang 001; David Heath; Carmit Hazay; Vladimir Kolesnikov; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2024)

The Price of Active Security in Cryptographic Protocols. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2024)

SCIF: Privacy-Preserving Statistics Collection with Input Validation and Full Security. - Jianan Su; Laasya Bangalore; Harel Berger; Jason Yi; Sophia Castor; Micah Sherr; Muthuramakrishnan Venkitasubramaniam (Proc. Priv. Enhancing Technol., 2025)

Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more. - Carmit Hazay; Muthuramakrishnan Venkitasubramaniam; Mor Weiss (J. Cryptol., 2025)