Yupeng Zhang
Artificial Intelligence · 2014–2019
A researcher in the Science corpus: 4 papers; trusts 56 researchers and is trusted by 94 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 75 citations into it; #2,661 of 35,345 by trust here, #6,157 by citations
- Computational Theory and Mathematics — 32 citations into it; #9,865 of 12,182 by trust here, #10,901 by citations
- Privacy & Security — 27 citations into it; #55 of 709 by trust here, #124 by citations
- Information Systems — 15 citations into it
- Computer Networks and Communications — 13 citations into it; #7,865 of 9,886 by trust here, #9,214 by citations
- Computer Vision and Pattern Recognition — 12 citations into it
- Program Analysis & Verification — 9 citations into it
- Automated Theorem Proving & Formal Methods — 6 citations into it
Whom Yupeng Zhang trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Silvio Micali
- Ran Canetti
- Rosario Gennaro
- Eli Ben-Sasson
- Nir Bitansky
- Craig Gentry
- Bryan Parno
- Srinath T. V. Setty
- Alessandro Chiesa
- Mihir Bellare
Who trusts Yupeng Zhang overall
- Florian Tramèr
- Sameer Wagh
- Raphael Bost
- M. Sadegh Riazi
- Dan Boneh
- Yang Liu
- Qiang Yang
- Divya Gupta
- Miran Kim
- Jiasi Chen
Papers from Yupeng Zhang's perspective
Ordered by how strongly the researchers Yupeng Zhang trusts endorse each paper. Same corpus, a different order for every researcher.
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The Knowledge Complexity of Interactive Proof Systems
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Random oracles are practical: a paradigm for designing efficient protocols
- Fully homomorphic encryption using ideal lattices
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Pinocchio: Nearly Practical Verifiable Computation
Their papers
- SecureML: A System for Scalable Privacy-Preserving Machine Learning (2017) — 2,156 citations
- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019) — 292 citations
- ALITHEIA: Towards Practical Verifiable Graph Processing (2014) — 31 citations
- All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption (2016) — 526 citations