2021 Ninth International Symposium on Computing and Networking (CANDAR)最新文献_第2页

Implementation and Evaluation of Ring Oscillator-based True Random Number Generator 基于环振的真随机数发生器的实现与评价

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00034

Naoya Torii, Ryuichiro Minagawa, Hideaki Kevin Omae, Kotaro Hayashi

{"title":"Implementation and Evaluation of Ring Oscillator-based True Random Number Generator","authors":"Naoya Torii, Ryuichiro Minagawa, Hideaki Kevin Omae, Kotaro Hayashi","doi":"10.1109/CANDAR53791.2021.00034","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00034","url":null,"abstract":"A true random number generator (TRNG) is suitable for generating secure keys and nonces. TRNGs implemented in IoT devices must be small in scale and have low power consumption. The random number sequence generated by TRNG needs to have high entropy immediately after startup and a stable state. In this paper, three types of ring oscillator type TRNGs, TERO-based, COSO-based, and STR-based TRNG, are implemented on Zynq-7010. When these TRNGs are implemented as a single entropy source, it is challenging to implement them because it is necessary to evaluate the layout and wiring for each FPGA. This paper proposes a TRNG configuration, which exclusively ORs the outputs of multiple entropy sources. We show that this configuration can reduce the implementing difficulty and realize high entropy. For the random number sequence evaluation, we use the statistical test of NIST SP800-90B and BSI AIS 20/31. In addition, the random number sequence immediately after the startup is also statistically evaluated. As a result, our proposed TRNGs generate high entropy random numbers and are easy to implement on FPGA when we implement TRNGs with eight single entropy sources for TERO-based TRNG, 48 for COSO-based TRNG, and two for STR-based TRNG, respectively.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524635","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}

引用次数: 2

Browser-Based Manipulation of Virtual Objects Through MVVM Architecture with Data Binding 基于浏览器的基于数据绑定的MVVM架构虚拟对象操作

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00026

Nagaki Kentaro, S. Fujita

{"title":"Browser-Based Manipulation of Virtual Objects Through MVVM Architecture with Data Binding","authors":"Nagaki Kentaro, S. Fujita","doi":"10.1109/CANDAR53791.2021.00026","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00026","url":null,"abstract":"This paper considers the problem of sharing complex virtual objects among remote users through Web browsers. Although drag-and-drop of object is one of new features available in HTML5, it is not sufficient to realize the transformation of virtual objects consisting of several rigid bodies connected with joints, and for such a purpose, it is necessary to keep track of the location of the fulcrum of the rigid body object currently being grasped, and to set various attributes such as fulcrum and action points for each object, not just the 2D coordinates of the object on the screen. To realize such functionality, we focus on the data binding capability of interactive Web application framework based on the MVVM (Model-View-ViewModel) architecture and implement a prototype system using Vue.js as the concrete framework, Three.js as the library to handle 3D space in the Web browser, and Google Firestore as the database for data sharing among remote users. The result of experiments conducted on the prototype system indicates that we could realize the transformation information sharing within 300 ms on average.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121013471","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}

引用次数: 1

CANDAR 2021 Program Committee 加拿大2021计划委员会

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/candar53791.2021.00007

引用次数: 0

A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees 一类具有素嵌入度的友好配对椭圆曲线族的最终幂的构造方法

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00028

Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Y. Nogami

引用次数: 1

Visual Studio Code Extension and Auto-completion for Mizar Language Visual Studio代码扩展和自动完成的语言

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00033

Hirota Taniguchi, Kazuhisa Nakasho

引用次数: 0

Dementia Sign Detection System Using Digital Twin 基于数字孪生的痴呆征兆检测系统

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00025

Toru Kobayashi, K. Fukae, Tetsuo Imai, Kenichi Arai

{"title":"Dementia Sign Detection System Using Digital Twin","authors":"Toru Kobayashi, K. Fukae, Tetsuo Imai, Kenichi Arai","doi":"10.1109/CANDAR53791.2021.00025","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00025","url":null,"abstract":"Currently, the most common way to detect signs of dementia is an interview that mainly focuses on whether there is “cognitive function disorder.” However, detecting its signs more accurately, it is necessary to evaluate changes of behaviors related to “life function disorder.” Conventionally, an interview has also been the mainstream to determine whether there is “life function disorder.” It is conducted with an elderly person and family members living with the elderly. Therefore, in this study, we propose a system that detects signs of dementia so that we do not have to rely on interviews. The system is achieved by digitally transforming a subject's behaviors and configuring the subject's digital twin. We installed a communication robot and ambient sensors at each of their houses and, in addition, utilizing a wearable device. This enabled us to digitally transform their behaviors inside and outside houses and configure their digital twins. Using digital twins, we performed detection of signs of dementia targeting both “cognitive function disorder” and “life function disorder.” We evaluated the system in experiments conducted at Nagasaki University Hospital and an ordinary person's home in Nagasaki City. As the result, we confirmed that we were able to configure subjects' digital twins for detection of signs of dementia by comparing their actual behavioral histories.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125742336","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}

引用次数: 2

Group Signatures with Designated Traceability 具有指定可追溯性的组签名

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00017

Hiroaki Anada, Masayuki Fukumitsu, Shingo Hasegawa

引用次数: 1

Cost-Performance Evaluation of Heterogeneous Tierless Storage Management in a Public Cloud 公有云下异构分层存储管理的性价比评估

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00024

Reika Kinoshita, S. Imamura, Lukas Vogel, Satoshi Kazama, Eiji Yoshida

{"title":"Cost-Performance Evaluation of Heterogeneous Tierless Storage Management in a Public Cloud","authors":"Reika Kinoshita, S. Imamura, Lukas Vogel, Satoshi Kazama, Eiji Yoshida","doi":"10.1109/CANDAR53791.2021.00024","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00024","url":null,"abstract":"Data analytics, which extracts valuable information from a large amount of data, plays an important role in a company's business decision-making. Data analytical processing is generally I/O-intensive because of the need to retrieve data from storage devices. Public cloud services have recently become a popular choice for data analytical processing because a wide variety of storage volumes is immediately available without preparing real hardware. In this type of public cloud, it is necessary to combine multiple types of storage volumes appropriately to obtain a high I/O throughput at a low cost. In this paper, using Amazon Web Services (AWS), we quantitatively evaluate the advantages of a state-of-the-art heterogeneous tierless storage management (HTSM) technique, that is designed for relational databases, over a traditional storage caching mechanism. Our evaluation with all types of Elastic Block Store (EBS) volumes and TPC-H and TPC-DS benchmarks shows that the HTSM technique outperforms Linux bcache by up to 3.35 times within specified cost constraints. Moreover, we demonstrate that it also mitigates the AWS-specific throughput degradations of storage volumes.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130360916","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}

引用次数: 1

Efficient Multi-Party Contact Tracing 高效的多方联系人跟踪

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00010

Mathieu de Goyon, Atsuko Miyaji, Yangguang Tian

引用次数: 1

A Strongly Unlinkable Group Signature Scheme with Matching-Based Verifier-Local Revocation for Privacy-Enhancing Crowdsensing 基于匹配的验证者-本地撤销强不可链接群签名方案

2021 Ninth International Symposium on Computing and Networking (CANDAR) Pub Date : 2021-11-01 DOI: 10.1109/CANDAR53791.2021.00027

Yuto Nakazawa, T. Nakanishi

{"title":"A Strongly Unlinkable Group Signature Scheme with Matching-Based Verifier-Local Revocation for Privacy-Enhancing Crowdsensing","authors":"Yuto Nakazawa, T. Nakanishi","doi":"10.1109/CANDAR53791.2021.00027","DOIUrl":"https://doi.org/10.1109/CANDAR53791.2021.00027","url":null,"abstract":"A group signature scheme allows us to anonymously sign a message on behalf of a group. One of important issues in the group signatures is user revocation, and thus lots of revocable group signature (RGS) schemes have been proposed so far. One of the applications suitable to the group signature is privacy-enhancing crowdsensing, where the group signature allows mobile sensing users to be anonymously authenticated to hide the location. In the mobile environment, verifier-local revocation (VLR) type of RGS schemes are suitable, since revocation list (RL) is not needed in the user side. However, in the conventional VLR-RGS schemes, the revocation check in the verifier needs $O(R)$ cryptographic operations for the number $R$ of revoked users. On this background, VLR-RGS schemes with efficient revocation check have been recently proposed, where the revocation check is just (bit-string) matching. However, in the existing schemes, signatures are linkable in the same interval or in the same task with a public index. In this paper, by introducing a limitation that at most $K$ signatures can be issued by a signer during each interval for a fixed integer $K$, we propose a VLR-RGS scheme with the revocation token matching. In our scheme, even the signatures during the same interval are unlinkable. Furthermore, since used indexes are hidden, the strong anonymity remains. The overheads are the computational costs of the revocation algorithm and the RL size. We show that the overheads are practical in use cases of crowdsensing.","PeriodicalId":263773,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130717342","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}

引用次数: 1