Xiao Shaun Wang

Artificial Intelligence · 2015–2019

A researcher in the Science corpus: 8 papers; trusts 40 researchers and is trusted by 14 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 114 citations into it; #9,973 of 35,345 by trust here, #11,624 by citations
• Computational Theory and Mathematics — 71 citations into it; #2,756 of 12,182 by trust here, #1,936 by citations
• Privacy & Security — 33 citations into it
• Information Systems — 23 citations into it
• Computer Networks and Communications — 20 citations into it
• Electrical and Electronic Engineering — 14 citations into it
• Computer Vision and Pattern Recognition — 10 citations into it
• Game & Decision Theory — 5 citations into it

Whom Xiao Shaun Wang trusts overall

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

1. Yehuda Lindell
2. Benny Pinkas
3. Vladimir Kolesnikov
4. Oded Goldreich
5. Thomas Schneider
6. Rafail M. Ostrovsky
7. Samee Zahur
8. Elaine Shi
9. Mihir Bellare
10. Emil Stefanov

Who trusts Xiao Shaun Wang overall

1. Adrià Gascón
2. Marcella Hastings
3. Marcel Keller
4. Phillipp Schoppmann
5. Daniel Noble
6. Brett Hemenway
7. David E. Evans
8. Matteo Campanelli
9. Edo Roth
10. Borja Balle

Papers from Xiao Shaun Wang's perspective

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

1. Fair exchange with a semi-trusted third party (extended abstract)
2. Fairplay - Secure Two-Party Computation System
3. Protocols for secure computations
4. Faster Secure Two-Party Computation Using Garbled Circuits
5. TASTY: tool for automating secure two-party computations
6. How to play ANY mental game
7. Completeness theorems for non-cryptographic fault-tolerant distributed computation
8. FairplayMP: a system for secure multi-party computation
9. Fully homomorphic encryption using ideal lattices
10. How To Exchange Secrets with Oblivious Transfer

Their papers

• Global-Scale Secure Multiparty Computation (2017) — 224 citations
• ObliVM: A Programming Framework for Secure Computation (2015) — 376 citations
• GraphSC: Parallel Secure Computation Made Easy (2015) — 193 citations
• Faster Secure Two-Party Computation in the Single-Execution Setting (2017) — 51 citations
• Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound (2015) — 315 citations
• Scalable Private Set Union from Symmetric-Key Techniques (2019) — 85 citations
• Faster Two-Party Computation Secure Against Malicious Adversaries in the Single-Execution Setting (2016) — 14 citations
• Efficiently Enforcing Input Validity in Secure Two-party Computation (2016) — 25 citations