Muthuramakrishnan Venkitasubramaniam

发表

Rafail Ostrovsky, Ivan Visconti, Kai-Min Chung, 2014, TCC.

Better Two-Round Adaptive Multi-party Computation

Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam, 2017, Public Key Cryptography.

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2016, Journal of Cryptology.

Scalable Multi-party Private Set-Intersection

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2017, Public Key Cryptography.

Ligero++: A New Optimized Sublinear IOP

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Rishabh Bhadauria, 2020, CCS.

LevioSA: Lightweight Secure Arithmetic Computation

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2019, CCS.

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions

Rosario Gennaro, Muthuramakrishnan Venkitasubramaniam, Scott Ames, 2012, ASIACRYPT.

A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2012, TOCT.

Going Beyond Dual Execution: MPC for Functions with Efficient Verification

Abhi Shelat, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2020, IACR Cryptol. ePrint Arch..

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2016, TCC.

An efficient parallel repetition theorem for Arthur-Merlin games

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2007, STOC '07.

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, 2010, TCC.

Secure Computation from Millionaire

Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Abhi Shelat, 2015, ASIACRYPT.

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments

Tal Malkin, Dana Dachman-Soled, Mariana Raykova, 2013, ASIACRYPT.

Round-Optimal Token-Based Secure Computation

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2015, IACR Cryptol. ePrint Arch..

Concurrent Non-Malleable Zero Knowledge Proofs

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2010, CRYPTO.

Concurrent Zero Knowledge, Revisited

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, 2012, Journal of Cryptology.

On Black-Box Complexity of Universally Composable Security in the CRS Model

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2015, Journal of Cryptology.

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation pdf

Yuval Ishai, Carmit Hazay, Zahra Ghodsi, 2018, ArXiv.

A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models

Susumu Kiyoshima, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2017, TCC.

On Constant-Round Concurrent Zero-Knowledge

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2008, TCC.

What Security can we Achieve in 4-Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2015, IACR Cryptol. ePrint Arch..

Concurrent Non-malleable Commitments from Any One-Way Function

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2008, TCC.

The Price of Active Security in Cryptographic Protocols

Carmit Hazay, Mor Weiss, Muthuramakrishnan Venkitasubramaniam, 2020, IACR Cryptol. ePrint Arch..

Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms

Muthuramakrishnan Venkitasubramaniam, Tolga Soyata, Övünç Kocabas, 2014, 2014 IEEE Globecom Workshops (GC Wkshps).

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability

Tal Malkin, Dana Dachman-Soled, Mariana Raykova, 2011, IACR Cryptol. ePrint Arch..

A Unified Framework for UC from Only OT

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2012, ASIACRYPT.

Round-Optimal Secure Multi-party Computation

Carmit Hazay, Shai Halevi, Antigoni Polychroniadou, 2018, Journal of Cryptology.

Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model

Ran Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam, 2017, STOC.

Is it Easier to Prove Theorems that are Guaranteed to be True?

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Towards Non-Black-Box Lower Bounds in Cryptography

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, 2011, TCC.

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions

Fabrice Benhamouda, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2018, TCC.

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority

Abhi Shelat, Yuval Ishai, Carmit Hazay, 2021, 2021 IEEE Symposium on Security and Privacy (SP).

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2017, Designs, Codes and Cryptography.

What Security Can We Achieve Within 4 Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2016, SCN.

Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2018, IACR Cryptol. ePrint Arch..

l-Diversity: Privacy Beyond k-Anonymity

Ashwin Machanavajjhala, Daniel Kifer, Johannes Gehrke, 2006, ICDE.

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2019, Journal of Cryptology.

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2020, CCS.

A unified framework for concurrent security: universal composability from stand-alone non-malleability

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2009, STOC '09.

Concurrent Zero Knowledge: Simplifications and Generalizations

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, 2008 .

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

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2019, IACR Cryptol. ePrint Arch..

A universal framework for concurrent security

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2011 .

On Black-Box Complexity of Universally Composable Security in the CRS Model

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2015, ASIACRYPT.

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs

K. Srinathan, C. Pandu Rangan, Muthuramakrishnan Venkitasubramaniam, 2004, DISC.

On Adaptively Secure Protocols

Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2014, SCN.

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way

Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam, 2015, TCC.

What Security Can We Achieve Within 4 Rounds?

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Muthuramakrishnan Venkitasubramaniam, 2016, Journal of Cryptology.

On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography

Muthuramakrishnan Venkitasubramaniam, Douglas Miller, Jesse Stern, 2016, INDOCRYPT.

Private Coins versus Public Coins in Zero-Knowledge Proof Systems

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, R. Pass, 2010, TCC.

Trusted CVS

Ashwin Machanavajjhala, Johannes Gehrke, David J. Martin, 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2016, TCC.

The Complexity of Collision-Resistant Hashing

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Wei-Lung Dustin Tseng, 2009 .

Secure Health Monitoring in the Cloud Using Homomorphic Encryption: A Branching-Program Formulation

Muthuramakrishnan Venkitasubramaniam, Tolga Soyata, Alex Page, 2015 .

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

Carmit Hazay, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, 2020, EUROCRYPT.

Brief announcement: on the round complexity of distributed consensus over synchronous networks

K. Srinathan, C. Pandu Rangan, Muthuramakrishnan Venkitasubramaniam, 2004, PODC '04.

Precise Concurrent Zero Knowledge

Amit Sahai, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, 2008, EUROCRYPT.

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model

Yuval Ishai, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, 2017, Journal of Cryptology.

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2017, Public Key Cryptography.

Round-Optimal Secure Multi-party Computation

Carmit Hazay, Shai Halevi, Antigoni Polychroniadou, 2018, Journal of Cryptology.

ZK-PCPs from Leakage-Resilient Secret Sharing

Carmit Hazay, Mor Weiss, Muthuramakrishnan Venkitasubramaniam, 2022, Journal of Cryptology.

Composable Security in the Tamper Proof Model under Minimal Complexity

Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam, 2016 .

Concurrent Non-Malleable Commitments from One-way Functions

Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Huijia Lin, 2007 .