Muthuramakrishnan Venkitasubramaniam
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
59
Venues
15
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
59 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CRYPTO | Lower Bounds on Black-Box Constructions of Pseudorandom Functions. | Bar Alon, Itai Dinur, Muthuramakrishnan Venkitasubramaniam |
| 2025 | TCC | On Achieving "Best-in-the-Multiverse" MPC. | Anasuya Acharya, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2024 | ASIACRYPT | sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK. | Carmit Hazay, David Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam, Yibin Yang |
| 2024 | CCS | Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction. | Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam |
| 2024 | EuroCrypt | Can Alice and Bob Guarantee Output to Carol? | Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam |
| 2024 | SP | Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser. | Ruihan Wang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2023 | AsiaCCS | Flag: A Framework for Lightweight Robust Secure Aggregation. | Laasya Bangalore, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2023 | CCS | Batchman and Robin: Batched and Non-batched Branching for Interactive ZK. | Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam |
| 2023 | CRYPTO | Best of Both Worlds - Revisiting the Spymasters Double Agent Problem. | Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam |
| 2023 | PKC | Private Polynomial Commitments and Applications to MPC. | Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang |
| 2023 | TCC | Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
| 2023 | TCC | Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
| 2022 | EuroCrypt | Adaptively Secure Computation for RAM Programs. | Laasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam |
| 2022 | EuroCrypt | Asymptotically Quasi-Optimal Cryptography. | Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthuramakrishnan Venkitasubramaniam |
| 2022 | TCC | On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. | Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2021 | SP | 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 |
| 2020 | CCS | 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 |
| 2020 | CCS | Ligero++: A New Optimized Sublinear IOP. | Rishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Tiancheng Xie, Yupeng Zhang |
| 2020 | EuroCrypt | Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? | Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2020 | EuroCrypt | The Price of Active Security in Cryptographic Protocols. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss |
| 2020 | FOCS | Is it Easier to Prove Theorems that are Guaranteed to be True? | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2020 | PKC | Going Beyond Dual Execution: MPC for Functions with Efficient Verification. | Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam |
| 2019 | CCS | LevioSA: Lightweight Secure Arithmetic Computation. | Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam |
| 2018 | CRYPTO | Round-Optimal Secure Multi-Party Computation. | Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2018 | TCC | Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. | Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2018 | TCC | Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2017 | CCS | Ligero: Lightweight Sublinear Arguments Without a Trusted Setup. | Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam |
| 2017 | PKC | Better Two-Round Adaptive Multi-party Computation. | Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam |
| 2017 | PKC | Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model. | Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2017 | PKC | Scalable Multi-party Private Set-Intersection. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2017 | STOC | Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model. | Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam |
| 2017 | TCC | Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. | Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam |
| 2017 | TCC | A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. | Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam |
| 2016 | CRYPTO | On the Power of Secure Two-Party Computation. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2016 | INDOCRYPT | On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography. | Douglas Miller, Adam Scrivener, Jesse Stern, Muthuramakrishnan Venkitasubramaniam |
| 2016 | SCN | What Security Can We Achieve Within 4 Rounds? | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2016 | TCC | Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. | Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2016 | TCC | Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2015 | ASIACRYPT | On Black-Box Complexity of Universally Composable Security in the CRS Model. | Carmit Hazay, Muthuramakrishnan Venkitasubramaniam |
| 2015 | ASIACRYPT | Secure Computation from Millionaire. | Abhi Shelat, Muthuramakrishnan Venkitasubramaniam |
| 2015 | TCC | Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. | Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam |
| 2014 | GLOBECOM | Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms. | Alex Page, vn Kocabas, Scott Ames, Muthuramakrishnan Venkitasubramaniam, Tolga Soyata |
| 2014 | SCN | On Adaptively Secure Protocols. | Muthuramakrishnan Venkitasubramaniam |
| 2014 | TCC | 4-Round Resettably-Sound Zero Knowledge. | Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti |
| 2013 | ASIACRYPT | Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. | Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam |
| 2012 | ASIACRYPT | The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions. | Scott Ames, Rosario Gennaro, Muthuramakrishnan Venkitasubramaniam |
| 2012 | ASIACRYPT | A Unified Framework for UC from Only OT. | Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam |
| 2011 | TCC | Towards Non-Black-Box Lower Bounds in Cryptography. | Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam |
| 2010 | CRYPTO | Concurrent Non-Malleable Zero Knowledge Proofs. | Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam |
| 2010 | TCC | Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. | Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam |
| 2010 | TCC | Private Coins versus Public Coins in Zero-Knowledge Proof Systems. | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2009 | STOC | A unified framework for concurrent security: universal composability from stand-alone non-malleability. | Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2008 | EuroCrypt | Precise Concurrent Zero Knowledge. | Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam |
| 2008 | TCC | Concurrent Non-malleable Commitments from Any One-Way Function. | Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2008 | TCC | On Constant-Round Concurrent Zero-Knowledge. | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2007 | STOC | An efficient parallel repetition theorem for Arthur-Merlin games. | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
| 2006 | ICDE | l-Diversity: Privacy Beyond k-Anonymity. | Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam |
| 2006 | ICDE | Trusted CVS. | Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, Johannes Gehrke |
| 2004 | PODC | Brief announcement: on the round complexity of distributed consensus over synchronous networks. | D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan |