Muthuramakrishnan Venkitasubramaniam

Citado por

	Total	Desde 2019
Citas	9184	3941
Índice h	22	16
Índice i10	40	27

760

380

190

570

200620072008200920102011201220132014201520162017201820192020202120222023202457 117 223 253 359 379 382 469 503 536 565 614 641 636 654 749 676 646 565

Acceso público

Ver todo

31 artículos

2 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Carmit HazayBar-Ilan University, IsraelDirección de correo verificada de biu.ac.il
Johannes GehrkeMicrosoftDirección de correo verificada de microsoft.com
Ashwin MachanavajjhalaAssociate Professor, Duke UniversityDirección de correo verificada de cs.duke.edu
Huijia (Rachel) LinAssociate Professor at the University of WashingtonDirección de correo verificada de cs.washington.edu
Antigoni PolychroniadouExecutive Director, JPMorgan AI Research - Head of JPMorgan AlgoCRYPT CoEDirección de correo verificada de cornell.edu
Tolga SoyataGeorge Mason UniversityDirección de correo verificada de gmu.edu
Rafail OstrovskyNorman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATHDirección de correo verificada de cs.ucla.edu
Ran CanettiProfessor of Computer Science, Boston UniversityDirección de correo verificada de bu.edu
Ovunc KocabasUniversity of RochesterDirección de correo verificada de rochester.edu
Alex PageUniversity of Rochester Medical CenterDirección de correo verificada de rochester.edu
Mariana RaykovaGoogleDirección de correo verificada de cs.columbia.edu
Tal MalkinProfessor of Computer Science, Columbia UniversityDirección de correo verificada de columbia.edu
Ivan ViscontiSapienza University of RomeDirección de correo verificada de uniroma1.it
Kai-Min ChungInstitute of Information Science, Academia SinicaDirección de correo verificada de iis.sinica.edu.tw
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLADirección de correo verificada de cs.ucla.edu
Omkant PandeyStony Brook UniversityDirección de correo verificada de cs.stonybrook.edu
Alessandra ScafuroNorth Carolina State UniversityDirección de correo verificada de ncsu.edu
Rosario GennaroProfessor of Computer Science, City College of New YorkDirección de correo verificada de cs.ccny.cuny.edu

Seguir

Muthuramakrishnan Venkitasubramaniam

Associate Professor of Computer Science, University of Rochester

Dirección de correo verificada de cs.rochester.edu - Página principal

Privacy Security Cryptography Complexity Theory


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	7202	2007
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	481	2017
Scalable multi-party private set-intersection C Hazay, M Venkitasubramaniam IACR international workshop on public key cryptography, 175-203, 2017	142	2017
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	125	2008
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	117	2009
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	94	2020
Round-optimal secure multi-party computation S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam Journal of Cryptology 34 (3), 19, 2021	71	2021
On the power of secure two-party computation C Hazay, M Venkitasubramaniam Annual International Cryptology Conference, 397-429, 2016	54	2016
Concurrent non-malleable zero knowledge proofs H Lin, R Pass, WLD Tseng, M Venkitasubramaniam Annual Cryptology Conference, 429-446, 2010	52	2010
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	50	2021
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	44	2014
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	42	2007
On constant-round concurrent zero-knowledge R Pass, M Venkitasubramaniam Theory of Cryptography Conference, 553-570, 2008	41	2008
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	40	2013
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	39	2014
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	37	2019
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	30	2016
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	30	2012
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	24	2017
Actively secure garbled circuits with constant communication overhead in the plain model C Hazay, Y Ishai, M Venkitasubramaniam Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017	24	2017

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores