Rafail Ostrovsky

Dikutip oleh

	Semua	Sejak 2020
Kutipan	43619	13662
indeks-h	88	52
indeks-i10	263	168

3000

1500

750

2250

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025121 163 214 217 266 308 402 483 589 779 897 926 1136 1280 1351 1534 1950 2387 2633 2951 2895 2745 2894 2762 2670 2727 2714 2459 329

Akses publik

Lihat semua

98 artikel

3 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Eyal KushilevitzComputer Science Department, TechnionEmail yang diverifikasi di cs.technion.ac.il
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAEmail yang diverifikasi di cs.ucla.edu
Yuval IshaiTechnionEmail yang diverifikasi di cs.technion.ac.il
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringEmail yang diverifikasi di TAMU.EDU
Ivan ViscontiSapienza University of RomeEmail yang diverifikasi di uniroma1.it
Yuval RabaniThe Hebrew University of JerusalemEmail yang diverifikasi di cs.huji.ac.il
Moti YungDistinguished Research Scientist Google; Adjunct Research Prof. Columbia U.Email yang diverifikasi di cs.columbia.edu
Giovanni Di CrescenzoPeraton Labs also formerly known as Applied Communication Sciences, Vencore Labs, BellCoreEmail yang diverifikasi di peratonlabs.com
Giuseppe PersianoUniversità di Salerno -- ItalyEmail yang diverifikasi di unisa.it
brett hemenway falkUniversity of PennsylvaniaEmail yang diverifikasi di cis.upenn.edu
Adam SmithProfessor of Computer Science, Boston UniversityEmail yang diverifikasi di bu.edu
Jonathan KatzProfessor of Computer Science, University of MarylandEmail yang diverifikasi di cs.umd.edu
Vladimir BravermanProfessor of Computer Science, Johns Hopkins University; Google Research; Adjunct Professor, Rice U.Email yang diverifikasi di cs.jhu.edu
Vipul GoyalNTT ResearchEmail yang diverifikasi di vipulgoyal.org
Nishanth ChandranPrincipal Researcher, Microsoft Research, IndiaEmail yang diverifikasi di microsoft.com
Yevgeniy DodisProfessor, New York UniversityEmail yang diverifikasi di cs.nyu.edu
Vassilis ZikasGeorgia TechEmail yang diverifikasi di gatech.edu
Leonid ReyzinProfessor of Computer Science, Boston UniversityEmail yang diverifikasi di cs.bu.edu
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceEmail yang diverifikasi di weizmann.ac.il
Ran CanettiProfessor of Computer Science, Boston UniversityEmail yang diverifikasi di bu.edu

Ikuti

Rafail Ostrovsky

Norman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATH

Email yang diverifikasi di cs.ucla.edu - Beranda

Theoretical Computer Science Cryptography Computer Security Complexity Theory Distributed Algorithms


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Public key encryption with keyword search D Boneh, G Di Crescenzo, R Ostrovsky, G Persiano Advances in Cryptology-EUROCRYPT 2004: International Conference on the …, 2004	4487	2004
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data Y Dodis, R Ostrovsky, L Reyzin, A Smith SIAM journal on computing 38 (1), 97-139, 2008	4425*	2008
Searchable symmetric encryption: improved definitions and efficient constructions R Curtmola, J Garay, S Kamara, R Ostrovsky Proceedings of the 13th ACM conference on Computer and communications …, 2006	3525	2006
Software protection and simulation on oblivious RAMs O Goldreich, R Ostrovsky Journal of the ACM (JACM) 43 (3), 431-473, 1996	2214	1996
Attribute-based encryption with non-monotonic access structures R Ostrovsky, A Sahai, B Waters Proceedings of the 14th ACM conference on Computer and communications …, 2007	1586	2007
Replication is not needed: Single database, computationally-private information retrieval E Kushilevitz, R Ostrovsky Proceedings 38th annual symposium on foundations of computer science, 364-373, 1997	1372	1997
Universally composable two-party and multi-party secure computation R Canetti, Y Lindell, R Ostrovsky, A Sahai Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002	976	2002
How to withstand mobile virus attacks R Ostrovsky, M Yung Proceedings of the tenth annual ACM symposium on Principles of distributed …, 1991	818	1991
Efficient search for approximate nearest neighbor in high dimensional spaces E Kushilevitz, R Ostrovsky, Y Rabani SIAM Journal on Computing 30 (2), 457-474, 2000	720	2000
The effectiveness of lloyd-type methods for the k-means problem R Ostrovsky, Y Rabani, LJ Schulman, C Swamy Journal of the ACM (JACM) 59 (6), 28, 2012	632	2012
Deniable encryption R Canetti, C Dwork, M Naor, R Ostrovsky Advances in Cryptology—CRYPTO'97: 17th Annual International Cryptology …, 1997	596	1997
Efficient password-authenticated key exchange using human-memorable passwords J Katz, R Ostrovsky, M Yung International Conference on the Theory and Applications of Cryptographic …, 2001	589	2001
Zero-knowledge from secure multiparty computation Y Ishai, E Kushilevitz, R Ostrovsky, A Sahai Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007	564	2007
Perfect noninteractive zero-knowledge for NP J Groth, R Ostrovsky, A Sahai	484	2005
Sequential aggregate signatures and multisignatures without random oracles S Lu, R Ostrovsky, A Sahai, H Shacham, B Waters Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006	480	2006
Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth Theory of Cryptography, 315-333, 2013	439	2013
Robust non-interactive zero knowledge A De Santis, G Di Crescenzo, R Ostrovsky, G Persiano, A Sahai Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology …, 2001	404	2001
A survey of single-database private information retrieval: Techniques and applications R Ostrovsky, WE Skeith III International Workshop on Public Key Cryptography, 393-411, 2007	396	2007
Public key encryption that allows PIR queries D Boneh, E Kushilevitz, R Ostrovsky, WE Skeith III Annual International Cryptology Conference, 50-67, 2007	382	2007
Efficient computation on oblivious RAMs R Ostrovsky Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990	373	1990

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama