Muthuramakrishnan Venkitasubramaniam
Muthuramakrishnan Venkitasubramaniam
Associate Professor of Computer Science, University of Rochester
Email verificata su cs.rochester.edu - Home page
TitoloCitata daAnno
l-diversity: Privacy beyond k-anonymity
A Machanavajjhala, J Gehrke, D Kifer, M Venkitasubramaniam
22nd International Conference on Data Engineering (ICDE'06), 24-24, 2006
44622006
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
902009
Concurrent non-malleable commitments from any one-way function
H Lin, R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 571-588, 2008
752008
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
642017
An efficient parallel repetition theorem for Arthur-Merlin games
R Pass, M Venkitasubramaniam
STOC 7, 420-429, 2007
402007
Concurrent non-malleable zero knowledge proofs
H Lin, R Pass, WLD Tseng, M Venkitasubramaniam
Annual Cryptology Conference, 429-446, 2010
362010
On constant-round concurrent zero-knowledge
R Pass, M Venkitasubramaniam
Theory of Cryptography Conference, 553-570, 2008
292008
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
272014
4-round resettably-sound zero knowledge
KM Chung, R Ostrovsky, R Pass, M Venkitasubramaniam, I Visconti
Theory of Cryptography Conference, 192-216, 2014
272014
On the power of secure two-party computation
C Hazay, M Venkitasubramaniam
Annual International Cryptology Conference, 397-429, 2016
242016
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
232013
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
212012
Precise concurrent zero knowledge
O Pandey, R Pass, A Sahai, WLD Tseng, M Venkitasubramaniam
Annual International Conference on the Theory and Applications of …, 2008
202008
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography Conference, 367-399, 2016
182016
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Annual International Cryptology Conference, 488-520, 2018
172018
Scalable multi-party private set-intersection
C Hazay, M Venkitasubramaniam
IACR International Workshop on Public Key Cryptography, 175-203, 2017
162017
Towards non-black-box lower bounds in cryptography
R Pass, WLD Tseng, M Venkitasubramaniam
Theory of Cryptography Conference, 579-596, 2011
142011
Concurrent zero knowledge, revisited
R Pass, WLD Tseng, M Venkitasubramaniam
Journal of cryptology 27 (1), 45-66, 2014
132014
On black-box complexity of universally composable security in the CRS model
C Hazay, M Venkitasubramaniam
Journal of Cryptology 32 (3), 635-689, 2019
122019
Secure health monitoring in the cloud using homomorphic encryption: A branching-program formulation
S Ames, M Venkitasubramaniam, A Page, O Kocabas, T Soyata
Enabling Real-Time Mobile Cloud Computing through Emerging Technologies, 116-152, 2015
122015
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20