使用非交互式零知识证明进行网络保密交易余额验证

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Informatica Pub Date : 2024-08-19 DOI:10.15388/24-infor564
Aušrys Kilčiauskas, Antanas Bendoraitis, Eligijus Sakalauskas
{"title":"使用非交互式零知识证明进行网络保密交易余额验证","authors":"Aušrys Kilčiauskas, Antanas Bendoraitis, Eligijus Sakalauskas","doi":"10.15388/24-infor564","DOIUrl":null,"url":null,"abstract":"One of the main trends for the monitoring and control of business processes is to implement these processes via private blockchain systems. These systems must ensure data privacy and verifiability for the entire network here denoted by ‘Net’. In addition, every business activity should be declared to a trusted third party (TTP), such as an Audit Authority (AA), for tax declaration and collection purposes.We present a solution for a confidential and verifiable realization of transactions based on the Unspent Transaction Output (UTxO) paradigm. This means that the total sum of transaction inputs (incomes) <span><span>$In$</span></span> must be equal to the total sum of transaction outputs (expenses) <span><span>$Ex$</span></span>, satisfying the balance equation <span><span>$In=Ex$</span></span>. Privacy in a private blockchain must be achieved through the encryption of actual transaction values. However, it is crucial that all participants in the network be able to verify the validity of the transaction balance equation. This poses a challenge with probabilistically encrypted data. Moreover, the inputs and outputs are encrypted with different public keys. With the introduction of the AA, the number of different public keys for encryption can be reduced to two. Incomes are encrypted with the Receiver’s public key and expenses with the AA’s public key.The novelty of our realization lies in taking additively-multiplicative, homomorphic ElGamal encryption and integrating it with a proposed paradigm of modified Schnorr identification providing a non-interactive zero-knowledge proof (NIZKP) using a cryptographically secure h-function. Introducing the AA as a structural element in a blockchain system based on the UTxO enables effective verification of encrypted transaction data for the Net. This is possible because the proposed NIZKP is able to prove the equivalency of two ciphertexts encrypted with two different public keys and different actors.This integration allows all users on the Net to check the UTxO-based transaction balance equation on encrypted data. The security considerations of the proposed solution are presented.\nPDF&nbsp;&nbsp;XML","PeriodicalId":56292,"journal":{"name":"Informatica","volume":"61 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Confidential Transaction Balance Verification by the Net Using Non-Interactive Zero-Knowledge Proofs\",\"authors\":\"Aušrys Kilčiauskas, Antanas Bendoraitis, Eligijus Sakalauskas\",\"doi\":\"10.15388/24-infor564\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the main trends for the monitoring and control of business processes is to implement these processes via private blockchain systems. These systems must ensure data privacy and verifiability for the entire network here denoted by ‘Net’. In addition, every business activity should be declared to a trusted third party (TTP), such as an Audit Authority (AA), for tax declaration and collection purposes.We present a solution for a confidential and verifiable realization of transactions based on the Unspent Transaction Output (UTxO) paradigm. This means that the total sum of transaction inputs (incomes) <span><span>$In$</span></span> must be equal to the total sum of transaction outputs (expenses) <span><span>$Ex$</span></span>, satisfying the balance equation <span><span>$In=Ex$</span></span>. Privacy in a private blockchain must be achieved through the encryption of actual transaction values. However, it is crucial that all participants in the network be able to verify the validity of the transaction balance equation. This poses a challenge with probabilistically encrypted data. Moreover, the inputs and outputs are encrypted with different public keys. With the introduction of the AA, the number of different public keys for encryption can be reduced to two. Incomes are encrypted with the Receiver’s public key and expenses with the AA’s public key.The novelty of our realization lies in taking additively-multiplicative, homomorphic ElGamal encryption and integrating it with a proposed paradigm of modified Schnorr identification providing a non-interactive zero-knowledge proof (NIZKP) using a cryptographically secure h-function. Introducing the AA as a structural element in a blockchain system based on the UTxO enables effective verification of encrypted transaction data for the Net. This is possible because the proposed NIZKP is able to prove the equivalency of two ciphertexts encrypted with two different public keys and different actors.This integration allows all users on the Net to check the UTxO-based transaction balance equation on encrypted data. The security considerations of the proposed solution are presented.\\nPDF&nbsp;&nbsp;XML\",\"PeriodicalId\":56292,\"journal\":{\"name\":\"Informatica\",\"volume\":\"61 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.15388/24-infor564\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Informatica","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.15388/24-infor564","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

监测和控制业务流程的主要趋势之一是通过私有区块链系统实施这些流程。这些系统必须确保整个网络的数据隐私和可验证性,这里用 "Net "表示。此外,每项业务活动都应向可信第三方(TTP)(如审计机构(AA))申报,以达到申报和收税的目的。我们提出了一种基于未花费交易输出(UTxO)范式的保密且可验证的交易实现解决方案。这意味着交易输入(收入)总和$In$必须等于交易输出(支出)总和$Ex$,满足平衡方程$In=Ex$。私人区块链的隐私必须通过对实际交易值加密来实现。但是,网络中的所有参与者都必须能够验证交易平衡方程的有效性。这给概率加密数据带来了挑战。此外,输入和输出是用不同的公开密钥加密的。引入 AA 后,用于加密的不同公开密钥的数量可减少到两个。我们实现的新颖之处在于采用了加法-乘法、同态的 ElGamal 加密,并将其与使用加密安全 h 函数提供非交互式零知识证明(NIZKP)的改良施诺尔识别范式相结合。在基于UTxO的区块链系统中引入AA作为结构元素,可以有效验证网络的加密交易数据。之所以能做到这一点,是因为所提出的 NIZKP 能够证明用两个不同的公钥和不同的行为者加密的两个密码文本的等价性。这种集成使网络上的所有用户都能在加密数据上检查基于 UTxO 的交易平衡方程。本文介绍了拟议解决方案的安全考虑因素。PDF  XML
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Confidential Transaction Balance Verification by the Net Using Non-Interactive Zero-Knowledge Proofs
One of the main trends for the monitoring and control of business processes is to implement these processes via private blockchain systems. These systems must ensure data privacy and verifiability for the entire network here denoted by ‘Net’. In addition, every business activity should be declared to a trusted third party (TTP), such as an Audit Authority (AA), for tax declaration and collection purposes.We present a solution for a confidential and verifiable realization of transactions based on the Unspent Transaction Output (UTxO) paradigm. This means that the total sum of transaction inputs (incomes) $In$ must be equal to the total sum of transaction outputs (expenses) $Ex$, satisfying the balance equation $In=Ex$. Privacy in a private blockchain must be achieved through the encryption of actual transaction values. However, it is crucial that all participants in the network be able to verify the validity of the transaction balance equation. This poses a challenge with probabilistically encrypted data. Moreover, the inputs and outputs are encrypted with different public keys. With the introduction of the AA, the number of different public keys for encryption can be reduced to two. Incomes are encrypted with the Receiver’s public key and expenses with the AA’s public key.The novelty of our realization lies in taking additively-multiplicative, homomorphic ElGamal encryption and integrating it with a proposed paradigm of modified Schnorr identification providing a non-interactive zero-knowledge proof (NIZKP) using a cryptographically secure h-function. Introducing the AA as a structural element in a blockchain system based on the UTxO enables effective verification of encrypted transaction data for the Net. This is possible because the proposed NIZKP is able to prove the equivalency of two ciphertexts encrypted with two different public keys and different actors.This integration allows all users on the Net to check the UTxO-based transaction balance equation on encrypted data. The security considerations of the proposed solution are presented. PDF  XML
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Informatica
Informatica 工程技术-计算机:信息系统
CiteScore
5.90
自引率
6.90%
发文量
19
审稿时长
12 months
期刊介绍: The quarterly journal Informatica provides an international forum for high-quality original research and publishes papers on mathematical simulation and optimization, recognition and control, programming theory and systems, automation systems and elements. Informatica provides a multidisciplinary forum for scientists and engineers involved in research and design including experts who implement and manage information systems applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信