Claim Missing Document
Check
Articles

Found 22 Documents
Search

Scenarios for Securing Content Delivery in the DRM Environment Prihandoko, Antonius Cahya; Ghodosi, Hossein; Litow, Bruce
INFORMAL: Informatics Journal Vol 1, No 1 (2016): INFORMAL: Informatics Journal
Publisher : Program Studi Sistem Informasi - Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In the DRM environment, content is usually distributed in an encrypted form. Typically,a secure encryption algorithm is utilized to accomplish such protection. However, executingthis algorithm in an insecure environment may allow adversaries to compromise the system andobtain information about the decryption key. Keeping such a key secret is a major challengefor content distribution systems. We consider two solutions for securing content delivery. Thefirst solution involves modifying the algorithm in such a way as to make implementation unintelligible.The second solution involves setting a buyer-seller protocol to communicate the keysecurely. In addition, the protocol can be set to achieve security for the content provider andprivacy protection for user. This paper describes a study of these scenarios for DRM applicationsw.r.t securing content delivery.
Stream-keys generation based on graph labeling for strengthening Vigenere encryption Antonius Cahya Prihandoko; Dafik Dafik; Ika Hesti Agustin
International Journal of Electrical and Computer Engineering (IJECE) Vol 12, No 4: August 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v12i4.pp3960-3969

Abstract

This paper address the cryptographic keys management problem: how to generate the cryptographic keys and apply them to secure encryption. The purpose of this research was to study on utilizing graph labeling for generating stream-keys and implementing the keys for strengthening Vigenere encryption. To achieve this objective, the research was carried out in four stages: developing an algorithm for generating stream-keys, testing the randomness of the constructed keys, implementing the eligible keys in a modified Vigenere encryption and, finally, analyzing the security of the encryption. As the result, most of stream-keys produced by the algorithm are random, and the implementation of the stream keys to the modified Vigenere cipher achieve good security. The contributions of this research are utilizing graph labeling to generate stream-keys and providing different encryption keys for different blocks in a block based cipher with low storage capacity. The novel technical results yielded from this research are the algorithm of developing the source of the stream-keys based on graph labeling, the algorithm of constructing the initial block keys, and the protocol of a modified Vigenere encryption using stream-keys and operated in cipher block chaining mode.
PEWARNAAN TITIK TOTAL ANTIAJAIB LOKAL PADA GRAF HASIL OPERASI KORONA DAN KAITANNYA DENGAN KETERAMPILAN BERPIKIR TINGKAT TINGGI Safira Izza Ghafrina; Slamin Slamin; Dafik Dafik; Arif Fatahillah; Antonius Cahya Prihandoko
Saintifika Vol 20 No 2 (2018)
Publisher : Jurusan Pendidikan MIPA FKIP Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Penelitian ini merupakan pengembangan dari paper berjudul “Local Antimagic Vertex Coloring of a Graph” oleh Arumugam et al. mengenai pewarnaan titik dengan pelabelan sisi pada graf khusus yang bertujuan untuk menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona. Penelitian juga akan menganalisis tentang keterkaitan antara pewarnaan titik total antiajaib lokal dengan pewarnaan titik antiajaib lokal pada graf hasil operasi korona ; Dan Menganalisis kaitan keterampilan berpikir tingkat tinggi dalam menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona yang diteliti menggunakan Taksonomi Bloom Revisi. Dalam penelitian ini digunakan instrumen validasi untuk mengetahui pencapaian tingkat keterampilan berpikir tinggi. Hasilnya, ditemukan teorema baru yang membuktikan bahwa bilangan kromatik antiajaib lokal oleh Arumugam lebih besar dibandingkan bilangan kromatik total antiajaib lokal . Dalam penelitian ini juga menghasilkan kaitan keterampilan berpikir tingkat tinggi dalam menentukan pewarnaan titik total antiajaib lokal pada graf hasil operasi korona yang diteliti.
Implementasi Metode Weighted Moving Average Untuk Sistem Peramalan Penjualan Markas Coffee Muchamad Rizqi; Antonius Cahya; Nova El Maida
INFORMAL: Informatics Journal Vol 6 No 3 (2021): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v6i3.28467

Abstract

Headquarters Coffee is one of the businesses engaged in the culinary field of coffee drinks. The problem that occurs at the Coffee Headquarters is that business activities are still carried out manually. In addition, determining sales in the next period only refers to the sales data of the previous period, resulting in owners often experiencing shortages or excess stocks of coffee to be sold due to uncertain sales. Therefore we need a forecasting method (Forecasting) that is appropriate and can be applied to an Information System in the form of a Website. The purpose of making this forecasting information system is to assist companies in recording sales to make it more practical by applying the Weighted Moving Average (WMA) method. From the results of the calculation of the WMA method, the level of accuracy will then be calculated using the Mean Absolute Percentage Error (MAPE) method. The results of forecasting by applying the WMA method and MAPE calculations on weights 3, 4 and 5 show that the Robusta coffee on the Robusta menu which has the smallest MAPE is weight 3 with a calculation result of 19.2499 and the Robusta Milk menu which has the smallest MAPE is weight 4 with the calculation result is 15.21879166 and Excelsa coffee on the excelsa menu which has the smallest MAPE is weight 3 with a calculation result of 19.1538 and the Excelsa Susu menu which has the smallest MAPE is weight 5 with a calculation of 17.27650182 while for Arabica coffee on the Arabica menu which has the smallest MAPE is weight 4 with a calculation result of 18.1735 and the Arabica Susu menu which has the smallest MAPE is weight 5 with a calculation result of 16.24012072. Where the Mape value produced by each type of coffee is still below 20%, which means the forecasting results can be categorized as good.
Traitor Tracing Schemes: a Review Antonius Cahya Prihandoko
INFORMAL: Informatics Journal Vol 3 No 2 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i2.9988

