Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9656959
Ates Ates, Adnan Ozsoy
Organizations may opt for lateral transfer when an inventory of products needs to be fulfilled relatively quickly to the normal supply chain. They can make these transfers within their own structure, and in some cases, it may be necessary to perform this transfer with different organizations. In this study, we propose a blockchain-based lateral transfer model in which different organizations will meet their needs from each other without the need for a third party. While organizations supply the products they need from each other, they can reduce transportation costs by making the transportation process collectively. As far as we know, how blockchain technology can be used in lateral transfers is a first in the literature.
{"title":"Blockchain Based Lateral Transshipment","authors":"Ates Ates, Adnan Ozsoy","doi":"10.1109/BCCA53669.2021.9656959","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9656959","url":null,"abstract":"Organizations may opt for lateral transfer when an inventory of products needs to be fulfilled relatively quickly to the normal supply chain. They can make these transfers within their own structure, and in some cases, it may be necessary to perform this transfer with different organizations. In this study, we propose a blockchain-based lateral transfer model in which different organizations will meet their needs from each other without the need for a third party. While organizations supply the products they need from each other, they can reduce transportation costs by making the transportation process collectively. As far as we know, how blockchain technology can be used in lateral transfers is a first in the literature.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117251727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9657011
Caspar Schwarz-Schilling, Sheng-Nan Li, C. Tessone
In blockchain-based systems, such as Bitcoin’s Proof-of-Work (PoW) protocol, it is expected that a miner’s share of total block revenue is proportional to their share of the network’s total hashing power. However, a deviation to this behavior is the selfish mining strategy, an attack vector discovered by Eyal and Sirer in 2014. This strategy may lead to a miner earning more than their “fair share As a result, Bitcoin’s security assumption of an honest majority may not be sufficient. In this paper, in order to verify whether selfish mining is indeed a profitable strategy in PoW systems, we introduce an agent-based model to simulate the dynamics of selfish mining behavior. The model is by design minimalistic allowing us to analyze the effect of network latency, hashing power distribution, and network topology on relative revenue of selfish miners. We find that for high levels of latency, selfish mining is always a relatively more profitable strategy, and the results turn out to be very robust to changes in the network topology. In addition, we find that the hashing power distribution following power laws, as found empirically, can make it harder for selfish miners to be profitable. Our analysis confirms the main observations that selfish mining is always relatively more profitable for hashing powers representing more than one third of the total computing power. Further, it also confirms that selfish mining behavior could cause a statistically significant high probability of contiguously mined blocks.
{"title":"Agent-based Modelling of Strategic behavior in PoW Protocols","authors":"Caspar Schwarz-Schilling, Sheng-Nan Li, C. Tessone","doi":"10.1109/BCCA53669.2021.9657011","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657011","url":null,"abstract":"In blockchain-based systems, such as Bitcoin’s Proof-of-Work (PoW) protocol, it is expected that a miner’s share of total block revenue is proportional to their share of the network’s total hashing power. However, a deviation to this behavior is the selfish mining strategy, an attack vector discovered by Eyal and Sirer in 2014. This strategy may lead to a miner earning more than their “fair share As a result, Bitcoin’s security assumption of an honest majority may not be sufficient. In this paper, in order to verify whether selfish mining is indeed a profitable strategy in PoW systems, we introduce an agent-based model to simulate the dynamics of selfish mining behavior. The model is by design minimalistic allowing us to analyze the effect of network latency, hashing power distribution, and network topology on relative revenue of selfish miners. We find that for high levels of latency, selfish mining is always a relatively more profitable strategy, and the results turn out to be very robust to changes in the network topology. In addition, we find that the hashing power distribution following power laws, as found empirically, can make it harder for selfish miners to be profitable. Our analysis confirms the main observations that selfish mining is always relatively more profitable for hashing powers representing more than one third of the total computing power. Further, it also confirms that selfish mining behavior could cause a statistically significant high probability of contiguously mined blocks.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124476171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9656961
E. Scheid, Pascal Kiechl, M. Franco, B. Rodrigues, Christian Killer, B. Stiller
Over the past years, Blockchain (BC) interoperability became a crucial topic of research due to the fast development of new BC platforms for many use-cases, from supply-chain to voting. The need for interoperability can be attributed to the development of such platforms that did not follow any standard, leading to the creation of BC islands that do not exchange data, which hinders innovation. Hence, several BC interoperability solutions were proposed to tackle such problems. One of them is Bifröst, a Notary scheme-based BC interoperability Application Programming Interface (API) that allows the transparent interaction by users or legacy applications with several BCs. An initial prototype of Bifröst was developed, proving its feasibility; however, it did not provide native data encryption or an interaction standard. Thus, this paper presents the design and implementation of an encryption scheme for Bifröst and a JSON format proposal to interact with Bifröst, which also contributes to the state-of-the-art. Evaluations on the encryption scheme show an increase of the data size after the encryption but a constant performance overhead, and discussions on the standard prove that it can be applied to other Notary-based BC interoperability APIs due to its flexibility.
{"title":"Security and Standardization of a Notary-based Blockchain Interoperability API","authors":"E. Scheid, Pascal Kiechl, M. Franco, B. Rodrigues, Christian Killer, B. Stiller","doi":"10.1109/BCCA53669.2021.9656961","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9656961","url":null,"abstract":"Over the past years, Blockchain (BC) interoperability became a crucial topic of research due to the fast development of new BC platforms for many use-cases, from supply-chain to voting. The need for interoperability can be attributed to the development of such platforms that did not follow any standard, leading to the creation of BC islands that do not exchange data, which hinders innovation. Hence, several BC interoperability solutions were proposed to tackle such problems. One of them is Bifröst, a Notary scheme-based BC interoperability Application Programming Interface (API) that allows the transparent interaction by users or legacy applications with several BCs. An initial prototype of Bifröst was developed, proving its feasibility; however, it did not provide native data encryption or an interaction standard. Thus, this paper presents the design and implementation of an encryption scheme for Bifröst and a JSON format proposal to interact with Bifröst, which also contributes to the state-of-the-art. Evaluations on the encryption scheme show an increase of the data size after the encryption but a constant performance overhead, and discussions on the standard prove that it can be applied to other Notary-based BC interoperability APIs due to its flexibility.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"416 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125363816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9657036
Lara Nascimento, Paulo Da Silva, Clóvis Peres
The development of Blockchain applications is still at an early stage, considering that, after 13 years of the Bitcoin introduction, cryptocurrencies remain the single example of a well-established Blockchain system. On the other hand, the digitalization of taxes and its underlying processes is gaining speed worldwide, with not only developed countries adopting it. This trend can be the foundation of a Blockchain integration to the tax system, so that this domain could take advantage of desired inherent features offered by the technology, such as transparency, security, immutability and real-time information. Consequently, tax authorities would achieve higher revenue levels and improve compliance tracking, reducing tax evasion and fraud. At the same time, taxpayers would benefit from reduced tax compliance costs and better experiences through more efficient processes. Therefore, this work aims at investigating the state of the art within the field of Blockchain application on taxation, in order to drive new researches that could close current gaps and to support the development of new applications.
{"title":"Blockchain’s potential and opportunities for tax administrations: a systematic review","authors":"Lara Nascimento, Paulo Da Silva, Clóvis Peres","doi":"10.1109/BCCA53669.2021.9657036","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657036","url":null,"abstract":"The development of Blockchain applications is still at an early stage, considering that, after 13 years of the Bitcoin introduction, cryptocurrencies remain the single example of a well-established Blockchain system. On the other hand, the digitalization of taxes and its underlying processes is gaining speed worldwide, with not only developed countries adopting it. This trend can be the foundation of a Blockchain integration to the tax system, so that this domain could take advantage of desired inherent features offered by the technology, such as transparency, security, immutability and real-time information. Consequently, tax authorities would achieve higher revenue levels and improve compliance tracking, reducing tax evasion and fraud. At the same time, taxpayers would benefit from reduced tax compliance costs and better experiences through more efficient processes. Therefore, this work aims at investigating the state of the art within the field of Blockchain application on taxation, in order to drive new researches that could close current gaps and to support the development of new applications.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127059659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9657040
Chaïmaa Benabbou, Ö. Gürcan
Smart contracts are programs stored on a blockchain that run when predetermined conditions are met. However, designing and implementing a smart contract is not trivial since upon deployment on a blockchain, it is no longer possible to modify it (neither for improving nor for bug fixing). It is only possible by deploying a new version of the smart contract which is costly (deployment cost for the new contract and destruction cost for the old contract). To this end, there are many solutions for testing the smart contracts before their deployment. Since realizing bug-free smart contracts increase the reliability, as well as reduce the cost, testing is an essential activity. In this paper, we group the existing solutions that attempt to tackle smart contract testing into following categories: public test networks, security analysis tools, blockchain emulators and blockchain simulators. Then, we analyze these solutions, categorize them and show what their pros and cons are.
{"title":"A Survey of Verification, Validation and Testing Solutions for Smart Contracts","authors":"Chaïmaa Benabbou, Ö. Gürcan","doi":"10.1109/BCCA53669.2021.9657040","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657040","url":null,"abstract":"Smart contracts are programs stored on a blockchain that run when predetermined conditions are met. However, designing and implementing a smart contract is not trivial since upon deployment on a blockchain, it is no longer possible to modify it (neither for improving nor for bug fixing). It is only possible by deploying a new version of the smart contract which is costly (deployment cost for the new contract and destruction cost for the old contract). To this end, there are many solutions for testing the smart contracts before their deployment. Since realizing bug-free smart contracts increase the reliability, as well as reduce the cost, testing is an essential activity. In this paper, we group the existing solutions that attempt to tackle smart contract testing into following categories: public test networks, security analysis tools, blockchain emulators and blockchain simulators. Then, we analyze these solutions, categorize them and show what their pros and cons are.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125945988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-15DOI: 10.1109/BCCA53669.2021.9657010
S. Bezzateev, A. Afanasyeva, K. Zhidanov, A. Ometov
The development generally drives the evolution of modern systems towards distributed ones, generally, in blockchain and Distributed Ledger Technology domains. Ensuring the reliable digital signature of messages and the data security of messages signed with a digital signature from unauthorized interference is an essential part of enabling the operation of the paradigms as mentioned earlier. This work proposes a method for signing messages in the distributed system by introducing a two level nodes’ hierarchy, distribution of the Public Key Generator (PKG) master key the nodes of the second level so that a distributed PKG threshold scheme is formed from those. Further, one or more second-layer leaders are selected by the nodes of the first message level in such a way that the aggregate content of the messages determines the value of the current identifier and, thus, the public key are formed by the nodes of the second level forming a distributed threshold PKG, shares of the session secret key corresponding to the identifier and the public key. The session secret key is recovered by one or more second level nodes selected as the leader, and the current message is signed using the corresponding session secret key.
{"title":"Multi-Layer Message Signature Scheme with Threshold-based Distributed PKG and Dynamic Leader Selection","authors":"S. Bezzateev, A. Afanasyeva, K. Zhidanov, A. Ometov","doi":"10.1109/BCCA53669.2021.9657010","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657010","url":null,"abstract":"The development generally drives the evolution of modern systems towards distributed ones, generally, in blockchain and Distributed Ledger Technology domains. Ensuring the reliable digital signature of messages and the data security of messages signed with a digital signature from unauthorized interference is an essential part of enabling the operation of the paradigms as mentioned earlier. This work proposes a method for signing messages in the distributed system by introducing a two level nodes’ hierarchy, distribution of the Public Key Generator (PKG) master key the nodes of the second level so that a distributed PKG threshold scheme is formed from those. Further, one or more second-layer leaders are selected by the nodes of the first message level in such a way that the aggregate content of the messages determines the value of the current identifier and, thus, the public key are formed by the nodes of the second level forming a distributed threshold PKG, shares of the session secret key corresponding to the identifier and the public key. The session secret key is recovered by one or more second level nodes selected as the leader, and the current message is signed using the corresponding session secret key.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121834086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-04DOI: 10.1109/BCCA53669.2021.9657019
O. Stengele, Markus Raiber, J. Müller-Quade, H. Hartenstein
We address the Threshold Information Disclosure (TID) problem on Ethereum: An arbitrary number of users commit to the scheduled disclosure of their individual messages recorded on the Ethereum blockchain if and only if all such messages are disclosed. Before a disclosure, only the original sender of each message should know its contents. To accomplish this, we task a small council with executing a distributed generation and threshold sharing of an asymmetric key pair. The public key can be used to encrypt messages which only become readable once the threshold-shared decryption key is reconstructed at a predefined point in time and recorded onchain. With blockchains like Ethereum, it is possible to coordinate such procedures and attach economic stakes to the actions of participating individuals. In this paper, we present ETHTID, an Ethereum smart contract application to coordinate Threshold Information Disclosure. We base our implementation on an existing smart contract, ETHDKG, and optimise functionality and costs to fit the TID use case. While optimising for cost savings, we show that the security of the underlying cryptographic scheme is still maintained. We evaluate how the execution costs depend on the size of the council and the threshold and show that the presented protocol is deployable with a council of more than 200 members with gas savings of 20-40% compared to ETHDKG.
{"title":"ETHTID: Deployable Threshold Information Disclosure on Ethereum","authors":"O. Stengele, Markus Raiber, J. Müller-Quade, H. Hartenstein","doi":"10.1109/BCCA53669.2021.9657019","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657019","url":null,"abstract":"We address the Threshold Information Disclosure (TID) problem on Ethereum: An arbitrary number of users commit to the scheduled disclosure of their individual messages recorded on the Ethereum blockchain if and only if all such messages are disclosed. Before a disclosure, only the original sender of each message should know its contents. To accomplish this, we task a small council with executing a distributed generation and threshold sharing of an asymmetric key pair. The public key can be used to encrypt messages which only become readable once the threshold-shared decryption key is reconstructed at a predefined point in time and recorded onchain. With blockchains like Ethereum, it is possible to coordinate such procedures and attach economic stakes to the actions of participating individuals. In this paper, we present ETHTID, an Ethereum smart contract application to coordinate Threshold Information Disclosure. We base our implementation on an existing smart contract, ETHDKG, and optimise functionality and costs to fit the TID use case. While optimising for cost savings, we show that the security of the underlying cryptographic scheme is still maintained. We evaluate how the execution costs depend on the size of the council and the threshold and show that the presented protocol is deployable with a council of more than 200 members with gas savings of 20-40% compared to ETHDKG.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123021715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-29DOI: 10.1109/BCCA53669.2021.9657041
Mikel Cortes-Goicoechea, L. Bautista-Gomez
Achieving the equilibrium between scalability, sustainability, and security while keeping decentralization has prevailed as the target solution for decentralized blockchain applications over the last years. Several approaches have been proposed by multiple blockchain teams to achieve it, Ethereum being among them. Ethereum is on the path of a major protocol improvement called Ethereum 2.0 (Eth2), implementing Sharding and introducing the Proof-of-Stake (PoS). As the change of consensus mechanism is a delicate matter, this improvement will be achieved through different phases, the first of which is the implementation of the Beacon Chain. As Ethereum1, Eth2 relies on a decentralized peer-to-peer (p2p) network for the message distribution. Up to date, we estimate that there are around 5.000 nodes in the Eth2 main net geographically distributed. However, the topology of this one still prevails unknown. In this paper, we present the results obtained from the analysis we performed on the Eth2 p2p network. Describing the topology of the network, as possible hazards that this one implies.
{"title":"Discovering the Ethereum2 P2P Network","authors":"Mikel Cortes-Goicoechea, L. Bautista-Gomez","doi":"10.1109/BCCA53669.2021.9657041","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657041","url":null,"abstract":"Achieving the equilibrium between scalability, sustainability, and security while keeping decentralization has prevailed as the target solution for decentralized blockchain applications over the last years. Several approaches have been proposed by multiple blockchain teams to achieve it, Ethereum being among them. Ethereum is on the path of a major protocol improvement called Ethereum 2.0 (Eth2), implementing Sharding and introducing the Proof-of-Stake (PoS). As the change of consensus mechanism is a delicate matter, this improvement will be achieved through different phases, the first of which is the implementation of the Beacon Chain. As Ethereum1, Eth2 relies on a decentralized peer-to-peer (p2p) network for the message distribution. Up to date, we estimate that there are around 5.000 nodes in the Eth2 main net geographically distributed. However, the topology of this one still prevails unknown. In this paper, we present the results obtained from the analysis we performed on the Eth2 p2p network. Describing the topology of the network, as possible hazards that this one implies.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125158069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-04-22DOI: 10.1109/BCCA53669.2021.9657007
M. Sigwart, Philipp Frauenthaler, Christof Spanring, Stefan Schulte
Today, several solutions for cross-blockchain asset transfers exist. However, these solutions are either tailored to specific assets or neglect finality guarantees that prevent assets from getting lost in transit. In this paper, we present a cross-blockchain asset transfer protocol that supports arbitrary assets and adheres to finality requirements. The ability to freely transfer assets between blockchains may increase transaction throughput and provide developers with more flexibility by allowing them to design digital assets that leverage the capacities and capabilities of multiple blockchains.
{"title":"Decentralized Cross-Blockchain Asset Transfers","authors":"M. Sigwart, Philipp Frauenthaler, Christof Spanring, Stefan Schulte","doi":"10.1109/BCCA53669.2021.9657007","DOIUrl":"https://doi.org/10.1109/BCCA53669.2021.9657007","url":null,"abstract":"Today, several solutions for cross-blockchain asset transfers exist. However, these solutions are either tailored to specific assets or neglect finality guarantees that prevent assets from getting lost in transit. In this paper, we present a cross-blockchain asset transfer protocol that supports arbitrary assets and adheres to finality requirements. The ability to freely transfer assets between blockchains may increase transaction throughput and provide developers with more flexibility by allowing them to design digital assets that leverage the capacities and capabilities of multiple blockchains.","PeriodicalId":202582,"journal":{"name":"2021 Third International Conference on Blockchain Computing and Applications (BCCA)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114465258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：