{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:08:50Z","timestamp":1763536130579},"reference-count":69,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,7,1]]},"DOI":"10.1587\/transinf.2023edp7043","type":"journal-article","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T22:19:05Z","timestamp":1688163545000},"page":"1219-1229","source":"Crossref","is-referenced-by-count":3,"title":["ZGridBC: Zero-Knowledge Proof Based Scalable and Privacy-Enhanced Blockchain Platform for Electricity Tracking"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Takeshi","family":"MIYAMAE","sequence":"first","affiliation":[{"name":"Data & Security Research Laboratory, Fujitsu Limited"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fumihiko","family":"KOZAKURA","sequence":"additional","affiliation":[{"name":"Data & Security Research Laboratory, Fujitsu Limited"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"NAKAMURA","sequence":"additional","affiliation":[{"name":"Data & Security Research Laboratory, Fujitsu Limited"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masanobu","family":"MORINAGA","sequence":"additional","affiliation":[{"name":"Data & Security Research Laboratory, Fujitsu Limited"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] Ministry of Economy, Trade and Industry, \u201cJapan's 2050 Carbon Neutral Goal,\u201d 2020. (accessed 29 Jan. 2023) https:\/\/www.meti.go.jp\/english\/policy\/energy_environment\/global_warming\/roadmap\/report\/20201111.html"},{"key":"2","unstructured":"[2] Ministry of Economy, Trade and Industry, \u201cFIT-Based Contracts between Household Consumers and Electricity Companies Start to Expire Sequentially,\u201d 2019. (accessed 29 Jan. 2023) https:\/\/www.meti.go.jp\/english\/press\/2019\/1101_001.html"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] H. Farhangi, \u201cThe path of the smart grid,\u201d IEEE Power Energy Mag., vol.8, no.1, pp.18-28, 2010. 10.1109\/mpe.2009.934876","DOI":"10.1109\/MPE.2009.934876"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] V.C. Gungor, D. Sahin, T. Kocak, S. Ergut, C. Buccella, C. Cecati, and G.P. Hancke, \u201cSmart Grid Technologies: Communication Technologies and Standards,\u201d IEEE Trans. Ind. Informat., vol.7, no.4, pp.529-539, 2011. 10.1109\/tii.2011.2166794","DOI":"10.1109\/TII.2011.2166794"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] X. Fang, S. Misra, G. Xue, and D. Yang, \u201cSmart Grid \u2014 The New and Improved Power Grid: A Survey,\u201d IEEE Communications Surveys & Tutorials, vol.14, no.4, pp.944-980, 2012. 10.1109\/surv.2011.101911.00087","DOI":"10.1109\/SURV.2011.101911.00087"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Mihaylov, S. Jurado, N. Avellana, K.Van Moffaert, I.M. de Abril, and A. Now\u00e9, \u201cNRGcoin: Virtual Currency for Trading of Renewable Energy in Smart Grids,\u201d 11th International Conference on the European Energy Market (EEM), pp.1-6, 2014. 10.1109\/eem.2014.6861213","DOI":"10.1109\/EEM.2014.6861213"},{"key":"7","unstructured":"[7] S. Nakamoto, \u201cBitcoin: A Peer-to-Peer Electronic Cash System,\u201d 2008. (accessed 30 Jan. 2023) https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] N.Z. Aitzhan and D. Svetinovic, \u201cSecurity and Privacy in Decentralized Energy Trading Through Multi-Signatures, Blockchain and Anonymous Messaging Streams,\u201d IEEE Transactions on Dependable and Secure Computing, vol.15, no.5, pp.840-852, 2018. 10.1109\/tdsc.2016.2616861","DOI":"10.1109\/TDSC.2016.2616861"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] K. Gai, Y. Wu, L. Zhu, L. Xu, and Y. Zhang, \u201cPermissioned Blockchain and Edge Computing Empowered Privacy-Preserving Smart Grid Networks,\u201d IEEE Internet Things J., vol.6, no.5, pp.7992-8004, 2019. 10.1109\/jiot.2019.2904303","DOI":"10.1109\/JIOT.2019.2904303"},{"key":"10","unstructured":"[10] T. Miyamae and K. Matsuura, \u201cPrivacy Analysis and Evaluation Policy of Blockchain-based Anonymous Cryptocurrencies.\u201d arXiv:2012.10563v1, 2020. (accessed 30 Jan. 2023) https:\/\/arxiv.org\/abs\/2012.10563v1"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] T. Miyamae, S. Nishimaki, M. Nakamura, T. Fukuoka, and M. Morinaga, \u201cAdvanced Ledger: Supply Chain Management with Contribution Trails and Fair Reward Distribution,\u201d IEEE International Conference on Blockchain (Blockchain) FBS Workshop, pp.435-442, 2022. 10.1109\/blockchain55522.2022.00067","DOI":"10.1109\/Blockchain55522.2022.00067"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] T. Miyamae and K. Matsuura, \u201cCoin Transfer Unlinkability Under the Counterparty Adversary Model,\u201d Ledger, vol.7, pp.17-34, 2022. 10.5195\/ledger.2022.260","DOI":"10.5195\/ledger.2022.260"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Z. Guan, G. Si, X. Zhang, L. Wu, N. Guizani, X. Du, and Y. Ma, \u201cPrivacy-Preserving and Efficient Aggregation Based on Blockchain for Power Grid Communications in Smart Communities,\u201d IEEE Commun. Mag., vol.56, no.7, pp.82-88, 2018. 10.1109\/mcom.2018.1700401","DOI":"10.1109\/MCOM.2018.1700401"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] M. Fan and X. Zhang, \u201cConsortium Blockchain Based Data Aggregation and Regulation Mechanism for Smart Grid,\u201d IEEE Access, vol.7, pp.35929-35940, 2019. 10.1109\/access.2019.2905298","DOI":"10.1109\/ACCESS.2019.2905298"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] H. Fan, Y. Liu, and Z. Zeng, \u201cDecentralized Privacy-Preserving Data Aggregation Scheme for Smart Grid Based on Blockchain,\u201d Sensors, vol.20, no.18, p.5282, 2020. 10.3390\/s20185282","DOI":"10.3390\/s20185282"},{"key":"16","unstructured":"[16] J. Poon and V. Buterin, \u201cPlasma: Scalable Autonomous Smart Contracts,\u201d 2017. (accessed 30 Jan. 2023) https:\/\/plasma.io\/plasma.pdf"},{"key":"17","unstructured":"[17] Ethereum community, \u201cPlasma Chains,\u201d 2022. (accessed 30 Jan. 2023) https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/plasma\/"},{"key":"18","unstructured":"[18] K. Floersch, \u201cEthereum Smart Contracts in L2: Optimistic Rollup,\u201d 2019. (accessed 30 Jan. 2023) https:\/\/medium.com\/plasma-group\/ethereum-smart-contracts-in-l2-optimistic-rollup-2c1cef2ec537"},{"key":"19","unstructured":"[19] M. Armstrong, \u201cEthereum, Smart Contracts and the Optimistic Roll-up,\u201d 2021. (accessed 30 Jan. 2023) https:\/\/www.scss.tcd.ie\/Donal.OMahony\/bfg\/202021\/TCD-SCSS-FYP-2021-008.pdf"},{"key":"20","unstructured":"[20] Optimism community, \u201cOptimism Official Website,\u201d 2022. (accessed 30 Jan. 2023) https:\/\/www.optimism.io\/"},{"key":"21","unstructured":"[21] H. Kalodner, S. Goldfeder, X. Chen, S.M. Weinberg, and E.W. Felten, \u201cArbitrum: Scalable, private smart contracts,\u201d 27th USENIX Security Symposium, pp.1353-1370, 2018."},{"key":"22","unstructured":"[22] V. Buterin, \u201cOn-chain scaling to potentially 500 tx\/sec through mass tx validation,\u201d 2018. (accessed 30 Jan. 2023) https:\/\/ethresear.ch\/t\/on-chain-scaling-to-potentially-500-tx-sec-through-mass-tx-validation\/3477"},{"key":"23","unstructured":"[23] D. Wang, J. Zhou, A. Wang, and M. Finestone, \u201cLoopring: A Decentralized Token Exchange Protocol,\u201d 2018. (accessed 30 Jan. 2023) https:\/\/epicfundsllc.com\/wp-content\/uploads\/2020\/12\/en_whitepaper.pdf"},{"key":"24","unstructured":"[24] StarkWare, \u201cSTARKs over Mainnet,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/medium.com\/starkware\/starks-over-mainnet-b83e63db04c0"},{"key":"25","unstructured":"[25] zkSync community, \u201czkSync Official Website,\u201d 2022. (accessed 30 Jan. 2023) https:\/\/zksync.io\/"},{"key":"26","unstructured":"[26] Polygon zkEVM Documentation, \u201cHermez 1.0,\u201d 2022. (accessed 30 Jan. 2023) https:\/\/docs.hermez.io\/Hermez_1.0\/about\/scalability\/"},{"key":"27","unstructured":"[27] B. DiFrancesco, \u201cValidium And The Layer 2 Two-By-Two-Issue no.99,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/www.buildblockchain.tech\/newsletter\/issues\/no-99-validium-and-the-layer-2-two-by-two"},{"key":"28","unstructured":"[28] A. Gluchowski, \u201czkRollup vs. Validium,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/blog.matter-labs.io\/zkrollup-vs-validium-starkex-5614e38bc263"},{"key":"29","unstructured":"[29] S. Richards, \u201cValidium,\u201d 2022. (accessed 30 Jan. 2023) https:\/\/ethereum.org\/en\/developers\/docs\/scaling\/validium\/"},{"key":"30","unstructured":"[30] Matter Labs, \u201czkPorter: a breakthrough in L2 scaling,\u201d 2021. (accessed 30 Jan. 2023) https:\/\/blog.matter-labs.io\/zkporter-a-breakthrough-in-l2-scaling-ed5e48842fbf"},{"key":"31","unstructured":"[31] K. Sayood, Introduction to Data Compression, Fourth Edition, Morgan Kaufmann Publishers Inc., 1992. 10.1016\/b978-012620862-7\/50018-3"},{"key":"32","doi-asserted-by":"crossref","unstructured":"[32] D.E. Eastlake and T. Hansen, \u201cRFC 4634: US Secure Hash Algorithms (SHA and HMAC-SHA),\u201d 2012. (accessed 29 Jan. 2023) https:\/\/tools.ietf.org\/html\/rfc4634","DOI":"10.17487\/rfc6234"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] E.B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza, \u201cZerocash: Decentralized Anonymous Payments from Bitcoin,\u201d 35th IEEE Symposium on Security and Privacy (S&P), pp.459-474, 2014. 10.1109\/sp.2014.36","DOI":"10.1109\/SP.2014.36"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] S. Delgado-Segura, C. P\u00e9rez-Sol\u00e0, G. Navarro-Arribas, and J. Herrera-Joancomart\u00ed, \u201cAnalysis of the Bitcoin UTXO Set,\u201d 22nd International Conference on Financial Cryptography and Data Security, vol.10958, pp.78-91, 2019. 10.1007\/978-3-662-58820-8_6","DOI":"10.1007\/978-3-662-58820-8_6"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] J. Groth, \u201cOn the Size of Pairing-Based Non-interactive Arguments,\u201d 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.9666 of LNCS, pp.305-326, 2016. 10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"36","unstructured":"[36] The Linux Foundation, \u201cHyperledger Fabric,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/www.hyperledger.org\/use\/fabric"},{"key":"37","unstructured":"[37] The Linux Foundation, \u201cHyperledger Architecture, Volume 1,\u201d 2017. (accessed 30 Jan. 2023) https:\/\/www.hyperledger.org\/wp-content\/uploads\/2017\/08\/Hyperledger_Arch_WG_Paper_1_Consensus.pdf"},{"key":"38","unstructured":"[38] The Linux Foundation, \u201cHyperledger Architecture, Volume 2: Smart Contracts,\u201d 2018. (accessed 30 Jan. 2023) https:\/\/www.hyperledger.org\/wp-content\/uploads\/2018\/04\/Hyperledger_Arch_WG_Paper_2_SmartContracts.pdf"},{"key":"39","unstructured":"[39] Ethereum community, \u201cEthereum Project,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/ethereum.org\/"},{"key":"40","unstructured":"[40] Ycharts, \u201cEthereum Average Transaction Fee,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/ycharts.com\/indicators\/ethereum_average_transaction_fee"},{"key":"41","unstructured":"[41] Agency for Natural Resources and Energy, METI, \u201cThe Exchange Market of the Non-fossil Environmental Value (Japanese Document),\u201d 2021. (accessed 29 Jan. 2023) https:\/\/www.meti.go.jp\/shingikai\/enecho\/denryoku_gas\/denryoku_gas\/seido_kento\/pdf\/057_03_01.pdf"},{"key":"42","unstructured":"[42] Ycharts, \u201cEthereum Transactions Per Day,\u201d 2020. (accessed 30 Jan. 2023) https:\/\/ycharts.com\/indicators\/ethereum_transactions_per_day"},{"key":"43","doi-asserted-by":"crossref","unstructured":"[43] B. Parno, J. Howell, C. Gentry, and M. Raykova, \u201cPinocchio: Nearly Practical Verifiable Computation,\u201d 34th IEEE Symposium on Security and Privacy (S&P), pp.238-252, 2013. 10.1109\/sp.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"44","unstructured":"[44] E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza, \u201cSuccinct Non-Interactive Zero Knowledge for a von Neumann Architecture,\u201d 23rd USENIX Security Symposium, vol.1, pp.781-796, 2014."},{"key":"45","doi-asserted-by":"crossref","unstructured":"[45] T. Xie, J. Zhang, Y. Zhang, C. Papamanthou, and D. Song, \u201cLibra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation,\u201d 39th Annual International Cryptology Conference (CRYPTO), vol.11694 of LNCS, pp.733-764, 2019. 10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"46","unstructured":"[46] E. S\u00e1nchez Ortiz, \u201cZero-Knowledge Proofs applied to finance,\u201d 2020. (accessed 29 Jan. 2023) http:\/\/essay.utwente.nl\/83802\/"},{"key":"47","doi-asserted-by":"publisher","unstructured":"[47] S. Micali, \u201cComputationally Sound Proofs,\u201d Society for Industrial and Applied Mathematics (SIAM Journal), vol.30, no.4, pp.1253-1298, 2000. 10.1137\/s0097539795284959","DOI":"10.1137\/S0097539795284959"},{"key":"48","doi-asserted-by":"crossref","unstructured":"[48] J. Bootle, A. Cerulli, P. Chaidos, J. Groth, and C. Petit, \u201cEfficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting,\u201d 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.9666 of LNCS, pp.327-357, 2016. 10.1007\/978-3-662-49896-5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"49","doi-asserted-by":"publisher","unstructured":"[49] J. Groth, R. Ostrovsky, and A. Sahai, \u201cPerfect Non-interactive Zero Knowledge for NP,\u201d 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.4004 of LNCS, pp.339-358, 2006. 10.1007\/11761679_21","DOI":"10.1007\/11761679_21"},{"key":"50","unstructured":"[50] K. Gurkan, \u201cCreating fake zkSNARK proofs,\u201d 2018. (accessed 29 Jan. 2023) https:\/\/medium.com\/qed-it\/how-toxic-is-the-waste-in-a-zksnark-trusted-setup-9b250d59bdb4"},{"key":"51","doi-asserted-by":"crossref","unstructured":"[51] R. Cramer and I. Damg\u00e5rd, \u201cZero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?,\u201d 18th Annual International Cryptology Conference (CRYPTO), vol.1462 of LNCS, pp.424-441, 1998. 10.1007\/bfb0055745","DOI":"10.1007\/BFb0055745"},{"key":"52","doi-asserted-by":"crossref","unstructured":"[52] J. Groth, \u201cLinear Algebra with Sub-linear Zero-Knowledge Arguments,\u201d 29th Annual International Cryptology Conference (CRYPTO), vol.5677 of LNCS, pp.192-208, 2009. 10.1007\/978-3-642-03356-8_12","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"53","doi-asserted-by":"crossref","unstructured":"[53] J.H. Seo, \u201cRound-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra,\u201d 14th International Conference on Practice and Theory in Public Key Cryptography (PKC), vol.6571 of LNCS, pp.387-402, 2011. 10.1007\/978-3-642-19379-8_24","DOI":"10.1007\/978-3-642-19379-8_24"},{"key":"54","doi-asserted-by":"crossref","unstructured":"[54] S. Bayer and J. Groth, \u201cEfficient Zero-Knowledge Argument for Correctness of a Shuffle,\u201d 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.7237 of LNCS, pp.263-280, 2012. 10.1007\/978-3-642-29011-4_17","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"55","doi-asserted-by":"publisher","unstructured":"[55] S. Bayer and J. Groth, \u201cZero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists,\u201d 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.7881 of LNCS, pp.646-663, 2013. 10.1007\/978-3-642-38348-9_38","DOI":"10.1007\/978-3-642-38348-9_38"},{"key":"56","doi-asserted-by":"crossref","unstructured":"[56] B. B\u00fcnz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell, \u201cBulletproofs: Short Proofs for Confidential Transactions and More,\u201d IEEE Symposium on Security and Privacy (S&P), pp.315-334, 2018. 10.1109\/sp.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"57","doi-asserted-by":"crossref","unstructured":"[57] J. Groth, M. Kohlweiss, M. Maller, S. Meiklejohn, and I. Miers, \u201cUpdatable and Universal Common Reference Strings with Applications to zk-SNARKs,\u201d 38th Annual International Cryptology Conference (CRYPTO), vol.10993 of LNCS, pp.698-728, 2018. 10.1007\/978-3-319-96878-0_24","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"58","doi-asserted-by":"crossref","unstructured":"[58] M. Maller, S. Bowe, M. Kohlweiss, and S. Meiklejohn, \u201cSonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings,\u201d ACM SIGSAC Conference on Computer and Communications Security (CCS), pp.2111-2128, 2019. 10.1145\/3319535.3339817","DOI":"10.1145\/3319535.3339817"},{"key":"59","unstructured":"[59] A. Gabizon, Z.J. Williamson, and O. Ciobotaru, \u201cPlonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge,\u201d Cryptology ePrint Archive, Paper 2019\/953, 2019. (accessed 29 Jan. 2023) https:\/\/eprint.iacr.org\/2019\/953"},{"key":"60","unstructured":"[60] S. Williams, V. Diordiiev, L. Berman, I. Raybould, and I. Uemlianin, \u201cArweave: A Protocol for Economically Sustainable Information Permanence,\u201d 2019. (accessed 6 March 2023) https:\/\/yellow-paper.arweave.dev\/"},{"key":"61","unstructured":"[61] Electric Coin Company, \u201cParameter Generation,\u201d 2020. (accessed 29 Jan. 2023) https:\/\/z.cash\/technology\/paramgen\/"},{"key":"62","unstructured":"[62] R. Fatima, \u201cThe Trusted Setup of ZK-SNARK,\u201d 2022. (accessed 29 Jan. 2023) https:\/\/xord.com\/research\/the-trusted-setup-of-zk-snark\/"},{"key":"63","unstructured":"[63] scipr-lab, \u201clibsnark: a C++ library for zkSNARK proofs,\u201d 2020. (accessed 29 Jan. 2023) https:\/\/github.com\/scipr-lab\/libsnark"},{"key":"64","doi-asserted-by":"publisher","unstructured":"[64] R. Gennaro, C. Gentry, B. Parno, and M. Raykova, \u201cQuadratic span programs and succinct NIZKs without PCPs,\u201d Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), vol.7881, pp.626-645, 2013. 10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"65","unstructured":"[65] matter-labs, \u201cbellman \u201cCommunity edition\u201d,\u201d 2020. (accessed 29 Jan. 2023) https:\/\/github.com\/matter-labs\/bellman"},{"key":"66","unstructured":"[66] S. Bowe, \u201cBellman: zk-SNARKs in Rust,\u201d 2017. (accessed 29 Jan. 2023) https:\/\/electriccoin.co\/blog\/bellman-zksnarks-in-rust\/"},{"key":"67","unstructured":"[67] matter-labs, \u201csapling-crypto \u201cCommunity edition\u201d,\u201d 2020. (accessed 29 Jan. 2023) https:\/\/github.com\/matter-labs\/sapling-crypto"},{"key":"68","doi-asserted-by":"crossref","unstructured":"[68] S. Josefsson and I. Liusvaara, \u201cEdwards-Curve Digital Signature Algorithm (EdDSA),\u201d Internet Research Task Force (IRTF), Crypto Forum Research Group, RFC 8032, 2017. (accessed 29 Jan. 2023) https:\/\/tools.ietf.org\/html\/rfc8032","DOI":"10.17487\/RFC8032"},{"key":"69","doi-asserted-by":"crossref","unstructured":"[69] D.J. Bernstein, N. Duif, T. Lange, P. Schwabe, and B.-Y. Yang, \u201cHigh-speed high-security signatures,\u201d Journal of Cryptographic Engineering, vol.2, pp.77-89, 2012. 10.1007\/s13389-012-0027-1","DOI":"10.1007\/s13389-012-0027-1"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/7\/E106.D_2023EDP7043\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T04:22:44Z","timestamp":1688185364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/7\/E106.D_2023EDP7043\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,1]]},"references-count":69,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2023edp7043","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,1]]},"article-number":"2023EDP7043"}}