- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the preprocessing problem in FSS-based secure inference, a well-chosen angle because while communication and latency in the online phase of FSS-based secure inference are already well optimized, research on the preprocessing phase is limited. This paper primarily focuses on how to obtain the required preprocessing from the distributed materials without increasing interaction or altering the online protocol, when the token capacity or FFN width is only determined after the preprocessing material is distributed. The authors propose Shape-Selective Correlation Conversion (SSCC), classifying materials into projective correlations, bilinear correlations requiring correction, and shape-specific correlations—a valuable observation. In a zero-interaction model with linear decoding of correlation shares, the authors prove matching upper and lower bounds on the number of additional scalar correlations and discuss the security of retaining all preprocessing material through conditional completion.
Critical strengths
-
The authors have effectively identified the bottleneck in the preprocessing stage. Compatibility between dynamic shapes and dealer-based preprocessing mechanisms is not easy, as preprocessing relies on fixed shapes, and the actual execution dimensions may only be determined in subsequent calculations. This paper proposes a solution to this problem.
-
Maintaining the existing online protocol is another point I appreciate, as it means the method can potentially be directly integrated into existing SIGMA/FuseFSS workflows.
-
The combined processing of capacity and width is also a significant contribution. This combined processing organizes the material into common parts, capacity-indexed parts, and width-indexed parts, which is clear and avoids duplicating a complete set of preprocessing material for each combination.
Critical weaknesses
-
The source of the cost advantage is not yet clear. The paper primarily compares two scenarios: "pre-preparing all shapes" and "generating only after shapes are determined." However, in reality, if unused fixed-shape materials can be safely reserved for subsequent requests, the system may only need to replenish the actually consumed portion. Always executing at the maximum shape is another viable option. The authors need to explain the feasibility of these options, what additional costs they incur, and under what conditions SSCC is more cost-effective than other scenarios.
-
The description of the Softmax method is inconsistent with storage statistics. The paper states in one place that some Softmax materials can be shared across different shapes, while in another place it prepares and bills all Softmax materials separately for different shapes. This seems contradictory to me, and I am unclear which implementation was actually used in the experiments. The authors should clarify which materials are shared and which are generated separately, allowing readers to determine the source of the storage savings.
-
The evidence for actual operational benefits is not complete. In the joint block experiment, online execution of SSCC was actually slower than fixed-shape execution, but the reason is not explained. The full MRPC request uses a separate HE/MPC system, which doesn't directly verify the actual benefits of SSCC.
-
End-to-end SSCC execution wasn't performed on the full trained model. I'm curious about the benefits of using SSCC on a full model.
Questions for authors
-
Does Appendix D.1 describe the actual running implementation or an optimization that has not yet been implemented?
-
Considering that Appendix F.1 exposes remapping information before selection, can unused fixed-shape instances be safely reserved for subsequent requests? If so, under what conditions would SSCC truly outperform such a preprocessing scheme?
-
Where does the performance gap as a function of width in Table 7 come from?
-
Can end-to-end SSCC be demonstrated on a trained model, even a small one?