Daniel Wichs

Artificial Intelligence · 2009–2019

A researcher in the Science corpus: 6 papers; trusts 21 researchers and is trusted by 31 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 74 citations into it; #6,340 of 35,345 by trust here, #9,465 by citations
• Computational Theory and Mathematics — 41 citations into it; #1,755 of 12,182 by trust here, #1,983 by citations
• Privacy & Security — 28 citations into it
• Information Systems — 27 citations into it; #3,014 of 8,771 by trust here, #4,012 by citations
• Computer Networks and Communications — 12 citations into it; #7,224 of 9,886 by trust here, #5,733 by citations
• Computer Vision and Pattern Recognition — 9 citations into it; #13,745 of 21,575 by trust here, #20,756 by citations

Whom Daniel Wichs trusts overall

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

1. Craig Gentry
2. Silvio Micali
3. Oded Goldreich
4. Ran Canetti
5. Oded Regev
6. Amos Fiat
7. Chris Peikert
8. Dan Boneh
9. Zvika Brakerski
10. Adi Shamir

Who trusts Daniel Wichs overall

1. Shai Halevi
2. Michael Walfish
3. Hao Chen
4. Eli Ben-Sasson
5. Elette Boyle
6. Srinath T. V. Setty
7. Andrew Justin Blumberg
8. Melissa Chase
9. Benjamin Braun
10. Moni Naor

Papers from Daniel Wichs's perspective

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

1. On lattices, learning with errors, random linear codes, and cryptography
2. How to generate and exchange secrets
3. Computationally Sound Proofs
4. Private information retrieval
5. Short Signatures from the Weil Pairing
6. How to play ANY mental game
7. How to Prove Yourself: Practical Solutions to Identification and Signature Problems
8. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
9. On Ideal Lattices and Learning with Errors over Rings
10. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

Their papers

• Separating succinct non-interactive arguments from all falsifiable assumptions (2011) — 531 citations
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE (2012) — 519 citations
• Two Round Multiparty Computation via Multi-key FHE (2016) — 327 citations
• Private Anonymous Data Access (2019) — 33 citations
• Proofs of Retrievability via Hardness Amplification (2009) — 486 citations
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model (2009) — 310 citations