Muthuramakrishnan Venkitasubramaniam

Available identifiers

zbMath Open venkitasubramaniam.muthuramakrishnanMaRDI QIDQ1629407

List of research outcomes

Publication	Date of Publication	Type
Best of both worlds. Revisiting the spymasters double agent problem	2024-02-02	Paper
Private polynomial commitments and applications to MPC	2023-11-16	Paper
Ligero: lightweight sublinear arguments without a trusted setup	2023-11-07	Paper
On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives	2023-08-14	Paper
Actively secure garbled circuits with constant communication overhead in the plain model	2023-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q6107255	2023-07-03	Paper
Adaptively secure computation for RAM programs	2022-08-30	Paper
ZK-PCPs from leakage-resilient secret sharing	2022-08-01	Paper
The price of active security in cryptographic protocols	2022-03-23	Paper
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model	2022-02-08	Paper
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?	2021-12-01	Paper
Going beyond dual execution: MPC for functions with efficient verification	2021-12-01	Paper
Round-optimal secure multi-party computation	2021-07-30	Paper
On the power of secure two-party computation	2020-03-03	Paper
What security can we achieve within 4 rounds?	2019-11-27	Paper
On black-box complexity of universally composable security in the CRS model	2019-08-13	Paper
Two-round adaptively secure multiparty computation from standard assumptions	2018-12-11	Paper
Round-optimal fully black-box zero-knowledge arguments from one-way permutations	2018-12-11	Paper
Round-optimal secure multi-party computation	2018-09-26	Paper
A unified approach to constructing black-box UC protocols in trusted setup models	2018-01-19	Paper
Actively secure garbled circuits with constant communication overhead in the plain model	2018-01-19	Paper
Equivocating Yao	2017-08-17	Paper
Better Two-Round Adaptive Multi-party Computation	2017-06-13	Paper
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model	2017-06-13	Paper
Scalable Multi-party Private Set-Intersection	2017-06-13	Paper
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity	2016-12-21	Paper
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions	2016-12-21	Paper
On the Power of Secure Two-Party Computation	2016-10-27	Paper
What Security Can We Achieve Within 4 Rounds?	2016-10-21	Paper
Secure Computation from Millionaire	2016-06-10	Paper
On Black-Box Complexity of Universally Composable Security in the CRS Model	2016-03-23	Paper
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs	2015-09-24	Paper
A unified framework for concurrent security	2015-02-04	Paper
On Adaptively Secure Protocols	2014-10-14	Paper
Concurrent zero knowledge, revisited	2014-04-01	Paper
4-Round Resettably-Sound Zero Knowledge	2014-02-18	Paper
Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments	2013-12-10	Paper
The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions	2013-03-19	Paper
A Unified Framework for UC from Only OT	2013-03-19	Paper
Towards Non-Black-Box Lower Bounds in Cryptography	2011-05-19	Paper
Concurrent Non-Malleable Zero Knowledge Proofs	2010-08-24	Paper
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model	2010-02-24	Paper
Private Coins versus Public Coins in Zero-Knowledge Proof Systems	2010-02-24	Paper
https://portal.mardi4nfdi.de/entity/Q3549641	2009-01-05	Paper
Precise Concurrent Zero Knowledge	2008-04-15	Paper
On Constant-Round Concurrent Zero-Knowledge	2008-03-05	Paper
Concurrent Non-malleable Commitments from Any One-Way Function	2008-03-05	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Muthuramakrishnan Venkitasubramaniam