Följ
Muthuramakrishnan Venkitasubramaniam
Muthuramakrishnan Venkitasubramaniam
Associate Professor of Computer Science, University of Rochester
Verifierad e-postadress på cs.rochester.edu - Startsida
Titel
Citeras av
Citeras av
År
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
61492007
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
2592017
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
1112009
Concurrent non-malleable commitments from any one-way function
H Lin, R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 571-588, 2008
1092008
Scalable multi-party private set-intersection
C Hazay, M Venkitasubramaniam
IACR international workshop on public key cryptography, 175-203, 2017
742017
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 1-63, 2021
492021
Concurrent non-malleable zero knowledge proofs
H Lin, R Pass, WLD Tseng, M Venkitasubramaniam
Annual Cryptology Conference, 429-446, 2010
482010
On the power of secure two-party computation
C Hazay, M Venkitasubramaniam
Journal of Cryptology 33 (1), 271-318, 2020
432020
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
412014
On constant-round concurrent zero-knowledge
R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 553-570, 2008
392008
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
392007
4-round resettably-sound zero knowledge
KM Chung, R Ostrovsky, R Pass, M Venkitasubramaniam, I Visconti
Theory of Cryptography Conference, 192-216, 2014
372014
Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
D Dachman-Soled, T Malkin, M Raykova, M Venkitasubramaniam
International Conference on the Theory and Application of Cryptology and …, 2013
332013
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
272020
A unified framework for UC from only OT
R Pass, H Lin, M Venkitasubramaniam
International Conference on the Theory and Application of Cryptology and …, 2012
262012
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography Conference, 367-399, 2016
252016
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
242019
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
222021
Precise concurrent zero knowledge
O Pandey, R Pass, A Sahai, WLD Tseng, M Venkitasubramaniam
Annual International Conference on the Theory and Applications of …, 2008
212008
On black-box complexity of universally composable security in the CRS model
C Hazay, M Venkitasubramaniam
International Conference on the Theory and Application of Cryptology and …, 2015
202015
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20