Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mingchun Zhuang

dblp:331/5536 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
0.612022
NFGen: Automatic Non-linear Function Evaluation Code Generator for General-purpose MPC Platforms · CCS 2022
Mathematical optimization › approximation theory
polynomial approximation
0.212022
NFGen: Automatic Non-linear Function Evaluation Code Generator for General-purpose MPC Platforms · CCS 2022

Methods — techniques the papers use, named apart from their topics

performance prediction · 1.1piecewise-polynomial approximation · 0.6piecewise polynomial approximation · 0.6
YearPublicationVenuePosition
2022 NFGen: Automatic Non-linear Function Evaluation Code Generator for General-purpose MPC Platforms
abstract
Due to the absence of a library for non-linear function evaluation, so-called general-purpose secure multi-party computation (MPC) are not as "general'' as MPC programmers expect. Prior arts either naively reuse plaintext methods, resulting in suboptimal performance and even incorrect results, or handcraft ad hoc approximations for specific functions or platforms. We propose a general technique, NFGen1, that utilizes pre-computed discrete piecewise polynomials to accurately approximate generic functions using fixed-point numbers. We implement it using a performance-prediction-based code generator to support different platforms. Conducting extensive evaluations of 23 non-linear functions against six MPC protocols on two platforms, we demonstrate significant performance, accuracy, and generality improvements over existing methods.
Kun Chen 0004, Guosai Wang, Mingchun Zhuang, Yi Li 0005, Wei Xu 0005
CCS4