{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:56:01Z","timestamp":1757627761777,"version":"3.44.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["L244009,4232018"],"award-info":[{"award-number":["L244009,4232018"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271456"],"award-info":[{"award-number":["62271456"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,2]]},"DOI":"10.1109\/iwqos65803.2025.11143266","type":"proceedings-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:29:52Z","timestamp":1757438992000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["MPC-FLC: Accelerating Private Inference in MPC Through Full Layer Compression"],"prefix":"10.1109","author":[{"given":"Bo","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science, Beijing University of Technology,Beijing,China"}]},{"given":"Haiyang","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Technology,Beijing,China"}]},{"given":"Yuwen","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Technology,Beijing,China"}]},{"given":"Zhen","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Beijing University of Technology,Beijing,China"}]}],"member":"263","reference":[{"key":"ref1","article-title":"On the opportunities and risks of foundation models","author":"Bommasani","year":"2022","journal-title":"arXiv preprint"},{"key":"ref2","article-title":"Language models are few-shot learners","author":"Brown","year":"2020","journal-title":"arXiv preprint"},{"key":"ref3","article-title":"Xlnet: Generalized autoregressive pretraining for language understanding","author":"Yang","year":"2020","journal-title":"arXiv preprint"},{"key":"ref4","article-title":"Electra: Pretraining text encoders as discriminators rather than generators","author":"Clark","year":"2020","journal-title":"arXiv preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73012"},{"key":"ref6","article-title":"Mpcformer: Fast, performant and private transformer inference with mpc","volume-title":"Proceedings of the 11th International Conference on Learning Representations (ICLR).","author":"Li"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4140\/TCP.n.2015.249"},{"key":"ref8","article-title":"Gaussian error linear units (gelus)","author":"Hendrycks","year":"2023","journal-title":"arXiv preprint"},{"key":"ref9","article-title":"Fitnets: Hints for thin deep nets","author":"Romero","year":"2014","journal-title":"arXiv preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.372"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4828"},{"key":"ref12","article-title":"Llms can understand encrypted prompt: Towards privacy-computing friendly transformers","author":"Liu","year":"2023","journal-title":"arXiv preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.287"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3387108"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"ref16","first-page":"17","article-title":"Secretflow-spu: A performant and user-friendly framework for privacy-preserving machine learning","author":"Ma","year":"2023","journal-title":"Proc. USENIX Ann. Tech. Conf. (USENIX ATC)"},{"key":"ref17","article-title":"Crypten: Secure multi-party computation meets machine learning","author":"Knott","year":"2022","journal-title":"arXiv preprint"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835090"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref20","first-page":"809","article-title":"Cheetah: Lean and fast secure two-party deep neural network inference","author":"Huang","year":"2022","journal-title":"Proc. 31st USENIX Security Symp. (USENIX Security)"},{"key":"ref21","first-page":"35","article-title":"Aby3: A mixed protocol framework for machine learning","author":"Mohassel","year":"2018","journal-title":"Proc. ACM SIGSAC Conf. Comput. Commun. Security"},{"key":"ref22","article-title":"Puma: Secure inference of llama-7b in five minutes","author":"Dong","year":"2023","journal-title":"arXiv preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1907.11692"},{"key":"ref24","article-title":"Layernorm: A key component in parameter-efficient fine-tuning","author":"ValizadehAslani","year":"2024","journal-title":"arXiv preprint"},{"key":"ref25","volume-title":"The numerical treatment of a single nonlinear equation.","author":"Householder","year":"1970"},{"key":"ref26","article-title":"Huggingface\u2019s transformers: State-of-the-art natural language processing","author":"Wolf","year":"2019","journal-title":"arXiv preprint"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/w18-5446"},{"key":"ref28","article-title":"Corpus of linguistic acceptability (cola)","author":"Warstadt","year":"2019","journal-title":"Proc. Soc. Comput. Linguistics (SCiL)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D13-1170"},{"key":"ref30","article-title":"Automatically constructing a corpus of sentential paraphrases","author":"Dolan","year":"2005","journal-title":"Proc. Third Int. Workshop Paraphrasing (IWP)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/s17-2001"},{"key":"ref32","article-title":"Quora question pairs","author":"Chen","year":"2018","journal-title":"Proc. KDD"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1101"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1264"},{"key":"ref35","article-title":"The recognizing textual entailment (rte) challenges: A framework for machine learning of semantic inference","author":"Bentivogli","year":"2009","journal-title":"Proc. Text Analysis Conf. (TAC)"},{"key":"ref36","article-title":"The winograd schema challenge","author":"Levesque","year":"2012","journal-title":"Proc. 13th Int. Conf. Principles Knowledge Representation Reasoning"}],"event":{"name":"2025 IEEE\/ACM International Symposium on Quality of Service (IWQoS)","location":"Gold Coast, Australia","start":{"date-parts":[[2025,7,2]]},"end":{"date-parts":[[2025,7,4]]}},"container-title":["2025 IEEE\/ACM 33rd International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11143240\/11143247\/11143266.pdf?arnumber=11143266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T05:05:52Z","timestamp":1757480752000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11143266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/iwqos65803.2025.11143266","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]}}}