Stanislaw Jarecki

Artificial Intelligence · 1995–2014

A researcher in the Science corpus: 5 papers; trusts 23 researchers and is trusted by 19 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 45 citations into it; #8,727 of 35,345 by trust here, #12,974 by citations
• Computer Vision and Pattern Recognition — 17 citations into it
• Computational Theory and Mathematics — 15 citations into it; #2,348 of 12,182 by trust here, #2,298 by citations
• Information Systems — 11 citations into it
• Privacy & Security — 9 citations into it
• Information Theory — 5 citations into it

Whom Stanislaw Jarecki trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Torben P. Pedersen
2. Pascal Paillier
3. Dan Boneh
4. Jan Camenisch
5. Yuval Ishai
6. Michael J. Freedman
7. Yevgeniy Dodis
8. Carmit Hazay
9. Seny Kamara
10. Shafi Goldwasser

Who trusts Stanislaw Jarecki overall

1. Emiliano De Cristofaro
2. Melissa Chase
3. Carmit Hazay
4. Vladimir Kolesnikov
5. Gene Tsudik
6. Raphael Bost
7. Zhihua Xia
8. Huang Lin
9. Sherman S. M. Chow
10. Gert Læssøe Mikkelsen

Papers from Stanislaw Jarecki's perspective

Ordered by how strongly the researchers Stanislaw Jarecki trusts endorse each paper. Same corpus, a different order for every researcher.

1. Random oracles are practical: a paradigm for designing efficient protocols
2. Public Key Encryption with Keyword Search (International Conference on the Theory and Application of Cryptographic Techniques)
3. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
4. How to Prove Yourself: Practical Solutions to Identification and Signature Problems
5. Practical techniques for searches on encrypted data (Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000)
6. Probabilistic Encryption
7. New Directions in Cryptography
8. Private information retrieval
9. Secure Indexes (IACR Cryptology ePrint Archive)
10. A method for obtaining digital signatures and public-key cryptosystems

Their papers

• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009) — 303 citations
• Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation (2014) — 791 citations
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013) — 961 citations
• Secure Distributed Key Generation for Discrete-Log Based Cryptosystems (1999)
• Proactive Secret Sharing Or: How to Cope With Perpetual Leakage (1995)