Follow
Muthuramakrishnan Venkitasubramaniam
Muthuramakrishnan Venkitasubramaniam
Associate Professor of Computer Science, University of Rochester
Verified email at cs.rochester.edu - Homepage
Title
Cited by
Cited by
Year
L-diversity: Privacy beyond k-anonymity
A Machanavajjhala, D Kifer, J Gehrke, M Venkitasubramaniam
Acm transactions on knowledge discovery from data (tkdd) 1 (1), 3-es, 2007
69982007
Ligero: Lightweight sublinear arguments without a trusted setup
S Ames, C Hazay, Y Ishai, M Venkitasubramaniam
Proceedings of the 2017 acm sigsac conference on computer and communications …, 2017
3972017
Concurrent non-malleable commitments from any one-way function
H Lin, R Pass, M Venkitasubramaniam
Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008 …, 2008
1232008
Scalable multi-party private set-intersection
C Hazay, M Venkitasubramaniam
IACR international workshop on public key cryptography, 175-203, 2017
1192017
A unified framework for concurrent security: universal composability from stand-alone non-malleability
H Lin, R Pass, M Venkitasubramaniam
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1142009
Ligero++: A new optimized sublinear IOP
R Bhadauria, Z Fang, C Hazay, M Venkitasubramaniam, T Xie, Y Zhang
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
762020
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 19, 2021
672021
Concurrent non-malleable zero knowledge proofs
H Lin, R Pass, WLD Tseng, M Venkitasubramaniam
Annual Cryptology Conference, 429-446, 2010
502010
On the power of secure two-party computation
C Hazay, M Venkitasubramaniam
Annual International Cryptology Conference, 397-429, 2016
492016
Cloud-based secure health monitoring: Optimizing fully-homomorphic encryption for streaming algorithms
A Page, O Kocabas, S Ames, M Venkitasubramaniam, T Soyata
2014 IEEE Globecom Workshops (GC Wkshps), 48-52, 2014
432014
An efficient parallel repetition theorem for Arthur-Merlin games
R Pass, M Venkitasubramaniam
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
412007
Diogenes: lightweight scalable RSA modulus generation with a dishonest majority
M Chen, C Hazay, Y Ishai, Y Kashnikov, D Micciancio, T Riviere, A Shelat, ...
2021 IEEE Symposium on Security and Privacy (SP), 590-607, 2021
402021
4-round resettably-sound zero knowledge
KM Chung, R Ostrovsky, R Pass, M Venkitasubramaniam, I Visconti
Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014
382014
Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
D Dachman-Soled, T Malkin, M Raykova, M Venkitasubramaniam
Advances in Cryptology-ASIACRYPT 2013: 19th International Conference on the …, 2013
382013
On constant-round concurrent zero-knowledge
R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 553-570, 2008
382008
LevioSA: Lightweight secure arithmetic computation
C Hazay, Y Ishai, A Marcedone, M Venkitasubramaniam
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
332019
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
302016
A unified framework for UC from only OT
R Pass, H Lin, M Venkitasubramaniam
Advances in Cryptology–ASIACRYPT 2012: 18th International Conference on the …, 2012
292012
Precise concurrent zero knowledge
O Pandey, R Pass, A Sahai, WLD Tseng, M Venkitasubramaniam
Advances in Cryptology–EUROCRYPT 2008: 27th Annual International Conference …, 2008
232008
Equivocating yao: constant-round adaptively secure multiparty computation in the plain model
R Canetti, O Poburinnaya, M Venkitasubramaniam
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
222017
The system can't perform the operation now. Try again later.
Articles 1–20