<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">TACS</journal-id><journal-title-group><journal-title>Technology and Application of Computer Science</journal-title></journal-title-group><issn>2998-8926</issn><eissn>2998-8934</eissn><publisher><publisher-name>Art and Technology</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.61369/TACS.2026090008</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>基于 Paillier 加法同态加密的固定利率债券投资组合隐私估值方案</title><url>https://artdesignp.com/journal/TACS/3/9/10.61369/TACS.2026090008</url><author>张劼</author><pub-date pub-type="publication-year"><year>2026</year></pub-date><volume>3</volume><issue>9</issue><history><date date-type="pub"><published-time>2026-05-14</published-time></date></history><abstract>传统第三方债券估值要求资产所有者以明文暴露完整持仓，存在商业机密泄露风险。本文提出PP-BPV&amp;mdash;&amp;mdash; 基于Paillier 加法同态加密的债券组合隐私估值方案。方案利用DCF 模型的线性加权求和结构与加法同态的自然对应，通过&amp;ldquo;先按期聚合、后同态加密&amp;rdquo;策略，在客户端聚合同期现金流后加密发送，服务端在密文域完成贴现因子乘积累加，客户端解密获得净现值。在半诚实模型下基于DCR 假设给出了形式化安全证明。实验表明，HE 引入的估值误差低于1.71&amp;times;10-7，500只债券端到端耗时不超过15s，密文数量约230个且不随债券规模线性增长。</abstract><keywords>隐私保护计算,同态加密,Paillier 密码体制,债券组合估值,现金流折现,定点数编码</keywords></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>[1] C. Baum, J. Chiang, B. David, T. K. Frederiksen. SoK: Privacy-Enhancing Technologies in Finance. IACR Cryptology ePrint Archive, 2023/122, 2023.[2] R. De Cock, R. M. E. Steylaerts, V. Rijmen, B. Preneel. Privacy-preserving credit scoring using homomorphic encryption. In ESORICS DPM, 2017, pp. 65&amp;ndash;83.[3] R. Bost, R. A. Popa, S. Tu, S. Goldwasser. Machine learning classification over encrypted data. In NDSS, 2015.[4] S. Eloul, et al. PADL: Private, Auditable, and Distributed Ledger for Financial Institutes. arXiv:2501.03808, 2025.[5] C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pp. 169&amp;ndash;178, 2009.[6] A. C. Yao. Protocols for secure computations. In FOCS, pp. 160&amp;ndash;164, 1982.[7] V. Costan, S. Devadas. Intel SGX explained. IACR Cryptology ePrint Archive, 2016/086, 2016.[8] R. L. Rivest, L. Adleman, M. L. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, 1978, pp. 169&amp;ndash;179.[9] P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT, 1999, pp. 223&amp;ndash;238.[10] J. H. Cheon, A. Kim, M. Kim, Y. Song. Homomorphic encryption for arithmetic of approximate numbers. In ASIACRYPT, 2017, pp. 409&amp;ndash;437.[11] I. Chillotti, N. Gama, M. Georgieva, M. Izabach&amp;egrave;ne. TFHE: Fast fully homomorphic encryption over the torus. Journal of Cryptology, 2020, 33(1): 34&amp;ndash;91.[12] A. Polychroniadou, et al. Atlas-X Equity Financing: Unlocking New Methods to Securely Obfuscate Axe Inventory Data. IACR Cryptology ePrint Archive, 2024/461,2024.[13] S. Kadhe, H. Ludwig, N. Baracaldo, et al. PV4FAD: Privacy-Preserving Federated Anomaly Detection. arXiv:2310.19304, 2023.[14] 李晖, 李凤华, 曹珍富, 等. 隐私计算研究进展. 中国科学: 信息科学, 2019, 49(10): 1263&amp;ndash;1292.[15] 湖南大学. 基于区块链和隐私计算的数字债券风险评估方法及系统. 中国发明专利, CN120823028A, 2025.[16] O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2004.[17] M. Naor, B. Pinkas. Efficient oblivious transfer protocols. In SODA, 2001, pp. 448&amp;ndash;457.[18] B. B&amp;uuml;nz, J. Bootle, D. Boneh, et al. Bulletproofs: Short proofs for confidential transactions and more. In IEEE S&amp;amp;P, 2018, pp. 315&amp;ndash;334.[19] F. Ballabio. QuantLib: A Free/Open-Source Library for Quantitative Finance, 2000&amp;ndash;2024. https://www.quantlib.org/</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