Abstract

This paper provides a review on traitor tracing schemes that are developed to counter piracy strategies. The review starts with a formal definition of the traitor tracing schemes. The paper is then outlined based on two main strategies which may taken by digital content pirates. Mostly the pirates have strategy to make use leaked decryption key or leaked decrypted content. For each piracy strategy, we presents traitor tracing schemes that can be used to counter the piracy. We also analysis strength and weakness of each group of the schemes. At the end of this paper, we propose to combine some schemes for better protection.
Scenarios for Securing Content Delivery in the DRM Environment Antonius Cahya Prihandoko; Hossein Ghodosi; Bruce Litow
INFORMAL: Informatics Journal Vol 1 No 1 (2016): INFORMAL: Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In the DRM environment, content is usually distributed in an encrypted form. Typically,a secure encryption algorithm is utilized to accomplish such protection. However, executingthis algorithm in an insecure environment may allow adversaries to compromise the system andobtain information about the decryption key. Keeping such a key secret is a major challengefor content distribution systems. We consider two solutions for securing content delivery. Thefirst solution involves modifying the algorithm in such a way as to make implementation unintelligible.The second solution involves setting a buyer-seller protocol to communicate the keysecurely. In addition, the protocol can be set to achieve security for the content provider andprivacy protection for user. This paper describes a study of these scenarios for DRM applicationsw.r.t securing content delivery.
On The Total r-dynamic Coloring of Edge Comb Product graph G D H Dwi Agustin Retno Wardani; Dafik Dafik; Antonius C. Prihandoko; Arika I. Kristiana
UNEJ e-Proceeding 2016: Proceeding The 1st International Basic Science Conference
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Given that two natural numbers r, k. By a proper total k-coloring of a graph G, we mean a map c : V (G) ∪ E(G) → {1, 2, . . . , k}, such that any two adjacent vertices and incident edges receive different colors. A total r-dynamic coloring is a proper k-coloring c of G, such that ∀v ∈ V (G), |c(N(v))| ≥ min{r, d(v) + |N(v)|} and ∀e ∈ E(G), |c(N(e))| ≥ min{r, d(v) + d(u)}. The total r-dynamic chromatic number, written as χ ”r(G), is the minimum k such that G has an r-dynamic total k-coloring. A total r-dynamic coloring is a natural extension of r-dynamic coloring in which we consider more condition of the concept, namely not only assign a color on the vertices as well as on the edges. Consequently, this study will be harder. In this paper, we will initiate to analyze a total r-dynamic of an edge comb product of two graphs, denoted by H D K, where H is path graph and K is any special graph. The result shows that the total r-dynamic chromatic number of Pn D K.
Winter Exponential Smoothing: Sales Forecasting on Purnama Jati Souvenirs Center Fahrobby Adnan; Putri Damayanti; Gama Fajarianto; Antonius Cahya Prihandoko
Proceeding of the Electrical Engineering Computer Science and Informatics Vol 5: EECSI 2018
Publisher : IAES Indonesia Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (343.058 KB) | DOI: 10.11591/eecsi.v5.1702

Abstract

Forecasting is the process of making predictions of the future based on past and present data and most commonly by analysis of trends. In sales area, an accurate sales forecasting system will help the company to improve the customers' satisfaction, reduce destruction of products, increase sales revenue and make production plan efficiently. Purnama Jati is a typical Jember souvenir place like "prol tape", "pia tape", "brownies tape" and so forth. Every day, sales on every outlet is uncertain so Purnama Jati repeatedly send to the outlets if the stock has run out. This research will focuse on "prol tape" cake, "pia tape" cake product as the research object. In this research we will use winter exponential smoothing as a forecasting method due to suitable character with the case.
Onyx and Marmer Objects Modeling by Joining and Choosing Parametric 2) 1) Modifications of Bezier Revolution Surfaces Kusno Kusno; Antonius Cahya P; Mahros Darsin
Jurnal ILMU DASAR Vol 8 No 2 (2007)
Publisher : Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (396.202 KB)

Abstract

We formulate application of Bezier revolution surfaces for modeling onyx and marmer objects in three steps as the following. Firstly, calculating the parametric representation of Bezier revolution surfaces and its shape modification in some different forms is done. Secondly, we formulate parametric continuity for joining the surfaces. Finally, the application of those formulas for modeling onyx and marmer objects of revolution by using computer are simulated.
Alternatif otentikasi menggunakan metode steganografi histogram shifting Irsandy Maulana Satya Viddin; Antonius Cahya Prihandoko; Diksy Media Firmansyah
Jurnal Teknologi dan Sistem Komputer Volume 9, Issue 2, Year 2021 (April 2021)
Publisher : Department of Computer Engineering, Engineering Faculty, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14710/jtsiskom.2021.13931

Abstract

Penelitian ini bertujuan mengembangkan alternatif otentikasi dengan menerapkan metode steganografi Histogram shifting. Media yang digunakan untuk otentikasi adalah media citra. Histogram shifting memanfaatkan histogram suatu citra untuk menyisipkan pesan rahasia. Alternatif otentikasi telah menerapkan metode Histogram shifting untuk menyisipkan kredensial pengguna ke dalam citra pembawa. Citra hasil steganografi dapat digunakan untuk masuk ke akun pengguna dengan cara mengekstrak kredensial dari citra tersebut ketika proses log in. Pengujian PSNR citra stego menghasilkan nilai rata-rata sebesar 52,52 dB. Pengujian kemampuan ekstraksi menunjukkan semua citra uji dapat diekstrak dengan tepat. Selain itu, metode otentikasi ini juga lebih tahan terhadap serangan yang umum dilakukan pada otentikasi menggunakan kata sandi.