Muthuramakrishnan Venkitasubramaniam

Orcid: 0000-0001-9765-7911

Affiliations:
  • Georgetown University, Washington, D.C., USA


According to our database1, Muthuramakrishnan Venkitasubramaniam authored at least 68 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Ligero: lightweight sublinear arguments without a trusted setup.
Des. Codes Cryptogr., November, 2023

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model.
J. Cryptol., July, 2023

Batchman and Robin: Batched and Non-batched Branching for Interactive ZK.
IACR Cryptol. ePrint Arch., 2023

Beyond MPC-in-the-Head: Black-Box Constructions of Short Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2023

Private Polynomial Commitments and Applications to MPC.
IACR Cryptol. ePrint Arch., 2023

Can Alice and Bob Guarantee Output to Carol?
IACR Cryptol. ePrint Arch., 2023

Best of Both Worlds: Revisiting the Spymasters Double Agent Problem.
IACR Cryptol. ePrint Arch., 2023

Flag: A Framework for Lightweight Robust Secure Aggregation.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022
ZK-PCPs from Leakage-Resilient Secret Sharing.
J. Cryptol., 2022

Your Reputation's Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2022

Protecting Distributed Primitives against Leakage: Equivocal Secret Sharing and More.
IACR Cryptol. ePrint Arch., 2022

On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives.
IACR Cryptol. ePrint Arch., 2022

Asymptotically Quasi-Optimal Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Adaptively Secure Computation for RAM Programs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Guest Column: Average-case Complexity Through the Lens of Interactive Puzzles.
SIGACT News, 2021

Round-Optimal Secure Multi-party Computation.
J. Cryptol., 2021

2020
On the Power of Secure Two-Party Computation.
J. Cryptol., 2020

Going Beyond Dual Execution: MPC for Functions with Efficient Verification.
IACR Cryptol. ePrint Arch., 2020

LevioSA: Lightweight Secure Arithmetic Computation.
IACR Cryptol. ePrint Arch., 2020

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2020

Is it Easier to Prove Theorems that are Guaranteed to be True?
Electron. Colloquium Comput. Complex., 2020

Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Ligero++: A New Optimized Sublinear IOP.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
What Security Can We Achieve Within 4 Rounds?
J. Cryptol., 2019

On Black-Box Complexity of Universally Composable Security in the CRS Model.
J. Cryptol., 2019

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

The Price of Active Security in Cryptographic Protocols.
IACR Cryptol. ePrint Arch., 2019

2018
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations.
IACR Cryptol. ePrint Arch., 2018

Outsourcing Private Machine Learning via Lightweight Secure Arithmetic Computation.
CoRR, 2018

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

2017
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models.
IACR Cryptol. ePrint Arch., 2017

Scalable Multi-Party Private Set-Intersection.
IACR Cryptol. ePrint Arch., 2017

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model.
IACR Cryptol. ePrint Arch., 2017

Better Two-Round Adaptive Multi-party Computation.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography.
IACR Cryptol. ePrint Arch., 2016

Composable Adaptive Secure Protocols without Setup under Polytime Assumptions.
IACR Cryptol. ePrint Arch., 2016

Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model.
IACR Cryptol. ePrint Arch., 2016

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
What Security can we Achieve in 4-Rounds?
IACR Cryptol. ePrint Arch., 2015

Round-Optimal Token-Based Secure Computation.
IACR Cryptol. ePrint Arch., 2015

Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Secure Computation from Millionaire.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Concurrent Zero Knowledge, Revisited.
J. Cryptol., 2014

Resettably Sound Zero-Knoweldge Arguments from OWFs - the (semi) Black-Box way.
IACR Cryptol. ePrint Arch., 2014

4-Round Resettably-Sound Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

On Adaptively Secure Protocols.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms.
Proceedings of the 2014 IEEE GLOBECOM Workshops, Austin, TX, USA, December 8-12, 2014, 2014

2013
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs.
ACM Trans. Comput. Theory, 2012

A Unified Framework for UC from Only OT.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Unified Framework for Concurrent Security.
PhD thesis, 2011

Adaptive and Concurrent Secure Computation from New Notions of Non-Malleability.
IACR Cryptol. ePrint Arch., 2011

Towards Non-Black-Box Lower Bounds in Cryptography.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010
Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Concurrent Non-Malleable Zero Knowledge Proofs.
Proceedings of the Advances in Cryptology, 2010

2009
A unified framework for concurrent security: universal composability from stand-alone non-malleability.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
On Constant-Round Concurrent Zero-Knowledge.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Concurrent Non-malleable Commitments from Any One-Way Function.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
<i>L</i>-diversity: Privacy beyond <i>k</i>-anonymity.
ACM Trans. Knowl. Discov. Data, 2007

Precise Concurrent Zero Knowledge.
IACR Cryptol. ePrint Arch., 2007

An efficient parallel repetition theorem for Arthur-Merlin games.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Trusted CVS.
Proceedings of the 22nd International Conference on Data Engineering Workshops, 2006

l-Diversity: Privacy Beyond k-Anonymity.
Proceedings of the 22nd International Conference on Data Engineering, 2006

2004
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: on the round complexity of distributed consensus over synchronous networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004


  Loading...