Page 138 - 《软件学报》2026年第1期

何嘉昊 等: 国产区块链软件发展趋势与核心技术分析 135

[89] Anderson JC, Lehnardt J, Slater N. CouchDB: The Definitive Guide: Time to Relax. Sebastopol: O’Reilly Media, 2010.
[90] Z-Ledger. Ziggurat blockchain white paper. 2018 (in Chinese). https://static.zhigui.com/Ziggurat_Blockchain_WhitePaper_2018.pdf
[91] Codd EF. Relational database: A practical foundation for productivity. Communications of the ACM, 1982, 25(2): 109–117. [doi: 10.
1145/358396.358400]
[92] Puangsaijai W, Puntheeranurak S. A comparative study of relational database and key-value database for big data applications. In: Proc.
of the 2017 Int’l Electrical Engineering Congress (iEECON). Pattaya: IEEE, 2017. 1–4. [doi: 10.1109/IEECON.2017.8075813]
[93] Han J, E HH, Le G, Du J. Survey on NoSQL database. In: Proc. of the 6th Int’l Conf. on Pervasive Computing and Applications. Port
Elizabeth: IEEE, 2011. 363–366. [doi: 10.1109/ICPCA.2011.6106531]
[94] Hankerson D, Vanstone S, Menezes A. Guide to Elliptic Curve Cryptography. New York: Springer, 2004. [doi: 10.1007/b97644]
[95] SM2. Crate SM2. 2024. https://docs.rs/sm2/latest/sm2/
[96] Johnson D, Menezes A, Vanstone S. The elliptic curve digital signature algorithm (ECDSA). Int’l Journal of Information Security, 2001,
1(1): 36–63. [doi: 10.1007/s102070100002]
[97] Simmons GJ. Symmetric and asymmetric encryption. ACM Computing Surveys, 1979, 11(4): 305–330. [doi: 10.1145/356789.356793]
[98] Koblitz N. An elliptic curve implementation of the finite field digital signature algorithm. In: Proc. of the 18th Annual Int’l Cryptology
Conf. Lecture Notes in Computer Science. 1998. 327–337. Berlin: Springer. [doi: 10.1007/BFb0055739]
[99] Hash algorithm. 2024. https://en.wikipedia.org/wiki/Cryptographic_hash_function
[100] Ramanujam S, Karuppiah M. Designing an algorithm with high avalanche effect. IJCSNS Int’l Journal of Computer Science and
Network Security, 2011, 11(1): 106–111.
[101] Secp256k1. Crate Secp256k1. 2024. https://docs.rs/secp256k1/latest/secp256k1/
[102] Nechvatal J, Barker E, Bassham L, Burr W, Dworkin M, Foti J, Roback E. Report on the development of the advanced encryption
standard (AES). Journal of Research of the National Institute of Standards and Technology, 2001, 106(3): 511–577. [doi: 10.6028/jres.
106.023]
[103] Tsiounis Y, Yung M. On the security of ElGamal based encryption. In: Proc. of the 1st Int’l Workshop on Public Key Cryptography.
Pacifico Yokohama: Springer, 1998. 117–134. [doi: 10.1007/BFb0054019]
[104] Paillier P, Pointcheval D. Efficient public-key cryptosystems provably secure against active adversaries. In: Proc. of the 1999 Int’l Conf.
on the Theory and Application of Cryptology and Information Security. Singapore: Springer, 1999. 165–179. [doi: 10.1007/978-3-540-
48000-6_14]
[105] Bünz B, Bootle J, Boneh D, Poelstra A, Wuille P, Maxwell G. BulletProofs: Short proofs for confidential transactions and more. In:
Proc. of the 2018 IEEE Symp. on Security and Privacy (SP). San Francisco: IEEE, 2018. 315–334. [doi: 10.1109/SP.2018.00020]
[106] Acar A, Aksu H, Uluagac AS, Conti M. A survey on homomorphic encryption schemes: Theory and implementation. ACM Computing
Surveys, 2018, 51(4): 79. [doi: 10.1145/3214303]
[107] Barrett P. Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Proc.
of the 1987 Conf. on the Theory and Application of Cryptographic Techniques. Berlin: Springer, 1987. 311–323. [doi: 10.1007/3-540-
47721-7_24]
[108] Appel AW. Verification of a cryptographic primitive: SHA-256. ACM Trans. on Programming Languages and Systems, 2015, 37(2): 7.
[doi: 10.1145/2701415]
[109] Bertoni G, Daemen J, Peeters M, van Assche G. The Keccak SHA-3 submission. 2011. https://keccak.team/files/Keccak-submission-3.pdf
[110] Aumasson JP, Neves S, Wilcox-O’Hearn Z, Winnerlein C. BLAKE2: Simpler, smaller, fast as MD5. In: Proc. of the 11th Int’l Conf. on
Applied Cryptography and Network Security. Banff: Springer, 2013. 119–135. [doi: 10.1007/978-3-642-38980-1_8]
[111] De Santis A, Persiano G. Zero-knowledge proofs of knowledge without interaction. In: Proc. of the 33rd Annual Symp. on Foundations
of Computer Science. Pittsburgh: IEEE, 1992. 427–436. [doi: 10.1109/SFCS.1992.267809]
[112] Eagen L, Kanjalkar S, Ruffing T, Nick J. BulletProofs++: Next generation confidential transactions via reciprocal set membership
arguments. In: Proc. of the 43rd Annual Int’l Conf. on the Theory and Applications of Cryptographic Techniques. Zurich: Springer.
249–279. [doi: 10.1007/978-3-031-58740-5_9]
[113] Pinto AM. An introduction to the use of zk-SNARKs in blockchains. In: Proc. of the 1st Int’l Conf. on Mathematical Research for
Blockchain Economy. Santorini: Springer, 2020. 233–249. [doi: 10.1007/978-3-030-37110-4_16]
[114] Canetti R, Hohenberger S. Chosen-ciphertext secure proxy re-encryption. In: Proc. of the 14th ACM Conf. on Computer and
Communications Security. Alexandria: ACM, 2007. 185–194. [doi: 10.1145/1315245.1315269]
[115] Loe AF, Quaglia EA. You shall not join: A measurement study of cryptocurrency peer-to-peer bootstrapping techniques. In: Proc. of the
2019 ACM SIGSAC Conf. on Computer and Communications Security. London: ACM, 2019. 2231–2247. [doi: 10.1145/3319535.