Muthuramakrishnan Venkitasubramaniam

116 papers A* 16A 6B 6Misc 3Journal 54Unranked 30
YearRankTypeTitle / Venue / Authors
2026 J jnl
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2025 — conf
On Achieving "Best-in-the-Multiverse" MPC.
TCC (1)
Anasuya Acharya, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2025 J jnl
On Achieving "Best-in-the-Multiverse" MPC.
IACR Cryptol. ePrint Arch.
Anasuya Acharya, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2025 J jnl
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and more.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2025 J jnl
SCIF: Privacy-Preserving Statistics Collection with Input Validation and Full Security.
Proc. Priv. Enhancing Technol.
Jianan Su, Laasya Bangalore, Harel Berger, Jason Yi, Sophia Castor, Micah Sherr, Muthuramakrishnan Venkitasubramaniam
2024 — conf
Can Alice and Bob Guarantee Output to Carol?
EUROCRYPT (5)
Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam
2024 A* conf
Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs Post-Quantum ZK-SNARKs on a Browser.
SP
Ruihan Wang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2024 J jnl
LogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK.
IACR Cryptol. ePrint Arch.
Carmit Hazay, David Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam, Yibin Yang
2024 J jnl
PRIME: Differentially Private Distributed Mean Estimation with Malicious Security.
IACR Cryptol. ePrint Arch.
Laasya Bangalore, Albert Cheu, Muthuramakrishnan Venkitasubramaniam
2024 J jnl
SCIF: Privacy-Preserving Statistics Collection with Input Validation and Full Security.
IACR Cryptol. ePrint Arch.
Jianan Su, Laasya Bangalore, Harel Berger, Jason Yi, Alivia Castor, Micah Sherr, Muthuramakrishnan Venkitasubramaniam
2024 J jnl
The Price of Active Security in Cryptographic Protocols.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2024 A* conf
Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction.
CCS
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
2024 J jnl
Tight ZK CPU: Batched ZK Branching with Cost Proportional to Evaluated Instruction.
IACR Cryptol. ePrint Arch.
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
2024 — conf
sfLogRobin++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK.
ASIACRYPT (5)
Carmit Hazay, David Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam, Yibin Yang
2023 J jnl
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
J. Cryptol.
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2023 A* conf
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.
CCS
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
2023 J jnl
Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.
IACR Cryptol. ePrint Arch.
Yibin Yang, David Heath, Carmit Hazay, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam
2023 — conf
Best of Both Worlds - Revisiting the Spymasters Double Agent Problem.
CRYPTO (1)
Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2023 J jnl
Best of Both Worlds: Revisiting the Spymasters Double Agent Problem.
IACR Cryptol. ePrint Arch.
Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2023 — conf
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs.
TCC (1)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2023 J jnl
Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2023 J jnl
Can Alice and Bob Guarantee Output to Carol?
IACR Cryptol. ePrint Arch.
Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam
2023 A conf
Flag: A Framework for Lightweight Robust Secure Aggregation.
AsiaCCS
Laasya Bangalore, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2023 J jnl
Ligero: lightweight sublinear arguments without a trusted setup.
Des. Codes Cryptogr.
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2023 — conf
Private Polynomial Commitments and Applications to MPC.
Public Key Cryptography (2)
Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang
2023 J jnl
Private Polynomial Commitments and Applications to MPC.
IACR Cryptol. ePrint Arch.
Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Wenxuan Wu, Yupeng Zhang
2023 — conf
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.
TCC (1)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2022 — conf
Adaptively Secure Computation for RAM Programs.
EUROCRYPT (2)
Laasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2022 — conf
Asymptotically Quasi-Optimal Cryptography.
EUROCRYPT (1)
Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthuramakrishnan Venkitasubramaniam
2022 J jnl
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.
SIAM J. Comput.
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2022 J jnl
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.
IACR Cryptol. ePrint Arch.
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2022 — conf
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives.
TCC (1)
Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2022 J jnl
On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives.
IACR Cryptol. ePrint Arch.
Laasya Bangalore, Rishabh Bhadauria, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2022 A conf
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More.
ITC
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2022 J jnl
Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2022 J jnl
Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2022 J jnl
ZK-PCPs from Leakage-Resilient Secret Sharing.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2021 A* conf
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
SP
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
2021 J jnl
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles.
SIGACT News
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2021 J jnl
Round-Optimal Secure Multi-party Computation.
J. Cryptol.
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2021 A conf
ZK-PCPs from Leakage-Resilient Secret Sharing.
ITC
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2021 J jnl
ZK-PCPs from Leakage-Resilient Secret Sharing.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2020 J jnl
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
IACR Cryptol. ePrint Arch.
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
2020 — conf
Going Beyond Dual Execution: MPC for Functions with Efficient Verification.
Public Key Cryptography (2)
Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam
2020 J jnl
Going Beyond Dual Execution: MPC for Functions with Efficient Verification.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam
2020 A* conf
Is it Easier to Prove Theorems that are Guaranteed to be True?
FOCS
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2020 J jnl
Is it Easier to Prove Theorems that are Guaranteed to be True?
Electron. Colloquium Comput. Complex.
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2020 A* conf
Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.
CCS
Jackson Abascal, Mohammad Hossein Faghihi Sereshgi, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2020 J jnl
LevioSA: Lightweight Secure Arithmetic Computation.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
2020 A* conf
Ligero++: A New Optimized Sublinear IOP.
CCS
Rishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Tiancheng Xie, Yupeng Zhang
2020 J jnl
On the Power of Secure Two-Party Computation.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2020 — conf
The Price of Active Security in Cryptographic Protocols.
EUROCRYPT (2)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2020 — conf
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
EUROCRYPT (3)
Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2019 J jnl
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland.
CoRR
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2019 J jnl
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland.
IACR Cryptol. ePrint Arch.
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2019 A* conf
LevioSA: Lightweight Secure Arithmetic Computation.
CCS
Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
2019 J jnl
On Black-Box Complexity of Universally Composable Security in the CRS Model.
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2019 J jnl
The Price of Active Security in Cryptographic Protocols.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss
2019 J jnl
What Security Can We Achieve Within 4 Rounds?
J. Cryptol.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2018 J jnl
Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.
CoRR
Siddharth Garg, Zahra Ghodsi, Carmit Hazay, Yuval Ishai, Antonio Marcedone, Muthuramakrishnan Venkitasubramaniam
2018 — conf
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.
TCC (1)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2018 J jnl
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2018 — conf
Round-Optimal Secure Multi-Party Computation.
CRYPTO (2)
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2018 — conf
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.
TCC (1)
Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2017 — conf
A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models.
TCC (1)
Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam
2017 J jnl
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.
IACR Cryptol. ePrint Arch.
Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam
2017 — conf
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
TCC (2)
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2017 J jnl
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2017 — conf
Better Two-Round Adaptive Multi-party Computation.
Public Key Cryptography (2)
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2017 — conf
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.
Public Key Cryptography (2)
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2017 J jnl
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2017 A* conf
Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model.
STOC
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2017 A* conf
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup.
CCS
Scott Ames, Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam
2017 J jnl
Round-Optimal Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch.
Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2017 J jnl
Scalable Multi-Party Private Set-Intersection.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2017 — conf
Scalable Multi-party Private Set-Intersection.
Public Key Cryptography (1)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 — conf
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions.
TCC (B1)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 J jnl
Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 — conf
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.
TCC (B1)
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2016 J jnl
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.
IACR Cryptol. ePrint Arch.
Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam
2016 Misc conf
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography.
INDOCRYPT
Douglas Miller, Adam Scrivener, Jesse Stern, Muthuramakrishnan Venkitasubramaniam
2016 J jnl
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography.
IACR Cryptol. ePrint Arch.
Douglas Miller, Adam Scrivener, Jesse Stern, Muthuramakrishnan Venkitasubramaniam
2016 — conf
On the Power of Secure Two-Party Computation.
CRYPTO (2)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 J jnl
On the Power of Secure Two-Party Computation.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2016 Misc conf
What Security Can We Achieve Within 4 Rounds?
SCN
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2015 — conf
On Black-Box Complexity of Universally Composable Security in the CRS Model.
ASIACRYPT (2)
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2015 J jnl
On Black-Box Complexity of Universally Composable Security in the CRS model.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2015 — conf
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way.
TCC (1)
Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam
2015 J jnl
Round-Optimal Token-Based Secure Computation.
IACR Cryptol. ePrint Arch.
Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
2015 — conf
Secure Computation from Millionaire.
ASIACRYPT (1)
Abhi Shelat, Muthuramakrishnan Venkitasubramaniam
2015 J jnl
What Security can we Achieve in 4-Rounds?
IACR Cryptol. ePrint Arch.
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam
2014 B conf
4-Round Resettably-Sound Zero Knowledge.
TCC
Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti
2014 — conf
Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms.
GLOBECOM Workshops
Alex Page, Övünç Kocabas, Scott Ames, Muthuramakrishnan Venkitasubramaniam, Tolga Soyata
2014 J jnl
Concurrent Zero Knowledge, Revisited.
J. Cryptol.
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2014 Misc conf
On Adaptively Secure Protocols.
SCN
Muthuramakrishnan Venkitasubramaniam
2014 J jnl
Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way.
IACR Cryptol. ePrint Arch.
Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam
2013 — conf
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.
ASIACRYPT (1)
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam
2012 J jnl
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs.
ACM Trans. Comput. Theory
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2012 A conf
A Unified Framework for UC from Only OT.
ASIACRYPT
Rafael Pass, Huijia Lin, Muthuramakrishnan Venkitasubramaniam
2012 A conf
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions.
ASIACRYPT
Scott Ames, Rosario Gennaro, Muthuramakrishnan Venkitasubramaniam
2011 J jnl
Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.
IACR Cryptol. ePrint Arch.
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Muthuramakrishnan Venkitasubramaniam
2011 B conf
Towards Non-Black-Box Lower Bounds in Cryptography.
TCC
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2011 — —
Unified Framework for Concurrent Security.
Muthuramakrishnan Venkitasubramaniam
2010 A* conf
Concurrent Non-Malleable Zero Knowledge Proofs.
CRYPTO
Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2010 B conf
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.
TCC
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2010 B conf
Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
TCC
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2009 A* conf
A unified framework for concurrent security: universal composability from stand-alone non-malleability.
STOC
Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2008 B conf
Concurrent Non-malleable Commitments from Any One-Way Function.
TCC
Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2008 B conf
On Constant-Round Concurrent Zero-Knowledge.
TCC
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2008 A* conf
Precise Concurrent Zero Knowledge.
EUROCRYPT
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2007 A* conf
An efficient parallel repetition theorem for Arthur-Merlin games.
STOC
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
2007 J jnl
Precise Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch.
Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam
2006 — conf
Trusted CVS.
ICDE Workshops
Muthuramakrishnan Venkitasubramaniam, Ashwin Machanavajjhala, David J. Martin, Johannes Gehrke
2006 A* conf
l-Diversity: Privacy Beyond k-Anonymity.
ICDE
Ashwin Machanavajjhala, Johannes Gehrke, Daniel Kifer, Muthuramakrishnan Venkitasubramaniam
2004 A* conf
Brief announcement: on the round complexity of distributed consensus over synchronous networks.
PODC
D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
2004 A conf
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.
DISC
D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan