首页 > 最新文献

Proceedings of the 2nd International Electronics Communication Conference最新文献

英文 中文
Optimal Portfolio Sold-Out via Blockchain Tokenization 通过区块链标记化实现最佳投资组合售罄
Pub Date : 2020-07-08 DOI: 10.1145/3409934.3409950
V. Davydov, Y. Yanovich
Financial institutions own balanced portfolios with many assets and hence a small risk. But they are not able to split them into smaller parts with comparable risk for resale due to regulators' restrictions caused by a lack of auditability. Blockchain and smart contracts allow overcoming this problem via tokenizing assets into a commodity. The paper seeks to answer the question: how to assemble as many as possible standardized packages from a given portfolio. The optimal algorithms for two special cases-discrete and continuous homogeneous-are provided.
金融机构拥有多种资产的平衡投资组合,因此风险很小。但由于缺乏可审计性而受到监管机构的限制,它们无法将它们拆分成具有相当转售风险的更小部分。区块链和智能合约可以通过将资产标记为商品来克服这个问题。本文试图回答这个问题:如何从给定的投资组合中组装尽可能多的标准化包。给出了离散和连续齐次两种特殊情况下的最优算法。
{"title":"Optimal Portfolio Sold-Out via Blockchain Tokenization","authors":"V. Davydov, Y. Yanovich","doi":"10.1145/3409934.3409950","DOIUrl":"https://doi.org/10.1145/3409934.3409950","url":null,"abstract":"Financial institutions own balanced portfolios with many assets and hence a small risk. But they are not able to split them into smaller parts with comparable risk for resale due to regulators' restrictions caused by a lack of auditability. Blockchain and smart contracts allow overcoming this problem via tokenizing assets into a commodity. The paper seeks to answer the question: how to assemble as many as possible standardized packages from a given portfolio. The optimal algorithms for two special cases-discrete and continuous homogeneous-are provided.","PeriodicalId":145384,"journal":{"name":"Proceedings of the 2nd International Electronics Communication Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806667","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}
引用次数: 6
Proof of Data Distribution Based on Trusted Hardware 基于可信硬件的数据分发证明
Pub Date : 2020-07-08 DOI: 10.1145/3409934.3409943
Batnyam Enkhtaivan, Pooja Dhomse
We consider a scenario in which two parties prove to a third party that communication between them occurred. This can be seen in advertisement in which the data are distributed to the user by a distributor on behalf of owner. Specifically, we propose a protocol and a modification of it to address the possibility of collusion between the distributor and user in which the owner is deceived to pay for false claim of distribution, and the possibility of the user not providing any data transfer confirmation as an acknowledgement after receiving data. In the original protocol, the distributor and user are both equipped with trusted hardware. The data are encrypted and decrypted by this trusted hardware, with a shared secret key. When decrypting the data, the user's hardware generates a proof and sends it to the distributor. This proof is used as the proof of distribution to show to the owner for payment. This prevents the collusion with the help of the trusted hardware. This protocol assumes that the user will not misbehave and always send the proof back to the distributor. To address this issue, the modified protocol uses blockchain as a public ledger for the user to publish acknowledgement of receiving encrypted data chunk, and for the distributor to publish the corresponding secret for decryption. In both the protocols, we use the blockchain technology as a method for the ID management and payment.
我们考虑一个场景,其中双方向第三方证明他们之间发生了通信。这可以在广告中看到,其中数据由代表所有者的发布者分发给用户。具体来说,我们提出了一个协议,并对其进行了修改,以解决分发方与用户勾结的可能性,即所有者被欺骗支付虚假的分发声明,以及用户在收到数据后不提供任何数据传输确认作为确认的可能性。在原始协议中,分发者和用户都配备了可信硬件。数据由这个受信任的硬件使用共享密钥进行加密和解密。在解密数据时,用户的硬件生成证明并将其发送给分发者。此证明用作分发证明,以向所有者显示付款。这可以防止与可信硬件的帮助相勾结。该协议假设用户不会有不当行为,并且总是将证明发送回分发者。为了解决这个问题,修改后的协议使用区块链作为公共分类账,供用户发布接收到加密数据块的确认,供分发方发布相应的秘密进行解密。在这两个协议中,我们都使用区块链技术作为ID管理和支付的方法。
{"title":"Proof of Data Distribution Based on Trusted Hardware","authors":"Batnyam Enkhtaivan, Pooja Dhomse","doi":"10.1145/3409934.3409943","DOIUrl":"https://doi.org/10.1145/3409934.3409943","url":null,"abstract":"We consider a scenario in which two parties prove to a third party that communication between them occurred. This can be seen in advertisement in which the data are distributed to the user by a distributor on behalf of owner. Specifically, we propose a protocol and a modification of it to address the possibility of collusion between the distributor and user in which the owner is deceived to pay for false claim of distribution, and the possibility of the user not providing any data transfer confirmation as an acknowledgement after receiving data. In the original protocol, the distributor and user are both equipped with trusted hardware. The data are encrypted and decrypted by this trusted hardware, with a shared secret key. When decrypting the data, the user's hardware generates a proof and sends it to the distributor. This proof is used as the proof of distribution to show to the owner for payment. This prevents the collusion with the help of the trusted hardware. This protocol assumes that the user will not misbehave and always send the proof back to the distributor. To address this issue, the modified protocol uses blockchain as a public ledger for the user to publish acknowledgement of receiving encrypted data chunk, and for the distributor to publish the corresponding secret for decryption. In both the protocols, we use the blockchain technology as a method for the ID management and payment.","PeriodicalId":145384,"journal":{"name":"Proceedings of the 2nd International Electronics Communication Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127703993","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}
引用次数: 0
Transaction Dependency Model for Block Minimization in Arbitrary Blockchains 任意区块链中区块最小化的事务依赖模型
Pub Date : 2020-07-08 DOI: 10.1145/3409934.3409935
Wolf Posdorfer, Heiko Bornholdt, W. Lamersdorf
Blockchains are distributed replicated state machines with a continuously increasing data storage underneath. The size of the storage can cause problems especially in limited IoT devices. In order to address that, this paper is based on the following ideas: While two state transitions could be replaced by a single one to represent the same state, this is not commonly done to reduce the blockchains storage size. To facilitate squashing of transactions independent of the application semantics a blockchain frameworks needs to know the interdependencies of transactions. In this paper we propose an explicit dependency model for any transaction in a blockchain. In this way a blockchain-framework can preselect connected transactions without business process semantics for a squash operation. These connected transactions are passed to the application for the squash to be performed. This ideally produces less transactions while achieving the same application state to be used for a reintroduction as new blocks within a fork for a smaller overall storage footprint.
区块链是分布式复制状态机,其底层数据存储不断增加。存储的大小可能会导致问题,特别是在有限的物联网设备中。为了解决这个问题,本文基于以下思路:虽然两个状态转换可以被一个状态转换取代以表示相同的状态,但这通常不会减少区块链的存储大小。为了便于压缩独立于应用程序语义的事务,区块链框架需要知道事务的相互依赖性。在本文中,我们为区块链中的任何交易提出了一个显式依赖模型。通过这种方式,区块链框架可以预先选择连接的事务,而无需为挤压操作提供业务流程语义。将这些连接的事务传递给应用程序以执行压缩。理想情况下,这将产生更少的事务,同时实现相同的应用程序状态,用于在分叉中重新引入新块,从而减少总体存储占用。
{"title":"Transaction Dependency Model for Block Minimization in Arbitrary Blockchains","authors":"Wolf Posdorfer, Heiko Bornholdt, W. Lamersdorf","doi":"10.1145/3409934.3409935","DOIUrl":"https://doi.org/10.1145/3409934.3409935","url":null,"abstract":"Blockchains are distributed replicated state machines with a continuously increasing data storage underneath. The size of the storage can cause problems especially in limited IoT devices. In order to address that, this paper is based on the following ideas: While two state transitions could be replaced by a single one to represent the same state, this is not commonly done to reduce the blockchains storage size. To facilitate squashing of transactions independent of the application semantics a blockchain frameworks needs to know the interdependencies of transactions. In this paper we propose an explicit dependency model for any transaction in a blockchain. In this way a blockchain-framework can preselect connected transactions without business process semantics for a squash operation. These connected transactions are passed to the application for the squash to be performed. This ideally produces less transactions while achieving the same application state to be used for a reintroduction as new blocks within a fork for a smaller overall storage footprint.","PeriodicalId":145384,"journal":{"name":"Proceedings of the 2nd International Electronics Communication Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129392476","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}
引用次数: 0
期刊
Proceedings of the 2nd International Electronics Communication Conference
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1