CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: secret message</title> <meta name="description" content="Search results for: secret message"> <meta name="keywords" content="secret message"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="secret message" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="secret message"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 458</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: secret message</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">458</span> A New Authenticable Steganographic Method via the Use of Numeric Data on Public Websites</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Che-Wei%20Lee">Che-Wei Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Bay-Erl%20Lai"> Bay-Erl Lai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new steganographic method via the use of numeric data on public websites with self-authentication capability is proposed. The proposed technique transforms a secret message into partial shares by Shamir’s (k, n)-threshold secret sharing scheme with n = k + 1. The generated k+1 partial shares then are embedded into the selected numeric items in a website as if they are part of the website’s numeric content. Afterward, a receiver links to the website and extracts every k shares among the k+1 ones from the stego-numeric-content to compute k+1 copies of the secret, and the phenomenon of value consistency of the computed k+1 copies is taken as an evidence to determine whether the extracted message is authentic or not, attaining the goal of self-authentication of the extracted secret message. Experimental results and discussions are provided to show the feasibility and effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20hiding" title=" data hiding"> data hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20authentication" title=" secret authentication"> secret authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/27578/a-new-authenticable-steganographic-method-via-the-use-of-numeric-data-on-public-websites" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27578.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">243</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">457</span> Secure Message Transmission Using Meaningful Shares</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ajish%20Sreedharan">Ajish Sreedharan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual cryptography encodes a secret image into shares of random binary patterns. If the shares are exerted onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the shares, however, have no visual meaning and hinder the objectives of visual cryptography. In the Secret Message Transmission through Meaningful Shares a secret message to be transmitted is converted to grey scale image. Then (2,2) visual cryptographic shares are generated from this converted gray scale image. The shares are encrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. Two separate color images which are of the same size of the shares, taken as cover image of the respective shares to hide the shares into them. The encrypted shares which are covered by meaningful images so that a potential eavesdropper wont know there is a message to be read. The meaningful shares are transmitted through two different transmission medium. During decoding shares are fetched from received meaningful images and decrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. The shares are combined to regenerate the grey scale image from where the secret message is obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title="visual cryptography">visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=meaningful%20shares" title=" meaningful shares"> meaningful shares</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20scale%20image" title=" grey scale image"> grey scale image</a> </p> <a href="https://publications.waset.org/abstracts/16629/secure-message-transmission-using-meaningful-shares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16629.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">455</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">456</span> A Novel Approach of Secret Communication Using Douglas-Peucker Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Kiruthika">R. Kiruthika</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Kannan"> A. Kannan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Steganography is the problem of hiding secret messages in 'innocent – looking' public communication so that the presence of the secret message cannot be detected. This paper introduces a steganographic security in terms of computational in-distinguishability from a channel of probability distributions on cover messages. This method first splits the cover image into two separate blocks using Douglas – Peucker algorithm. The text message and the image will be hided in the Least Significant Bit (LSB) of the cover image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=lsb" title=" lsb"> lsb</a>, <a href="https://publications.waset.org/abstracts/search?q=embedding" title=" embedding"> embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=Douglas-Peucker%20algorithm" title=" Douglas-Peucker algorithm"> Douglas-Peucker algorithm</a> </p> <a href="https://publications.waset.org/abstracts/29673/a-novel-approach-of-secret-communication-using-douglas-peucker-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">455</span> Data Hiding in Gray Image Using ASCII Value and Scanning Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20K.%20Pateriya">R. K. Pateriya</a>, <a href="https://publications.waset.org/abstracts/search?q=Jyoti%20Bharti"> Jyoti Bharti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an approach for data hiding methods which provides a secret communication between sender and receiver. The data is hidden in gray-scale images and the boundary of gray-scale image is used to store the mapping information. In this an approach data is in ASCII format and the mapping is in between ASCII value of hidden message and pixel value of cover image, since pixel value of an image as well as ASCII value is in range of 0 to 255 and this mapping information is occupying only 1 bit per character of hidden message as compared to 8 bit per character thus maintaining good quality of stego image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ASCII%20value" title="ASCII value">ASCII value</a>, <a href="https://publications.waset.org/abstracts/search?q=cover%20image" title=" cover image"> cover image</a>, <a href="https://publications.waset.org/abstracts/search?q=PSNR" title=" PSNR"> PSNR</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20value" title=" pixel value"> pixel value</a>, <a href="https://publications.waset.org/abstracts/search?q=stego%20image" title=" stego image"> stego image</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20message" title=" secret message"> secret message</a> </p> <a href="https://publications.waset.org/abstracts/50472/data-hiding-in-gray-image-using-ascii-value-and-scanning-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50472.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">413</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">454</span> High Secure Data Hiding Using Cropping Image and Least Significant Bit Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khalid%20A.%20Al-Afandy">Khalid A. Al-Afandy</a>, <a href="https://publications.waset.org/abstracts/search?q=El-Sayyed%20El-Rabaie"> El-Sayyed El-Rabaie</a>, <a href="https://publications.waset.org/abstracts/search?q=Osama%20Salah"> Osama Salah</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20El-Mhalaway"> Ahmed El-Mhalaway</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a high secure data hiding technique using image cropping and Least Significant Bit (LSB) steganography. The predefined certain secret coordinate crops will be extracted from the cover image. The secret text message will be divided into sections. These sections quantity is equal the image crops quantity. Each section from the secret text message will embed into an image crop with a secret sequence using LSB technique. The embedding is done using the cover image color channels. Stego image is given by reassembling the image and the stego crops. The results of the technique will be compared to the other state of art techniques. Evaluation is based on visualization to detect any degradation of stego image, the difficulty of extracting the embedded data by any unauthorized viewer, Peak Signal-to-Noise Ratio of stego image (PSNR), and the embedding algorithm CPU time. Experimental results ensure that the proposed technique is more secure compared with the other traditional techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=stego" title=" stego"> stego</a>, <a href="https://publications.waset.org/abstracts/search?q=LSB" title=" LSB"> LSB</a>, <a href="https://publications.waset.org/abstracts/search?q=crop" title=" crop"> crop</a> </p> <a href="https://publications.waset.org/abstracts/44747/high-secure-data-hiding-using-cropping-image-and-least-significant-bit-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44747.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">269</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">453</span> VDGMSISS: A Verifiable and Detectable Multi-Secret Images Sharing Scheme with General Access Structure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Justie%20Su-Tzu%20Juan">Justie Su-Tzu Juan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming-Jheng%20Li"> Ming-Jheng Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Fen%20Lee"> Ching-Fen Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruei-Yu%20Wu"> Ruei-Yu Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A secret image sharing scheme is a way to protect images. The main idea is dispersing the secret image into numerous shadow images. A secret image sharing scheme can withstand the impersonal attack and achieve the highly practical property of multiuse  is more practical. Therefore, this paper proposes a verifiable and detectable secret image-sharing scheme called VDGMSISS to solve the impersonal attack and to achieve some properties such as encrypting multi-secret images at one time and multi-use. Moreover, our scheme can also be used for any genera access structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-secret%20image%20sharing%20scheme" title="multi-secret image sharing scheme">multi-secret image sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=verifiable" title=" verifiable"> verifiable</a>, <a href="https://publications.waset.org/abstracts/search?q=de-tectable" title=" de-tectable"> de-tectable</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20access%20structure" title=" general access structure"> general access structure</a> </p> <a href="https://publications.waset.org/abstracts/118758/vdgmsiss-a-verifiable-and-detectable-multi-secret-images-sharing-scheme-with-general-access-structure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118758.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">126</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">452</span> Application of Modulo-2 Arithmetic in Securing Communicated Messages throughout the Globe </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ejd%20Garba">Ejd Garba</a>, <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin"> Okike Benjamin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today, the word encryption has become very popular even among non-computer professionals. There is no doubt that some works have been carried out in this area, but more works need to be done. Presently, most of the works on encryption is concentrated on the sender of the message without paying any attention to the message recipient. However, it is a good practice if any message sent to someone is received by the particular person whom the message is sent to. This work seeks to ensure that at the receiving end of the message, there is a security to ensure that the recipient computes a key that would enable the encrypted message to be accessed. This key would be in form of password. This would make it possible for a given message to be sent to several people at the same time. When this happens, it is only those people who computes the key correctly that would be given the opportunity to access even the encrypted message, which can in turn be decrypted using the appropriate key. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=arithmetic" title="arithmetic">arithmetic</a>, <a href="https://publications.waset.org/abstracts/search?q=cyber%20space" title=" cyber space"> cyber space</a>, <a href="https://publications.waset.org/abstracts/search?q=modulo-2" title=" modulo-2"> modulo-2</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20security" title=" information security "> information security </a> </p> <a href="https://publications.waset.org/abstracts/30281/application-of-modulo-2-arithmetic-in-securing-communicated-messages-throughout-the-globe" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30281.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">320</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">451</span> Advertising Message Strategy on Ghana’s TV</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aisha%20Iddrisu">Aisha Iddrisu</a>, <a href="https://publications.waset.org/abstracts/search?q=Ferruh%20Uztu%C4%9F"> Ferruh Uztuğ</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study is a quantitative content analysis of advertising message strategies used in Ghana’s TV commercials (2020-2021) using the modified strategy of Wang and Praet (2016) with the objective of exploring the various advertising message strategies used in Ghana’s TV advertisement, its variation according to product category including the most widely used message strategy. The findings indicate that, out of the 220 commercials used in the study, the Affective message strategy (n=122, 55%) was the dominant message strategy used in Ghana’s TV commercials. The most advertised product category in Ghana’s TV commercials (2020-2021) was the food category, and a significant relationship was observed between message strategy and product category as well as message strategy and brand type. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=advertising" title="advertising">advertising</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20strategy" title=" message strategy"> message strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=Ghana" title=" Ghana"> Ghana</a>, <a href="https://publications.waset.org/abstracts/search?q=television" title=" television"> television</a> </p> <a href="https://publications.waset.org/abstracts/170306/advertising-message-strategy-on-ghanas-tv" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/170306.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">184</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">450</span> Proposed Terminal Device for End-to-End Secure SMS in Cellular Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Neetesh%20Saxena">Neetesh Saxena</a>, <a href="https://publications.waset.org/abstracts/search?q=Narendra%20S.%20Chaudhari"> Narendra S. Chaudhari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, SMS is a very popular mobile service and even the poor, illiterate people and those living in rural areas use SMS service very efficiently. Although many mobile operators have already started 3G and 4G services, 2G services are still being used by the people in many countries. In 2G (GSM), only encryption provided is between the MS and the BTS, there is no end-to-end encryption available. Sometimes we all need to send some confidential message to other person containing bank account number, some password, financial details, etc. Normally, a message is sent in plain text only to the recipient and it is not an acceptable standard for transmitting such important and confidential information. Authors propose an end-to-end encryption approach by proposing a terminal for sending/receiving a secure message. An asymmetric key exchange algorithm is used in order to transmit secret shared key securely to the recipient. The proposed approach with terminal device provides authentication, confidentiality, integrity and non-repudiation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AES" title="AES">AES</a>, <a href="https://publications.waset.org/abstracts/search?q=DES" title=" DES"> DES</a>, <a href="https://publications.waset.org/abstracts/search?q=Diffie-Hellman" title=" Diffie-Hellman"> Diffie-Hellman</a>, <a href="https://publications.waset.org/abstracts/search?q=ECDH" title=" ECDH"> ECDH</a>, <a href="https://publications.waset.org/abstracts/search?q=A5" title=" A5"> A5</a>, <a href="https://publications.waset.org/abstracts/search?q=SMS" title=" SMS"> SMS</a> </p> <a href="https://publications.waset.org/abstracts/7993/proposed-terminal-device-for-end-to-end-secure-sms-in-cellular-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7993.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">415</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">449</span> Mathematical Model That Using Scrambling and Message Integrity Methods in Audio Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Salem%20Atoum">Mohammed Salem Atoum</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The success of audio steganography is to ensure imperceptibility of the embedded message in stego file and withstand any form of intentional or un-intentional degradation of message (robustness). Audio steganographic that utilized LSB of audio stream to embed message gain a lot of popularity over the years in meeting the perceptual transparency, robustness and capacity. This research proposes an XLSB technique in order to circumvent the weakness observed in LSB technique. Scrambling technique is introduce in two steps; partitioning the message into blocks followed by permutation each blocks in order to confuse the contents of the message. The message is embedded in the MP3 audio sample. After extracting the message, the permutation codebook is used to re-order it into its original form. Md5sum and SHA-256 are used to verify whether the message is altered or not during transmission. Experimental result shows that the XLSB performs better than LSB. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=XLSB" title="XLSB">XLSB</a>, <a href="https://publications.waset.org/abstracts/search?q=scrambling" title=" scrambling"> scrambling</a>, <a href="https://publications.waset.org/abstracts/search?q=audio%20steganography" title=" audio steganography"> audio steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/42449/mathematical-model-that-using-scrambling-and-message-integrity-methods-in-audio-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42449.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">448</span> Secret Sharing in Visual Cryptography Using NVSS and Data Hiding Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Misha%20Alexander">Misha Alexander</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20Waykar"> S. B. Waykar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual Cryptography is a special unbreakable encryption technique that transforms the secret image into random noisy pixels. These shares are transmitted over the network and because of its noisy texture it attracts the hackers. To address this issue a Natural Visual Secret Sharing Scheme (NVSS) was introduced that uses natural shares either in digital or printed form to generate the noisy secret share. This scheme greatly reduces the transmission risk but causes distortion in the retrieved secret image through variation in settings and properties of digital devices used to capture the natural image during encryption / decryption phase. This paper proposes a new NVSS scheme that extracts the secret key from randomly selected unaltered multiple natural images. To further improve the security of the shares data hiding techniques such as Steganography and Alpha channel watermarking are proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20visual%20secret%20sharing" title=" natural visual secret sharing"> natural visual secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20images" title=" natural images"> natural images</a>, <a href="https://publications.waset.org/abstracts/search?q=noisy%20share" title=" noisy share"> noisy share</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20swapping" title=" pixel swapping"> pixel swapping</a> </p> <a href="https://publications.waset.org/abstracts/33268/secret-sharing-in-visual-cryptography-using-nvss-and-data-hiding-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">404</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">447</span> A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hui-Chuan%20Lu">Hui-Chuan Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret-sharing%20scheme" title="secret-sharing scheme">secret-sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20information%20ratio" title=" average information ratio"> average information ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=star%20covering" title=" star covering"> star covering</a>, <a href="https://publications.waset.org/abstracts/search?q=deduction" title=" deduction"> deduction</a>, <a href="https://publications.waset.org/abstracts/search?q=core%20cluster" title=" core cluster"> core cluster</a> </p> <a href="https://publications.waset.org/abstracts/9671/a-new-bound-on-the-average-information-ratio-of-perfect-secret-sharing-schemes-for-access-structures-based-on-bipartite-graphs-of-larger-girth" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9671.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">446</span> Secure E-Pay System Using Steganography and Visual Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Suganya%20Devi">K. Suganya Devi</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Srinivasan"> P. Srinivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20P.%20Vaishnave"> M. P. Vaishnave</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Arutperumjothi"> G. Arutperumjothi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today’s internet world is highly prone to various online attacks, of which the most harmful attack is phishing. The attackers host the fake websites which are very similar and look alike. We propose an image based authentication using steganography and visual cryptography to prevent phishing. This paper presents a secure steganographic technique for true color (RGB) images and uses Discrete Cosine Transform to compress the images. The proposed method hides the secret data inside the cover image. The use of visual cryptography is to preserve the privacy of an image by decomposing the original image into two shares. Original image can be identified only when both qualified shares are simultaneously available. Individual share does not reveal the identity of the original image. Thus, the existence of the secret message is hard to be detected by the RS steganalysis. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20security" title="image security">image security</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20LSB" title=" random LSB"> random LSB</a>, <a href="https://publications.waset.org/abstracts/search?q=steganography" title=" steganography"> steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title=" visual cryptography"> visual cryptography</a> </p> <a href="https://publications.waset.org/abstracts/67554/secure-e-pay-system-using-steganography-and-visual-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67554.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">330</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">445</span> Cloud Data Security Using Map/Reduce Implementation of Secret Sharing Schemes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sara%20Ibn%20El%20Ahrache">Sara Ibn El Ahrache</a>, <a href="https://publications.waset.org/abstracts/search?q=Tajje-eddine%20Rachidi"> Tajje-eddine Rachidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Badir"> Hassan Badir</a>, <a href="https://publications.waset.org/abstracts/search?q=Abderrahmane%20Sbihi"> Abderrahmane Sbihi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user’s convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k,n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. In this paper, we present a Mapreduce implementation of Shamir’s secret sharing scheme to increase its performance and to achieve optimal security for cloud data. Different tests were run and through it has been demonstrated the contributions of the proposed approach. These contributions are quite considerable in terms of both security and performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20security" title=" data security"> data security</a>, <a href="https://publications.waset.org/abstracts/search?q=Mapreduce" title=" Mapreduce"> Mapreduce</a>, <a href="https://publications.waset.org/abstracts/search?q=Shamir%27s%20secret%20sharing" title=" Shamir's secret sharing"> Shamir's secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/61331/cloud-data-security-using-mapreduce-implementation-of-secret-sharing-schemes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">306</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">444</span> Exploring Framing Effect and Repetition Effect of the Persuasive Message on Moral Decision Making in Conflict of Interests</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sae-Yeon%20Seong">Sae-Yeon Seong</a>, <a href="https://publications.waset.org/abstracts/search?q=EunSun%20Chung"> EunSun Chung</a>, <a href="https://publications.waset.org/abstracts/search?q=Dongjoo%20Chin"> Dongjoo Chin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conflict of interest (COI) is one of the dominant circumstantial factors of moral corruption across various fields. Several management strategies have been proposed to prevent self-interested decision making in COIs. Among these strategies, message persuasion has been considered as a practical and effective approach. Framing and repetition are two of the major factors in the persuasion effect of message. Therefore, their effect on moral decision making in COI should be explored systematically. The purpose of this study was to compare the differential effects of positively framed message and negatively framed message, and secondly, to investigate how the effectiveness of persuasive message changes through repetitive exposures. A total of 63 participants were randomly assigned to one of 3 framing conditions: positive framing, negative framing, and no-message condition. Prior to the online experiment involving a consultation task, the differently framed persuasive message was presented to the participants. This process was repeated four times in a row. The results showed that participants with positive-framing message were less likely to provide self-interested consultation than participants in the no-message condition. Also, a U-shaped quadric relation between repetition and self-interest consultation was found. Implications and limitations are further discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conflicts%20of%20interest" title="conflicts of interest">conflicts of interest</a>, <a href="https://publications.waset.org/abstracts/search?q=persuasive%20message" title=" persuasive message"> persuasive message</a>, <a href="https://publications.waset.org/abstracts/search?q=framing%20effect" title=" framing effect"> framing effect</a>, <a href="https://publications.waset.org/abstracts/search?q=repetition%20effect" title=" repetition effect"> repetition effect</a>, <a href="https://publications.waset.org/abstracts/search?q=self-interested%20behavior" title=" self-interested behavior"> self-interested behavior</a> </p> <a href="https://publications.waset.org/abstracts/97223/exploring-framing-effect-and-repetition-effect-of-the-persuasive-message-on-moral-decision-making-in-conflict-of-interests" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/97223.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">176</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">443</span> Generalization of Blom Key Predistribution Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Cheraghi">Abbas Cheraghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A key predistribution scheme provides one method to distribute secret ahead of time. Blom’s scheme is a symmetric threshold key exchange protocol in cryptography. The scheme was proposed by the Swedish cryptographer Rolf Blom. In this kind of scheme, trusted authority gives each user a secret key and a public identifier, which enables any two users to create independently a shared key for communicating between each other. However, if an attacker can compromise the keys of at least Known numbers of users, he can break the scheme and reconstruct every shared key. In this paper generalized Blom’s Scheme by multivariate Lagrange interpolation formula. This scheme is a form of threshold secret sharing scheme. In this new scheme, the amount of information transmitted by the trusted authority is independent of the numbers of users. In addition, this scheme is unconditionally secure against any individual user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=key%20predistribution" title="key predistribution">key predistribution</a>, <a href="https://publications.waset.org/abstracts/search?q=blom%E2%80%99s%20scheme" title=" blom’s scheme"> blom’s scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=unconditional%20secure" title=" unconditional secure"> unconditional secure</a> </p> <a href="https://publications.waset.org/abstracts/39358/generalization-of-blom-key-predistribution-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">442</span> Pattern in Splitting Sequence in Okike’s Merged Irregular Transposition Cipher for Encrypting Cyberspace Messages</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Okike%20Benjamin">Okike Benjamin</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20J.%20D.%20Garba"> E. J. D. Garba </a> </p> <p class="card-text"><strong>Abstract:</strong></p> The protection of sensitive information against unauthorized access or fraudulent changes has been of prime concern throughout the centuries. Modern communication techniques, using computers connected through networks, make all data even more vulnerable to these threats. The researchers in this work propose a new encryption technique to be known as Merged Irregular Transposition Cipher. In this proposed encryption technique, a message to be encrypted will first of all be split into multiple parts depending on the length of the message. After the split, different keywords are chosen to encrypt different parts of the message. After encrypting all parts of the message, the positions of the encrypted message could be swapped to other position thereby making it very difficult to decrypt by any unauthorized user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20security" title="information security">information security</a>, <a href="https://publications.waset.org/abstracts/search?q=message%20splitting" title=" message splitting"> message splitting</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern" title=" pattern"> pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=sequence" title=" sequence "> sequence </a> </p> <a href="https://publications.waset.org/abstracts/22633/pattern-in-splitting-sequence-in-okikes-merged-irregular-transposition-cipher-for-encrypting-cyberspace-messages" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22633.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">287</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">441</span> When Messages Cause Distraction from Advertising: An Eye-Tracking Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nilamadhab%20Mohanty">Nilamadhab Mohanty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is essential to use message formats that make communication understandable and correct. It is because; the information format can influence consumer decision on the purchase of a product. This study combines information from qualitative inquiry, media trend analysis, eye tracking experiment, and questionnaire data to examine the impact of specific message format and consumer perceived risk on attention to the information and risk retention. We investigated the influence of message framing (goal framing, attribute framing, and mix framing) on consumer memory, study time, and decisional uncertainty while deciding on the purchase of drugs. Furthermore, we explored the impact of consumer perceived risk (associated with the use of the drug, i.e., RISK-AB and perceived risk associated with the non-use of the drug, i.e., RISK-EB) on message format preference. The study used eye-tracking methods to understand the differences in message processing. Findings of the study suggest that the message format influences information processing, and participants' risk perception impacts message format preference. Eye tracking can be used to understand the format differences and design effective advertisements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=message%20framing" title="message framing">message framing</a>, <a href="https://publications.waset.org/abstracts/search?q=consumer%20perceived%20risk" title=" consumer perceived risk"> consumer perceived risk</a>, <a href="https://publications.waset.org/abstracts/search?q=advertising" title=" advertising"> advertising</a>, <a href="https://publications.waset.org/abstracts/search?q=eye%20tracking" title=" eye tracking"> eye tracking</a> </p> <a href="https://publications.waset.org/abstracts/109706/when-messages-cause-distraction-from-advertising-an-eye-tracking-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109706.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">122</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">440</span> Minimum Vertices Dominating Set Algorithm for Secret Sharing Scheme </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20G.%20Al-Saidi">N. M. G. Al-Saidi</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20A.%20Kadhim"> K. A. Kadhim</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20Rajab"> N. A. Rajab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the past decades, computer networks and data communication system has been developing fast, so, the necessity to protect a transmitted data is a challenging issue, and data security becomes a serious problem nowadays. A secret sharing scheme is a method which allows a master key to be distributed among a finite set of participants, in such a way that only certain authorized subsets of participants to reconstruct the original master key. To create a secret sharing scheme, many mathematical structures have been used; the most widely used structure is the one that is based on graph theory (graph access structure). Subsequently, many researchers tried to find efficient schemes based on graph access structures. In this paper, we propose a novel efficient construction of a perfect secret sharing scheme for uniform access structure. The dominating set of vertices in a regular graph is used for this construction in the following way; each vertex represents a participant and each minimum independent dominating subset represents a minimal qualified subset. Some relations between dominating set, graph order and regularity are achieved, and can be used to demonstrate the possibility of using dominating set to construct a secret sharing scheme. The information rate that is used as a measure for the efficiency of such systems is calculated to show that the proposed method has some improved values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title=" dominating set"> dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20rate" title=" information rate"> information rate</a>, <a href="https://publications.waset.org/abstracts/search?q=access%20structure" title=" access structure"> access structure</a>, <a href="https://publications.waset.org/abstracts/search?q=rank" title=" rank"> rank</a> </p> <a href="https://publications.waset.org/abstracts/32399/minimum-vertices-dominating-set-algorithm-for-secret-sharing-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32399.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">393</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">439</span> Development of a Data Security Model Using Steganography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Terungwa%20Simon%20Yange">Terungwa Simon Yange</a>, <a href="https://publications.waset.org/abstracts/search?q=Agana%20Moses%20A."> Agana Moses A.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper studied steganography and designed a simplistic approach to a steganographic tool for hiding information in image files with the view of addressing the security challenges with data by hiding data from unauthorized users to improve its security. The Structured Systems Analysis and Design Method (SSADM) was used in this work. The system was developed using Java Development Kit (JDK) 1.7.0_10 and MySQL Server as its backend. The system was tested with some hypothetical health records which proved the possibility of protecting data from unauthorized users by making it secret so that its existence cannot be easily recognized by fraudulent users. It further strengthens the confidentiality of patient records kept by medical practitioners in the health setting. In conclusion, this work was able to produce a user friendly steganography software that is very fast to install and easy to operate to ensure privacy and secrecy of sensitive data. It also produced an exact copy of the original image and the one carrying the secret message when compared with each. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=secrecy" title=" secrecy"> secrecy</a> </p> <a href="https://publications.waset.org/abstracts/36466/development-of-a-data-security-model-using-steganography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36466.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">265</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">438</span> A Hill Cipher Based on the Kish-Sethuraman Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kondwani%20Magamba">Kondwani Magamba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the idealized Kish-Sethuraman (KS) protocol,messages are sent between Alice and Bob each using a secret personal key. This protocol is said to be perfectly secure because both Bob and Alice keep their keys undisclosed so that at all times the message is encrypted by at least one key, thus no information is leaked or shared. In this paper, we propose a realization of the KS protocol through the use of the Hill Cipher. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kish-Sethuraman%20Protocol" title="Kish-Sethuraman Protocol">Kish-Sethuraman Protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Hill%20Cipher" title=" Hill Cipher"> Hill Cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=MDS%20Matrices" title=" MDS Matrices"> MDS Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/15505/a-hill-cipher-based-on-the-kish-sethuraman-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15505.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">356</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">437</span> Use of Personal Rhythm to Authenticate Encrypted Messages</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Carlos%20Gonzalez">Carlos Gonzalez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When communicating using private and secure keys, there is always the doubt as to the identity of the message creator. We introduce an algorithm that uses the personal typing rhythm (keystroke dynamics) of the message originator to increase the trust of the authenticity of the message originator by the message recipient. The methodology proposes the use of a Rhythm Certificate Authority (RCA) to validate rhythm information. An illustrative example of the communication between Bob and Alice and the RCA is included. An algorithm of how to communicate with the RCA is presented. This RCA can be an independent authority or an enhanced Certificate Authority like the one used in public key infrastructure (PKI). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=authentication" title="authentication">authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20signature" title=" digital signature"> digital signature</a>, <a href="https://publications.waset.org/abstracts/search?q=keystroke%20dynamics" title=" keystroke dynamics"> keystroke dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=personal%20rhythm" title=" personal rhythm"> personal rhythm</a>, <a href="https://publications.waset.org/abstracts/search?q=public-key%20encryption" title=" public-key encryption"> public-key encryption</a> </p> <a href="https://publications.waset.org/abstracts/66737/use-of-personal-rhythm-to-authenticate-encrypted-messages" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">304</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">436</span> Image Encryption Using Eureqa to Generate an Automated Mathematical Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halima%20Adel%20Halim%20Shnishah">Halima Adel Halim Shnishah</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Mulvaney"> David Mulvaney</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Applying traditional symmetric cryptography algorithms while computing encryption and decryption provides immunity to secret keys against different attacks. One of the popular techniques generating automated secret keys is evolutionary computing by using Eureqa API tool, which got attention in 2013. In this paper, we are generating automated secret keys for image encryption and decryption using Eureqa API (tool which is used in evolutionary computing technique). Eureqa API models pseudo-random input data obtained from a suitable source to generate secret keys. The validation of generated secret keys is investigated by performing various statistical tests (histogram, chi-square, correlation of two adjacent pixels, correlation between original and encrypted images, entropy and key sensitivity). Experimental results obtained from methods including histogram analysis, correlation coefficient, entropy and key sensitivity, show that the proposed image encryption algorithms are secure and reliable, with the potential to be adapted for secure image communication applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption%20algorithms" title="image encryption algorithms">image encryption algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Eureqa" title=" Eureqa"> Eureqa</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20measurements" title=" statistical measurements"> statistical measurements</a>, <a href="https://publications.waset.org/abstracts/search?q=automated%20key%20generation" title=" automated key generation"> automated key generation</a> </p> <a href="https://publications.waset.org/abstracts/79042/image-encryption-using-eureqa-to-generate-an-automated-mathematical-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79042.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">482</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">435</span> Evolutionary Methods in Cryptography </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%20Slaibi%20Alsharafat">Wafa Slaibi Alsharafat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithms (GA) are random algorithms as random numbers that are generated during the operation of the algorithm determine what happens. This means that if GA is applied twice to optimize exactly the same problem it might produces two different answers. In this project, we propose an evolutionary algorithm and Genetic Algorithm (GA) to be implemented in symmetric encryption and decryption. Here, user's message and user secret information (key) which represent plain text to be transferred into cipher text. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=GA" title="GA">GA</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a> </p> <a href="https://publications.waset.org/abstracts/21507/evolutionary-methods-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21507.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">445</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">434</span> Unsupervised Sentiment Analysis for Indonesian Political Message on Twitter </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Omar%20Abdillah">Omar Abdillah</a>, <a href="https://publications.waset.org/abstracts/search?q=Mirna%20Adriani"> Mirna Adriani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we perform new approach for analyzing public sentiment towards the presidential candidate in the 2014 Indonesian election that expressed in Twitter. In this study we propose such procedure for analyzing sentiment over Indonesian political message by understanding the behavior of Indonesian society in sending message on Twitter. We took different approach from previous works by utilizing punctuation mark and Indonesian sentiment lexicon that completed with the new procedure in determining sentiment towards the candidates. Our experiment shows the performance that yields up to 83.31% of average precision. In brief, this work makes two contributions: first, this work is the preliminary study of sentiment analysis in the domain of political message that has not been addressed yet before. Second, we propose such method to conduct sentiment analysis by creating decision making procedure in which it is in line with the characteristic of Indonesian message on Twitter. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unsupervised%20sentiment%20analysis" title="unsupervised sentiment analysis">unsupervised sentiment analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=political%20message" title=" political message"> political message</a>, <a href="https://publications.waset.org/abstracts/search?q=lexicon%20based" title=" lexicon based"> lexicon based</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20behavior%20understanding" title=" user behavior understanding"> user behavior understanding</a> </p> <a href="https://publications.waset.org/abstracts/20304/unsupervised-sentiment-analysis-for-indonesian-political-message-on-twitter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20304.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">480</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">433</span> Carrier Communication through Power Lines</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pavuluri%20Gopikrishna">Pavuluri Gopikrishna</a>, <a href="https://publications.waset.org/abstracts/search?q=B.%20Neelima"> B. Neelima</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Power line carrier communication means audio power transmission via power line and reception of the amplified audio power at the receiver as in the form of speaker output signal using power line as the channel medium. The main objective of this suggested work is to transmit our message signal after frequency modulation by the help of FM modulator IC LM565 which gives output proportional to the input voltage of the input message signal. And this audio power is received from the power line by the help of isolation circuit and demodulated from IC LM565 which uses the concept of the PLL and produces FM demodulated signal to the listener. Message signal will be transmitted over the carrier signal that will be generated from the FM modulator IC LM565. Using this message signal will not damage because of no direct contact of message signal from the power line, but noise can disturb our information. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=amplification" title="amplification">amplification</a>, <a href="https://publications.waset.org/abstracts/search?q=fm%20demodulator%20ic%20565" title=" fm demodulator ic 565"> fm demodulator ic 565</a>, <a href="https://publications.waset.org/abstracts/search?q=fm%20modulator%20ic%20565" title=" fm modulator ic 565"> fm modulator ic 565</a>, <a href="https://publications.waset.org/abstracts/search?q=phase%20locked%20loop" title=" phase locked loop"> phase locked loop</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20isolation" title=" power isolation"> power isolation</a> </p> <a href="https://publications.waset.org/abstracts/31017/carrier-communication-through-power-lines" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31017.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">552</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">432</span> A Generalization of the Secret Sharing Scheme Codes Over Certain Ring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20%C3%96zbek">Ibrahim Özbek</a>, <a href="https://publications.waset.org/abstracts/search?q=Erdo%C4%9Fan%20Mehmet%20%C3%96zkan"> Erdoğan Mehmet Özkan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we generalize (k,n) threshold secret sharing scheme on the study Ozbek and Siap to the codes over the ring Fq+ αFq. In this way, it is mentioned that the method obtained in that article can also be used on codes over rings, and new advantages to be obtained. The method of securely sharing the key in cryptography, which Shamir first systematized and Massey carried over to codes, became usable for all error-correcting codes. The firewall of this scheme is based on the hardness of the syndrome decoding problem. Also, an open study area is left for those working for other rings and code classes. All codes that correct errors with this method have been the working area of this method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20codes" title=" linear codes"> linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=algebra" title=" algebra"> algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20rings" title=" finite rings"> finite rings</a> </p> <a href="https://publications.waset.org/abstracts/164183/a-generalization-of-the-secret-sharing-scheme-codes-over-certain-ring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164183.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">74</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">431</span> Uses and Gratification with the Website Secret-thai.com</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siriporn%20Meenanan">Siriporn Meenanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this study is to study about the uses and gratification of the sample who use the website that named secret-thai.com which provides moral contents, inspires, and builds up the spirit. The study found that the samples mainly use this website to follow up on the dharma activities. They also use the space as the web board to discuss about dharma issues. Moreover, the contents help readers to relax and also provides the guidelines to deal with stress and uncomfortable situations properly. The samples found to be most satisfied. In other words, the samples found the contents of the website are complete, and can cover their needs. Moreover, they found that contents useful in their ways of living. In addition, they are satisfied with the beautiful and interesting design of the website and well classification of the contents that readers can easily find the information that they want. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uses%20and%20gratification" title="uses and gratification">uses and gratification</a>, <a href="https://publications.waset.org/abstracts/search?q=website" title=" website"> website</a>, <a href="https://publications.waset.org/abstracts/search?q=Secret-Thai.com" title=" Secret-Thai.com"> Secret-Thai.com</a>, <a href="https://publications.waset.org/abstracts/search?q=moral%20contents" title=" moral contents"> moral contents</a> </p> <a href="https://publications.waset.org/abstracts/56197/uses-and-gratification-with-the-website-secret-thaicom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56197.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">232</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">430</span> The Effect of ‘Love Accounting’ on Gift Budgeting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yanan%20Wang">Yanan Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is proposed that when people give a gift they engage in 'love accounting', so that they will spend less on it if they include a written expression of love with it. This hypothesis was tested with college students (N = 308). It was found that participants who wrote a love message to accompany a Mother's Day gift budgeted less for the gift itself than control participants (Experiment 1), and this effect was replicated for a Christmas gift (Experiment 2). The amount of effort expended by the giver on preparing the love message did not account for the effect (Experiment 3). It is concluded that a gift and its accompanying love message are mentally computed as belonging to the same love account, implying that consumers’ excessive splurging on gifts might be controlled by writing a love message before gift shopping. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=expression%20of%20love" title="expression of love">expression of love</a>, <a href="https://publications.waset.org/abstracts/search?q=gift-giving" title=" gift-giving"> gift-giving</a>, <a href="https://publications.waset.org/abstracts/search?q=gift-budgeting" title=" gift-budgeting"> gift-budgeting</a>, <a href="https://publications.waset.org/abstracts/search?q=mental%20accounting" title=" mental accounting"> mental accounting</a> </p> <a href="https://publications.waset.org/abstracts/40374/the-effect-of-love-accounting-on-gift-budgeting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40374.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">328</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">429</span> A New Method for Fault Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Hakan%20Karaata">Mehmet Hakan Karaata</a>, <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hamdan"> Ali Hamdan</a>, <a href="https://publications.waset.org/abstracts/search?q=Omer%20Yusuf%20Adam%20Mohamed"> Omer Yusuf Adam Mohamed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Consider a distributed system that delivers messages from a process to another. Such a system is often required to deliver each message to its destination regardless of whether or not the system components experience arbitrary forms of faults. In addition, each message received by the destination must be a message sent by a system process. In this paper, we first identify the necessary and sufficient conditions to detect some restricted form of Byzantine faults referred to as modifying Byzantine faults. An observable form of a Byzantine fault whose effect is limited to the modification of a message metadata or content, timing and omission faults, and message replay is referred to as a modifying Byzantine fault. We then present a distributed protocol to detect modifying Byzantine faults using optimal number of messages over node-disjoint paths. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Byzantine%20faults" title="Byzantine faults">Byzantine faults</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection" title=" fault detection"> fault detection</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20protocols" title=" network protocols"> network protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=node-disjoint%20paths" title=" node-disjoint paths"> node-disjoint paths</a> </p> <a href="https://publications.waset.org/abstracts/21437/a-new-method-for-fault-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21437.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">447</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=15">15</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=16">16</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20message&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>