Muthuramakrishnan Venkitasubramaniam

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 72

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptol.

TCC (1)

CCS

Publications

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

Muthuramakrishnan Venkitasubramaniam.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Muthuramakrishnan Venkitasubramaniam