Y
Yupeng Zhang
Researcher at Texas A&M University
Publications - 40
Citations - 3008
Yupeng Zhang is an academic researcher from Texas A&M University. The author has contributed to research in topics: Computer science & Gas meter prover. The author has an hindex of 16, co-authored 32 publications receiving 1964 citations. Previous affiliations of Yupeng Zhang include The Chinese University of Hong Kong & University of Maryland, College Park.
Papers
More filters
Proceedings ArticleDOI
SecureML: A System for Scalable Privacy-Preserving Machine Learning
Payman Mohassel,Yupeng Zhang +1 more
TL;DR: This paper presents new and efficient protocols for privacy preserving machine learning for linear regression, logistic regression and neural network training using the stochastic gradient descent method, and implements the first privacy preserving system for training neural networks.
Posted Content
SecureML: A System for Scalable Privacy-Preserving Machine Learning.
Payman Mohassel,Yupeng Zhang +1 more
TL;DR: In this article, the authors present new and efficient protocols for privacy preserving machine learning for linear regression, logistic regression and neural network training using the stochastic gradient descent method, where data owners distribute their private data among two non-colluding servers who train various models on the joint data using secure two-party computation.
Proceedings Article
All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption
TL;DR: In this paper, file-injection attacks on the query privacy of searchable encryption (SE) schemes have been studied, in which the server sends files to the client that the client then encrypts and stores, and such attacks can reveal the client queries in their entirety using very few injected files.
Proceedings ArticleDOI
vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases
TL;DR: In this article, the authors present vSQL, a cryptographic protocol for publicly verifiable SQL queries on dynamic databases, which relies on two extensions of the CMT interactive-proof protocol: (i) supporting outsourced input via the use of a polynomial-delegation protocol with succinct proofs, and (ii) supporting auxiliary input efficiently.
Book ChapterDOI
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation
TL;DR: Libra is presented, the first zero-knowledge proof system that has both optimal prover time and succinct proof size/verification time and an one-time trusted setup that depends only on the size of the input to the circuit and not on the circuit logic.