Abstract With the development of information networks, the entities from different network domains interact with each other more and more frequently. Therefore, identity management and authentication are essential in cross-domain setting. The traditional Public Key Infrastructure (PKI) architecture has some problems, including single point of failure, inefficient certificate revocation status management and also lack of privacy protection, which cannot meet the demand of cross-domain identity authentication. Blockchain is suitable for multi-participant collaboration in multi-trust domain scenarios. In this paper, a cross-domain certificate management scheme CD-BCM based on the consortium blockchain is proposed. For the issue of Certificate Authority’s single point of failure, we design a multi-signature algorithm. In addition, we propose a unified structure for batch certificates verification and conversion, which improve the efficiency of erroneous certificate identification. Finally, by comparing with current related schemes, our scheme achieves good functionality and scalability in the scenario of cross-domain certificate management.
{"title":"CD-BCM:Cross-Domain Batch Certificates Management Based On Blockchain","authors":"Shixiong Yao, Pei Li, Jing Chen, Yuexing Zeng, Jiageng Chen, Donghui Wang","doi":"10.1093/comjnl/bxad025","DOIUrl":"https://doi.org/10.1093/comjnl/bxad025","url":null,"abstract":"Abstract With the development of information networks, the entities from different network domains interact with each other more and more frequently. Therefore, identity management and authentication are essential in cross-domain setting. The traditional Public Key Infrastructure (PKI) architecture has some problems, including single point of failure, inefficient certificate revocation status management and also lack of privacy protection, which cannot meet the demand of cross-domain identity authentication. Blockchain is suitable for multi-participant collaboration in multi-trust domain scenarios. In this paper, a cross-domain certificate management scheme CD-BCM based on the consortium blockchain is proposed. For the issue of Certificate Authority’s single point of failure, we design a multi-signature algorithm. In addition, we propose a unified structure for batch certificates verification and conversion, which improve the efficiency of erroneous certificate identification. Finally, by comparing with current related schemes, our scheme achieves good functionality and scalability in the scenario of cross-domain certificate management.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135001296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The Fiat-Shamir with Aborts paradigm of Lyubashevsky has given rise to efficient lattice-based signature schemes. One popular implementation is Dilithium, which has been selected for standardization by the US National Institute of Standards and Technology (NIST). Informally, it can be seen as a lattice analog of the well-known discrete-logarithm-based Schnorr signature. An interesting research question is whether it is possible to combine several unrelated signatures, issued from different signing parties on different messages, into one single aggregated signature. Of course, its size should be significantly smaller than the trivial concatenation of all signatures. Ideally, the aggregation can be done offline by a third party, called public aggregation. Previous works have shown that it is possible to half-aggregate Schnorr signatures, but it was left open if the underlying techniques can be adapted to the lattice setting. In this work, we show that, indeed, we can use similar strategies to obtain a signature scheme allowing for public aggregation whose hardness is proven assuming the intractability of well-studied problems on module lattices. Unfortunately, our scheme produces aggregated signatures that are larger than the trivial solution of concatenating. This is due to peculiarities that seem inherent to lattice-based cryptography. Its motivation is thus mainly pedagogical.
Lyubashevsky的Fiat-Shamir with Aborts范式提出了高效的基于格的签名方案。一种流行的实现是二锂，它已被美国国家标准与技术研究所(NIST)选择用于标准化。非正式地，它可以被看作是众所周知的基于离散对数的Schnorr签名的晶格模拟。一个有趣的研究问题是，是否有可能将不同签名方在不同消息上发布的几个不相关的签名合并为一个聚合签名。当然，它的大小应该明显小于所有签名的简单连接。理想情况下，聚合可以由第三方离线完成，称为公共聚合。先前的研究已经表明，Schnorr特征有可能半聚合，但如果基础技术可以适应晶格设置，那么它仍然是开放的。在这项工作中，我们表明，我们确实可以使用类似的策略来获得一个允许公共聚合的签名方案，其硬度被证明是假设在模格上研究得很好的问题的难解性。不幸的是，我们的方案产生的聚合签名比简单的连接解决方案要大。这是由于基于格的密码学所固有的特性。因此，其动机主要是教学性的。
{"title":"Overfull: Too Large Aggregate Signatures Based on Lattices","authors":"Katharina Boudgoust, Adeline Roux-Langlois","doi":"10.1093/comjnl/bxad013","DOIUrl":"https://doi.org/10.1093/comjnl/bxad013","url":null,"abstract":"Abstract The Fiat-Shamir with Aborts paradigm of Lyubashevsky has given rise to efficient lattice-based signature schemes. One popular implementation is Dilithium, which has been selected for standardization by the US National Institute of Standards and Technology (NIST). Informally, it can be seen as a lattice analog of the well-known discrete-logarithm-based Schnorr signature. An interesting research question is whether it is possible to combine several unrelated signatures, issued from different signing parties on different messages, into one single aggregated signature. Of course, its size should be significantly smaller than the trivial concatenation of all signatures. Ideally, the aggregation can be done offline by a third party, called public aggregation. Previous works have shown that it is possible to half-aggregate Schnorr signatures, but it was left open if the underlying techniques can be adapted to the lattice setting. In this work, we show that, indeed, we can use similar strategies to obtain a signature scheme allowing for public aggregation whose hardness is proven assuming the intractability of well-studied problems on module lattices. Unfortunately, our scheme produces aggregated signatures that are larger than the trivial solution of concatenating. This is due to peculiarities that seem inherent to lattice-based cryptography. Its motivation is thus mainly pedagogical.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135295446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Edge connectivity is an important parameter for the reliability of the inter-connection network. A graph $G$ is strong Menger edge-connected ($SM$-$lambda $ for short) if there exist min${deg _{G}(u),deg _{G}(v)}$ edge-disjoint paths between any pair of vertices $u$ and $v$ of $G$. The conditional edge-fault-tolerance strong Menger edge connectivity of $G$, denoted by $sm_{lambda }^{r}(G)$, is the maximum integer $m$ such that $G-F$ remains $SM$-$lambda $ for any edge set $F$ with $|F|leq m$ and $delta (G-F)geq r$, where $delta (G-F)geq r$ is the minimum degree of $G-F$. Most of the previous papers discussed $sm_{lambda }^{r}(G)$ in the case of $rleq 2$. In this paper, we show that $sm_{lambda }^{r}(FQ_{n})=2^{r}(n-r+1)-(n+1)$ for $1leq rleq n-2$, where $ngeq 4$.
{"title":"On Conditional Edge-Fault-Tolerant Strong Menger Edge Connectivity Of Folded Hypercubes","authors":"Shijie Zhao, Pingshan Li","doi":"10.1093/comjnl/bxad018","DOIUrl":"https://doi.org/10.1093/comjnl/bxad018","url":null,"abstract":"Abstract Edge connectivity is an important parameter for the reliability of the inter-connection network. A graph $G$ is strong Menger edge-connected ($SM$-$lambda $ for short) if there exist min${deg _{G}(u),deg _{G}(v)}$ edge-disjoint paths between any pair of vertices $u$ and $v$ of $G$. The conditional edge-fault-tolerance strong Menger edge connectivity of $G$, denoted by $sm_{lambda }^{r}(G)$, is the maximum integer $m$ such that $G-F$ remains $SM$-$lambda $ for any edge set $F$ with $|F|leq m$ and $delta (G-F)geq r$, where $delta (G-F)geq r$ is the minimum degree of $G-F$. Most of the previous papers discussed $sm_{lambda }^{r}(G)$ in the case of $rleq 2$. In this paper, we show that $sm_{lambda }^{r}(FQ_{n})=2^{r}(n-r+1)-(n+1)$ for $1leq rleq n-2$, where $ngeq 4$.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136131933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rahman Keramati Hatkeposhti, Meisam Yadollahzadeh-Tabari, Mehdi Golsorkhtabariamiri
Abstract Falling is one of the major health concerns, and its early detection is very important. The goal of this study is an early prediction of impending falls using wearable sensors data. The SisFall data set has been used along with two deep learning models (CNN and a combination model named Conv_Lstm). Also, a dynamic sampling method is offered to improve the accuracy of the models by increasing the equilibrium rate between the samples of the majority and minority classes. To fulfill the main idea of this paper, we present a future prediction strategy. Then, by defining a time variable ‘T’, the system replaces and labels the state of the next T s instead of considering the current state only. This leads to predicting falling states at the beginning moments of balance disturbance. The results of the experiments show that the Conv_Lstm model was able to predict the fall in 78% of cases and an average of 340 ms before the accident. Also, for the Sensitivity criterion, a value of 95.18% has been obtained. A post-processing module based on the median filter was implemented, which could increase the accuracy of predictions to 95%.
{"title":"Providing an Approach for Early Prediction of Fall in Human Activities Based on Wearable Sensor Data and the Use of Deep Learning Algorithms","authors":"Rahman Keramati Hatkeposhti, Meisam Yadollahzadeh-Tabari, Mehdi Golsorkhtabariamiri","doi":"10.1093/comjnl/bxad008","DOIUrl":"https://doi.org/10.1093/comjnl/bxad008","url":null,"abstract":"Abstract Falling is one of the major health concerns, and its early detection is very important. The goal of this study is an early prediction of impending falls using wearable sensors data. The SisFall data set has been used along with two deep learning models (CNN and a combination model named Conv_Lstm). Also, a dynamic sampling method is offered to improve the accuracy of the models by increasing the equilibrium rate between the samples of the majority and minority classes. To fulfill the main idea of this paper, we present a future prediction strategy. Then, by defining a time variable ‘T’, the system replaces and labels the state of the next T s instead of considering the current state only. This leads to predicting falling states at the beginning moments of balance disturbance. The results of the experiments show that the Conv_Lstm model was able to predict the fall in 78% of cases and an average of 340 ms before the accident. Also, for the Sensitivity criterion, a value of 95.18% has been obtained. A post-processing module based on the median filter was implemented, which could increase the accuracy of predictions to 95%.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136340909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Masking is a well used and widely deployed countermeasure against side channel attacks, both in software and hardware. With masking comes at a great cost, search has focused on how to lower a performance penalty or find efficient masking implementation. In particular, our contribution is 2-fold: for software masking, we first find bitsliced implementations of Sbox with Multiplicative Complexity 4 and Multiplicative Depth 2, then adapt the common shares approach introduced by Coron et al. at CHES 2016 to make many cross-products $a_{i}cdot b_{j}$ can be reuse for parallel ISW-based 32-bit nonlinear operations. Therefore, we improve the efficiency of 2$times b/4/32$ parallel high-order masking of ISW scheme for RECTANGLE, TANGRAM and KNOT on 32-bit ARM embedded microprocessor, with roughly a 13%-34% speed-up, at cost of $(1+d) times 32$-bit randomness. For hardware masking, 4 bit cubic Sboxes with quadratic decomposition length 2, including RECTANGLE, TANGRAM, KNOT and LWC third-round candidates, can be implemented with a 3-share and 4-share threshold implementation (TI) by decomposing cubic permutations $S$ as a composition of sub-permutations having lower algebraic degrees. We use two decomposition form: one composition of two quadratic permutations $G$ and $F$, $S = Fcirc G$, is for efficiency; the other composition of some linear permutations $A_i$ and one quadratic permutation $G$, $S=A_3 circ G circ A_2 circ G circ A_1 $, is for reducing the area requirements. For $S = Fcirc G$, we introduce a new approach of searching through all possible quadratic permutations $G$ with 2$^{25.71}$, which is effcient than 2$^{26.23}$ in Poschmann et al. at J. Cryptol 2011. For $S=A_3 circ G circ A_2 circ G circ A_1 $, our approach of finding $A_i$ with complexity 2$^{27.71} $, which is effcient than the method introduced by Moradi et al. at ASIACRYPT 2016. In addition, we proposes a new decomposition that $S=G circ A_2 circ G circ A_1 $. We can find the fastest and the smallest hard-ware decomposition implementation of 4-bit permutations for TI with 3 and 4 shares.
掩蔽是一种应用广泛的对抗侧信道攻击的方法，无论是在软件还是硬件上都是如此。由于屏蔽的代价很大，搜索的重点是如何降低性能损失或找到有效的屏蔽实现。特别是，我们的贡献是双重的:对于软件屏蔽，我们首先找到了具有乘法复杂度4和乘法深度2的Sbox的位切片实现，然后采用Coron等人在CHES 2016上引入的公共共享方法，使许多交叉乘积$a_{i}cdot b_{j}$可以被重用用于并行的基于isw的32位非线性操作。因此，我们在32位ARM嵌入式微处理器上，以$(1+d) $ × 32位随机性为代价，提高了2$times b/4/32$并行ISW方案的高阶掩码效率，大约提高了13%-34%的速度。对于硬件掩蔽，通过将立方排列$S$分解为具有较低代数度的子排列的组合，可以用3共享和4共享阈值实现(TI)实现二次分解长度为2的4位立方Sboxes(包括RECTANGLE、TANGRAM、KNOT和LWC第三轮候选)。我们采用了两种分解形式:一种是由两个二次置换$G$和$F$组成，$S = Fcirc G$，是为了效率;另一个线性排列$A_i$和一个二次排列$G$的组合$S=A_3 circ G circ A_2 circ G circ A_1 $是为了减少面积要求。对于$S = Fcirc G$，我们引入了一种用2$^{25.71}$搜索所有可能的二次置换$G$的新方法，该方法比Poschmann et al. J. Cryptol 2011中的2$^{26.23}$高效。对于$S=A_3 circ G circ A_2 circ G circ A_1 $，我们找到复杂度为2$^{27.71}$的$A_i$的方法比Moradi等人在ASIACRYPT 2016上介绍的方法更有效。此外，我们提出了一个新的分解$S=G circ A_2 circ G circ A_1 $。我们可以找到最快和最小的硬件分解实现的4位排列的TI与3和4份额。
{"title":"Secure and Efficient Masking of Lightweight Ciphers in Software and Hardware","authors":"Xuefeng Zhao","doi":"10.1093/comjnl/bxad002","DOIUrl":"https://doi.org/10.1093/comjnl/bxad002","url":null,"abstract":"Abstract Masking is a well used and widely deployed countermeasure against side channel attacks, both in software and hardware. With masking comes at a great cost, search has focused on how to lower a performance penalty or find efficient masking implementation. In particular, our contribution is 2-fold: for software masking, we first find bitsliced implementations of Sbox with Multiplicative Complexity 4 and Multiplicative Depth 2, then adapt the common shares approach introduced by Coron et al. at CHES 2016 to make many cross-products $a_{i}cdot b_{j}$ can be reuse for parallel ISW-based 32-bit nonlinear operations. Therefore, we improve the efficiency of 2$times b/4/32$ parallel high-order masking of ISW scheme for RECTANGLE, TANGRAM and KNOT on 32-bit ARM embedded microprocessor, with roughly a 13%-34% speed-up, at cost of $(1+d) times 32$-bit randomness. For hardware masking, 4 bit cubic Sboxes with quadratic decomposition length 2, including RECTANGLE, TANGRAM, KNOT and LWC third-round candidates, can be implemented with a 3-share and 4-share threshold implementation (TI) by decomposing cubic permutations $S$ as a composition of sub-permutations having lower algebraic degrees. We use two decomposition form: one composition of two quadratic permutations $G$ and $F$, $S = Fcirc G$, is for efficiency; the other composition of some linear permutations $A_i$ and one quadratic permutation $G$, $S=A_3 circ G circ A_2 circ G circ A_1 $, is for reducing the area requirements. For $S = Fcirc G$, we introduce a new approach of searching through all possible quadratic permutations $G$ with 2$^{25.71}$, which is effcient than 2$^{26.23}$ in Poschmann et al. at J. Cryptol 2011. For $S=A_3 circ G circ A_2 circ G circ A_1 $, our approach of finding $A_i$ with complexity 2$^{27.71} $, which is effcient than the method introduced by Moradi et al. at ASIACRYPT 2016. In addition, we proposes a new decomposition that $S=G circ A_2 circ G circ A_1 $. We can find the fastest and the smallest hard-ware decomposition implementation of 4-bit permutations for TI with 3 and 4 shares.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136326043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Correction to: Performance Evaluation of FPGA-Based LSTM Neural Networks for Pulse Signal Detection on Real-Time Radar Warning Receivers","authors":"","doi":"10.1093/comjnl/bxad021","DOIUrl":"https://doi.org/10.1093/comjnl/bxad021","url":null,"abstract":"","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135946315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract In this paper, initially, message intensities are used to create two encoding tables: an index and a code sequence. The table is then updated with $n$ secret data encoded into it. If the code sequence of the second encoding table matches the code sequence of the preceding or succeeding half of the two encoding tables, the second encoding table is folded. The folding is done when maximum intensity occurs in the utmost succeeding part of the two encoding tables. Finally, using the combination orientation approach, the encoded indices are embedded in the stego images. In the extraction phase, using the two stego images and the encoding with the combination orientation method, the encoded indices are obtained. The decoding is performed to extract the secret message as well as the cover image and there is no occurrence of overflow and underflow problems. It has a high visual quality and a high embedding capacity. The proposed technique achieved a maximum $mathrm{PSNR}$ of $49.49$dB and a $648 242$-bit embedding capacity. When compared to traditional techniques, the experimental results show that the proposed method outperforms them.
{"title":"Encoding with Combination Orientation Technique for RDH in Dual Stego Images","authors":"C Shaji, I Shatheesh Sam","doi":"10.1093/comjnl/bxac178","DOIUrl":"https://doi.org/10.1093/comjnl/bxac178","url":null,"abstract":"Abstract In this paper, initially, message intensities are used to create two encoding tables: an index and a code sequence. The table is then updated with $n$ secret data encoded into it. If the code sequence of the second encoding table matches the code sequence of the preceding or succeeding half of the two encoding tables, the second encoding table is folded. The folding is done when maximum intensity occurs in the utmost succeeding part of the two encoding tables. Finally, using the combination orientation approach, the encoded indices are embedded in the stego images. In the extraction phase, using the two stego images and the encoding with the combination orientation method, the encoded indices are obtained. The decoding is performed to extract the secret message as well as the cover image and there is no occurrence of overflow and underflow problems. It has a high visual quality and a high embedding capacity. The proposed technique achieved a maximum $mathrm{PSNR}$ of $49.49$dB and a $648 242$-bit embedding capacity. When compared to traditional techniques, the experimental results show that the proposed method outperforms them.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134921182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Primkopal Lanmar Jakarta Swimming Pool is one of the swimming pools under the auspices of the Jakarta Marine Base Marine Cooperative Primary which is engaged in business, in the form of Pool Rentals. Until now, Pool Ticket Ordering is still done manually. The method used by the Primkopal Swimming Pool management is currently inefficient. Therefore, this study has the objectives, (1) Designing a swimming pool ticket booking application that can be easily and quickly accessed by customers via gadgets, (2) Designing a swimming pool ticket ordering application that can be used by employees to update availability status information swimming pool, and (3) Designing a swimming pool ticket booking application that can provide an overview of the facilities offered by Primkopal Swimming Pool. From this goal, the authors built and designed an Android-based application for ordering e-tickets at the Lanmar Jakarta Navy Cooperative Primary Pool (Primkopal) with the First Come First Serve method using Android Studio and Firebase. The final result of this research is to improve the quality and service for prospective purchasers of Primkopal Lanmar Jakarta Swimming Pool Tickets.
{"title":"Aplikasi Pemesanan E-Ticket di Kolam Renang Primer Koperasi Angkatan Laut (Primkopal) Lanmar Jakarta Berbasis Android dengan Metode First Come First Serve Menggunakan Android Studio dan Firebase","authors":"Andi Nurwansyah, NM Faizah, Winton Ginting","doi":"10.58477/cj.v1i1.63","DOIUrl":"https://doi.org/10.58477/cj.v1i1.63","url":null,"abstract":"Primkopal Lanmar Jakarta Swimming Pool is one of the swimming pools under the auspices of the Jakarta Marine Base Marine Cooperative Primary which is engaged in business, in the form of Pool Rentals. Until now, Pool Ticket Ordering is still done manually. The method used by the Primkopal Swimming Pool management is currently inefficient. Therefore, this study has the objectives, (1) Designing a swimming pool ticket booking application that can be easily and quickly accessed by customers via gadgets, (2) Designing a swimming pool ticket ordering application that can be used by employees to update availability status information swimming pool, and (3) Designing a swimming pool ticket booking application that can provide an overview of the facilities offered by Primkopal Swimming Pool. From this goal, the authors built and designed an Android-based application for ordering e-tickets at the Lanmar Jakarta Navy Cooperative Primary Pool (Primkopal) with the First Come First Serve method using Android Studio and Firebase. The final result of this research is to improve the quality and service for prospective purchasers of Primkopal Lanmar Jakarta Swimming Pool Tickets.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84017405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Aceh High Prosecutor's Office is one of the most important parts of the Unitary State of the Republic of Indonesia's High Prosecutor's office. The Aceh High Prosecutor's Office is the "spearhead" of the Prosecutor's Office, even the performance of the Aceh High Prosecutor's Office is often measured by the community through the success of the Aceh High Prosecutor's Office in handling specific criminal cases. One of the duties of the Aceh High Prosecutor's Office is to process data on case files which are numerous and complex. Good data management is needed to ensure that these data can be used to generate information and make decisions. From the description of the background, the author limits the problem only to the design of a special crime case data system at the Aceh High Prosecutor's Office. The purpose of the discussion is to find out and design a data system design for special criminal cases at the web-based Aceh High Court. For the perfection of this research, the authors collected data using several data collection methods, including using field studies and literature studies as well as the waterfall method as a system development model. The system will really help users or managers of special criminal case data at the Aceh High Court more quickly, easily and accurately in every activity related to Special Crimes.
{"title":"Sistem Informasi Data Perkara Tindak Pidana Khusus Pada Kejaksaan Tinggi Aceh","authors":"M. Fikri, Imilda, Syarifuddin","doi":"10.58477/cj.v1i1.33","DOIUrl":"https://doi.org/10.58477/cj.v1i1.33","url":null,"abstract":"The Aceh High Prosecutor's Office is one of the most important parts of the Unitary State of the Republic of Indonesia's High Prosecutor's office. The Aceh High Prosecutor's Office is the \"spearhead\" of the Prosecutor's Office, even the performance of the Aceh High Prosecutor's Office is often measured by the community through the success of the Aceh High Prosecutor's Office in handling specific criminal cases. One of the duties of the Aceh High Prosecutor's Office is to process data on case files which are numerous and complex. Good data management is needed to ensure that these data can be used to generate information and make decisions. From the description of the background, the author limits the problem only to the design of a special crime case data system at the Aceh High Prosecutor's Office. The purpose of the discussion is to find out and design a data system design for special criminal cases at the web-based Aceh High Court. For the perfection of this research, the authors collected data using several data collection methods, including using field studies and literature studies as well as the waterfall method as a system development model. The system will really help users or managers of special criminal case data at the Aceh High Court more quickly, easily and accurately in every activity related to Special Crimes.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84030735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Deo Rangga Sada Siregar, Lucky Koryanto, NM Faizah
The hotel is a resort for Jakarta and out of town people. Not all hotel locations are known to the public. Both in Jakarta city and out of city. This is due to the lack of information about hotels in Depok City. In order to be able to quickly provide information that can be used anytime, anywhere, it is necessary to advance and develop the times, such as the use of today's technology. B. Using an Android-based smartphone application to help a member of the public find a location and find a route to his Hotel of interest. Jakarta city. The waterfall process model is adopted as a research method. The hotel search application implementation uses JavaScript programming using Android Studio, location-based services, and maps sourced from the Google Maps API. The results of the survey are provided in the form of an Android-based hotel locator application in Jakarta city, allowing residents inside and outside Jakarta to find information about hotels and easily route from the user's location to the desired hotel in Jakarta. You will be able to obtain Cities with the help of GPS.
{"title":"Aplikasi Pencarian Hotel di Kota Jakarta Berbasis Android dengan Metode Location Based Service (LBS) Menggunakan Android Studio","authors":"Deo Rangga Sada Siregar, Lucky Koryanto, NM Faizah","doi":"10.58477/cj.v1i1.65","DOIUrl":"https://doi.org/10.58477/cj.v1i1.65","url":null,"abstract":"The hotel is a resort for Jakarta and out of town people. Not all hotel locations are known to the public. Both in Jakarta city and out of city. This is due to the lack of information about hotels in Depok City. In order to be able to quickly provide information that can be used anytime, anywhere, it is necessary to advance and develop the times, such as the use of today's technology. B. Using an Android-based smartphone application to help a member of the public find a location and find a route to his Hotel of interest. Jakarta city. The waterfall process model is adopted as a research method. The hotel search application implementation uses JavaScript programming using Android Studio, location-based services, and maps sourced from the Google Maps API. The results of the survey are provided in the form of an Android-based hotel locator application in Jakarta city, allowing residents inside and outside Jakarta to find information about hotels and easily route from the user's location to the desired hotel in Jakarta. You will be able to obtain Cities with the help of GPS.","PeriodicalId":50641,"journal":{"name":"Computer Journal","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87820868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：