Muthuramakrishnan Venkitasubramaniam
Muthuramakrishnan Venkitasubramaniam
Associate Professor of Computer Science, University of Rochester
Vahvistettu sähköpostiosoite verkkotunnuksessa cs.rochester.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
55782007
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
1602017
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
1032009
Concurrent non-malleable commitments from any one-way function
H Lin, R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 571-588, 2008
942008
Scalable multi-party private set-intersection
C Hazay, M Venkitasubramaniam
IACR International Workshop on Public Key Cryptography, 175-203, 2017
462017
Concurrent non-malleable zero knowledge proofs
H Lin, R Pass, WLD Tseng, M Venkitasubramaniam
Annual Cryptology Conference, 429-446, 2010
432010
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
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
372014
On constant-round concurrent zero-knowledge
R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 553-570, 2008
362008
4-round resettably-sound zero knowledge
KM Chung, R Ostrovsky, R Pass, M Venkitasubramaniam, I Visconti
Theory of Cryptography Conference, 192-216, 2014
352014
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Annual International Cryptology Conference, 488-520, 2018
342018
On the power of secure two-party computation
C Hazay, M Venkitasubramaniam
Annual International Cryptology Conference, 397-429, 2016
342016
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
282013
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
242012
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography Conference, 367-399, 2016
232016
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
Concurrent zero knowledge, revisited
R Pass, WLD Tseng, M Venkitasubramaniam
Journal of cryptology 27 (1), 45-66, 2014
182014
DNS Cache-Based User Tracking.
A Klein, B Pinkas
NDSS, 2019
172019
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
162015
Towards non-black-box lower bounds in cryptography
R Pass, WLD Tseng, M Venkitasubramaniam
Theory of Cryptography Conference, 579-596, 2011
152011
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20