CINXE.COM

Search results for: digital signature

<!DOCTYPE html> <html lang="en" dir="ltr"> <head> <!-- Google tag (gtag.js) --> <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> <!-- Yandex.Metrika counter --> <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> <!-- /Yandex.Metrika counter --> <!-- Matomo --> <!-- End Matomo Code --> <title>Search results for: digital signature</title> <meta name="description" content="Search results for: digital signature"> <meta name="keywords" content="digital signature"> <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="digital signature" 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="digital signature"> <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> 2999</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: digital signature</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2999</span> Application of Signature Verification Models for Document Recognition </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boris%20M.%20Fedorov">Boris M. Fedorov</a>, <a href="https://publications.waset.org/abstracts/search?q=Liudmila%20P.%20Goncharenko"> Liudmila P. Goncharenko</a>, <a href="https://publications.waset.org/abstracts/search?q=Sergey%20A.%20Sybachin"> Sergey A. Sybachin</a>, <a href="https://publications.waset.org/abstracts/search?q=Natalia%20A.%20Mamedova"> Natalia A. Mamedova</a>, <a href="https://publications.waset.org/abstracts/search?q=Ekaterina%20V.%20Makarenkova"> Ekaterina V. Makarenkova</a>, <a href="https://publications.waset.org/abstracts/search?q=Saule%20Rakhimova"> Saule Rakhimova</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In modern economic conditions, the question of the possibility of correct recognition of a signature on digital documents in order to verify the expression of will or confirm a certain operation is relevant. The additional complexity of processing lies in the dynamic variability of the signature for each individual, as well as in the way information is processed because the signature refers to biometric data. The article discusses the issues of using artificial intelligence models in order to improve the quality of signature confirmation in document recognition. The analysis of several possible options for using the model is carried out. The results of the study are given, in which it is possible to correctly determine the authenticity of the signature on small samples. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signature%20recognition" title="signature recognition">signature recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=biometric%20data" title=" biometric data"> biometric data</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a> </p> <a href="https://publications.waset.org/abstracts/131387/application-of-signature-verification-models-for-document-recognition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131387.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">148</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">2998</span> A Secure Digital Signature Scheme with Fault Tolerance Based on the Improved RSA System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fault tolerance and data security are two important issues in modern communication systems. In this paper, we propose a secure and efficient digital signature scheme with fault tolerance based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains three prime numbers and overcome several attacks possible on RSA. By using the Chinese Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption side and it provides high security also. <p class="card-text"><strong>Keywords:</strong> <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=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a> </p> <a href="https://publications.waset.org/abstracts/51269/a-secure-digital-signature-scheme-with-fault-tolerance-based-on-the-improved-rsa-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51269.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">476</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">2997</span> Alternative Key Exchange Algorithm Based on Elliptic Curve Digital Signature Algorithm Certificate and Usage in Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Andreasyan">A. Andreasyan</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Connors"> C. Connors</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Elliptic Curve Digital Signature algorithm-based X509v3 certificates are becoming more popular due to their short public and private key sizes. Moreover, these certificates can be stored in Internet of Things (IoT) devices, with limited resources, using less memory and transmitted in network security protocols, such as Internet Key Exchange (IKE), Transport Layer Security (TLS) and Secure Shell (SSH) with less bandwidth. The proposed method gives another advantage, in that it increases the performance of the above-mentioned protocols in terms of key exchange by saving one scalar multiplication operation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20digital%20signature%20algorithm" title=" elliptic curve digital signature algorithm"> elliptic curve digital signature algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20exchange" title=" key exchange"> key exchange</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security%20protocol" title=" network security protocol"> network security protocol</a> </p> <a href="https://publications.waset.org/abstracts/120384/alternative-key-exchange-algorithm-based-on-elliptic-curve-digital-signature-algorithm-certificate-and-usage-in-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/120384.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">146</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">2996</span> Secure Proxy Signature Based on Factoring and Discrete Logarithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A digital signature is an electronic signature form used by an original signer to sign a specific document. When the original signer is not in his office or when he/she travels outside, he/she delegates his signing capability to a proxy signer and then the proxy signer generates a signing message on behalf of the original signer. The two parties must be able to authenticate one another and agree on a secret encryption key, in order to communicate securely over an unreliable public network. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties. In this paper, we present a secure proxy signature scheme over an efficient and secure authenticated key agreement protocol based on factoring and discrete logarithm problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete%20logarithm" title="discrete logarithm">discrete logarithm</a>, <a href="https://publications.waset.org/abstracts/search?q=factoring" title=" factoring"> factoring</a>, <a href="https://publications.waset.org/abstracts/search?q=proxy%20signature" title=" proxy signature"> proxy signature</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20agreement" title=" key agreement"> key agreement</a> </p> <a href="https://publications.waset.org/abstracts/51597/secure-proxy-signature-based-on-factoring-and-discrete-logarithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51597.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">308</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">2995</span> Abnormal Features of Two Quasiparticle Rotational Bands in Rare Earths</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kawalpreet%20Kalra">Kawalpreet Kalra</a>, <a href="https://publications.waset.org/abstracts/search?q=Alpana%20Goel"> Alpana Goel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The behaviour of the rotational bands should be smooth but due to large amount of inertia and decreased pairing it is not so. Many experiments have been done in the last few decades, and a large amount of data is available for comprehensive study in this region. Peculiar features like signature dependence, signature inversion, and signature reversal are observed in many two quasiparticle rotational bands of doubly odd and doubly even nuclei. At high rotational frequencies, signature and parity are the only two good quantum numbers available to label a state. Signature quantum number is denoted by α. Even-angular momentum states of a rotational band have α =0, and the odd-angular momentum states have α =1. It has been observed that the odd-spin members lie lower in energy up to a certain spin Ic; the normal signature dependence is restored afterwards. This anomalous feature is termed as signature inversion. The systematic of signature inversion in high-j orbitals for doubly odd rare earth nuclei have been done. Many unusual features like signature dependence, signature inversion and signature reversal are observed in rotational bands of even-even/odd-odd nuclei. Attempts have been made to understand these phenomena using several models. These features have been analyzed within the framework of the Two Quasiparticle Plus Rotor Model (TQPRM). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rotational%20bands" title="rotational bands">rotational bands</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20dependence" title=" signature dependence"> signature dependence</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20quantum%20number" title=" signature quantum number"> signature quantum number</a>, <a href="https://publications.waset.org/abstracts/search?q=two%20quasiparticle" title=" two quasiparticle"> two quasiparticle</a> </p> <a href="https://publications.waset.org/abstracts/84944/abnormal-features-of-two-quasiparticle-rotational-bands-in-rare-earths" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84944.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">168</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">2994</span> Offline Signature Verification in Punjabi Based On SURF Features and Critical Point Matching Using HMM</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajpal%20Kaur">Rajpal Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=Pooja%20Choudhary"> Pooja Choudhary</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Biometrics, which refers to identifying an individual based on his or her physiological or behavioral characteristics, has the capabilities to the reliably distinguish between an authorized person and an imposter. The Signature recognition systems can categorized as offline (static) and online (dynamic). This paper presents Surf Feature based recognition of offline signatures system that is trained with low-resolution scanned signature images. The signature of a person is an important biometric attribute of a human being which can be used to authenticate human identity. However the signatures of human can be handled as an image and recognized using computer vision and HMM techniques. With modern computers, there is need to develop fast algorithms for signature recognition. There are multiple techniques are defined to signature recognition with a lot of scope of research. In this paper, (static signature) off-line signature recognition & verification using surf feature with HMM is proposed, where the signature is captured and presented to the user in an image format. Signatures are verified depended on parameters extracted from the signature using various image processing techniques. The Off-line Signature Verification and Recognition is implemented using Mat lab platform. This work has been analyzed or tested and found suitable for its purpose or result. The proposed method performs better than the other recently proposed methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=offline%20signature%20verification" title="offline signature verification">offline signature verification</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20signature%20recognition" title=" offline signature recognition"> offline signature recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=signatures" title=" signatures"> signatures</a>, <a href="https://publications.waset.org/abstracts/search?q=SURF%20features" title=" SURF features"> SURF features</a>, <a href="https://publications.waset.org/abstracts/search?q=HMM" title=" HMM "> HMM </a> </p> <a href="https://publications.waset.org/abstracts/20259/offline-signature-verification-in-punjabi-based-on-surf-features-and-critical-point-matching-using-hmm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20259.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">384</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">2993</span> Rounding Technique&#039;s Application in Schnorr Signature Algorithm: Known Partially Most Significant Bits of Nonce</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenjie%20Qin">Wenjie Qin</a>, <a href="https://publications.waset.org/abstracts/search?q=Kewei%20Lv"> Kewei Lv</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 1996, Boneh and Venkatesan proposed the Hidden Number Problem (HNP) and proved the most significant bits (MSB) of computational Diffie-Hellman key exchange scheme and related schemes are unpredictable bits. They also gave a method which is a lattice rounding technique to solve HNP in non-uniform model. In this paper, we put forward a new concept that is Schnorr-MSB-HNP. We also reduce the problem of solving Schnorr signature private key with a few consecutive most significant bits of random nonce (used at each signature generation) to Schnorr-MSB-HNP, then we use the rounding technique to solve the Schnorr-MSB-HNP. We have come to the conclusion that if there is a ‘miraculous box’ which inputs the random nonce and outputs 2loglogq (q is a prime number) most significant bits of nonce, the signature private key will be obtained by choosing 2logq signature messages randomly. Thus we get an attack on the Schnorr signature private key. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=rounding%20technique" title="rounding technique">rounding technique</a>, <a href="https://publications.waset.org/abstracts/search?q=most%20significant%20bits" title=" most significant bits"> most significant bits</a>, <a href="https://publications.waset.org/abstracts/search?q=Schnorr%20signature%20algorithm" title=" Schnorr signature algorithm"> Schnorr signature algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=nonce" title=" nonce"> nonce</a>, <a href="https://publications.waset.org/abstracts/search?q=Schnorr-MSB-HNP" title=" Schnorr-MSB-HNP"> Schnorr-MSB-HNP</a> </p> <a href="https://publications.waset.org/abstracts/67137/rounding-techniques-application-in-schnorr-signature-algorithm-known-partially-most-significant-bits-of-nonce" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67137.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">233</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">2992</span> Online Authenticity Verification of a Biometric Signature Using Dynamic Time Warping Method and Neural Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ga%C5%82ka%20Aleksandra">Gałka Aleksandra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jeli%C5%84ska%20Justyna"> Jelińska Justyna</a>, <a href="https://publications.waset.org/abstracts/search?q=Masiak%20Albert"> Masiak Albert</a>, <a href="https://publications.waset.org/abstracts/search?q=Walentukiewicz%20Krzysztof"> Walentukiewicz Krzysztof</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An offline signature is well-known however not the safest way to verify identity. Nowadays, to ensure proper authentication, i.e. in banking systems, multimodal verification is more widely used. In this paper the online signature analysis based on dynamic time warping (DTW) coupled with machine learning approaches has been presented. In our research signatures made with biometric pens were gathered. Signature features as well as their forgeries have been described. For verification of authenticity various methods were used including convolutional neural networks using DTW matrix and multilayer perceptron using sums of DTW matrix paths. System efficiency has been evaluated on signatures and signature forgeries collected on the same day. Results are presented and discussed in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dynamic%20time%20warping" title="dynamic time warping">dynamic time warping</a>, <a href="https://publications.waset.org/abstracts/search?q=handwritten%20signature%20verification" title=" handwritten signature verification"> handwritten signature verification</a>, <a href="https://publications.waset.org/abstracts/search?q=feature-based%20recognition" title=" feature-based recognition"> feature-based recognition</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20signature" title=" online signature"> online signature</a> </p> <a href="https://publications.waset.org/abstracts/153364/online-authenticity-verification-of-a-biometric-signature-using-dynamic-time-warping-method-and-neural-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/153364.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">175</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">2991</span> An Architecture Based on Capsule Networks for the Identification of Handwritten Signature Forgery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luisa%20Mesquita%20Oliveira%20Ribeiro">Luisa Mesquita Oliveira Ribeiro</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexei%20Manso%20Correa%20Machado"> Alexei Manso Correa Machado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Handwritten signature is a unique form for recognizing an individual, used to discern documents, carry out investigations in the criminal, legal, banking areas and other applications. Signature verification is based on large amounts of biometric data, as they are simple and easy to acquire, among other characteristics. Given this scenario, signature forgery is a worldwide recurring problem and fast and precise techniques are needed to prevent crimes of this nature from occurring. This article carried out a study on the efficiency of the Capsule Network in analyzing and recognizing signatures. The chosen architecture achieved an accuracy of 98.11% and 80.15% for the CEDAR and GPDS databases, respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometrics" title="biometrics">biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=deep%20learning" title=" deep learning"> deep learning</a>, <a href="https://publications.waset.org/abstracts/search?q=handwriting" title=" handwriting"> handwriting</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20forgery" title=" signature forgery"> signature forgery</a> </p> <a href="https://publications.waset.org/abstracts/172892/an-architecture-based-on-capsule-networks-for-the-identification-of-handwritten-signature-forgery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/172892.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">83</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">2990</span> Offline Signature Verification Using Minutiae and Curvature Orientation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Nagaty">Khaled Nagaty</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Nagaty"> Heba Nagaty</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerard%20McKee"> Gerard McKee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A signature is a behavioral biometric that is used for authenticating users in most financial and legal transactions. Signatures can be easily forged by skilled forgers. Therefore, it is essential to verify whether a signature is genuine or forged. The aim of any signature verification algorithm is to accommodate the differences between signatures of the same person and increase the ability to discriminate between signatures of different persons. This work presented in this paper proposes an automatic signature verification system to indicate whether a signature is genuine or not. The system comprises four phases: (1) The pre-processing phase in which image scaling, binarization, image rotation, dilation, thinning, and connecting ridge breaks are applied. (2) The feature extraction phase in which global and local features are extracted. The local features are minutiae points, curvature orientation, and curve plateau. The global features are signature area, signature aspect ratio, and Hu moments. (3) The post-processing phase, in which false minutiae are removed. (4) The classification phase in which features are enhanced before feeding it into the classifier. k-nearest neighbors and support vector machines are used. The classifier was trained on a benchmark dataset to compare the performance of the proposed offline signature verification system against the state-of-the-art. The accuracy of the proposed system is 92.3%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signature" title="signature">signature</a>, <a href="https://publications.waset.org/abstracts/search?q=ridge%20breaks" title=" ridge breaks"> ridge breaks</a>, <a href="https://publications.waset.org/abstracts/search?q=minutiae" title=" minutiae"> minutiae</a>, <a href="https://publications.waset.org/abstracts/search?q=orientation" title=" orientation"> orientation</a> </p> <a href="https://publications.waset.org/abstracts/132885/offline-signature-verification-using-minutiae-and-curvature-orientation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/132885.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">146</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">2989</span> Arithmetic Operations Based on Double Base Number Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Sanjayani">K. Sanjayani</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Saraswathy"> C. Saraswathy</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sreenivasan"> S. Sreenivasan</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Sudhahar"> S. Sudhahar</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Suganya"> D. Suganya</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20S.%20Neelukumari"> K. S. Neelukumari</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Double Base Number System (DBNS) is an imminent system of representing a number using two bases namely 2 and 3, which has its application in Elliptic Curve Cryptography (ECC) and Digital Signature Algorithm (DSA).The previous binary method representation included only base 2. DBNS uses an approximation algorithm namely, Greedy Algorithm. By using this algorithm, the number of digits required to represent a larger number is less when compared to the standard binary method that uses base 2 algorithms. Hence, the computational speed is increased and time being reduced. The standard binary method uses binary digits 0 and 1 to represent a number whereas the DBNS method uses binary digit 1 alone to represent any number (canonical form). The greedy algorithm uses two ways to represent the number, one is by using only the positive summands and the other is by using both positive and negative summands. In this paper, arithmetic operations are used for elliptic curve cryptography. Elliptic curve discrete logarithm problem is the foundation for most of the day to day elliptic curve cryptography. This appears to be a momentous hard slog compared to digital logarithm problem. In elliptic curve digital signature algorithm, the key generation requires 160 bit of data by usage of standard binary representation. Whereas, the number of bits required generating the key can be reduced with the help of double base number representation. In this paper, a new technique is proposed to generate key during encryption and extraction of key in decryption. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20base%20number%20system" title=" double base number system"> double base number system</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20digital%20signature%20algorithm" title=" elliptic curve digital signature algorithm"> elliptic curve digital signature algorithm</a> </p> <a href="https://publications.waset.org/abstracts/1760/arithmetic-operations-based-on-double-base-number-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1760.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">396</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">2988</span> Two Quasiparticle Rotor Model for Deformed Nuclei</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alpana%20Goel">Alpana Goel</a>, <a href="https://publications.waset.org/abstracts/search?q=Kawalpreet%20Kalra"> Kawalpreet Kalra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of level structures of deformed nuclei is the most complex topic in nuclear physics. For the description of level structure, a simple model is good enough to bring out the basic features which may then be further refined. The low lying level structures of these nuclei can, therefore, be understood in terms of Two Quasiparticle plus axially symmetric Rotor Model (TQPRM). The formulation of TQPRM for deformed nuclei has been presented. The analysis of available experimental data on two quasiparticle rotational bands of deformed nuclei present unusual features like signature dependence, odd-even staggering, signature inversion and signature reversal in two quasiparticle rotational bands of deformed nuclei. These signature effects are well discussed within the framework of TQPRM. The model is well efficient in reproducing the large odd-even staggering and anomalous features observed in even-even and odd-odd deformed nuclei. The effect of particle-particle and the Coriolis coupling is well established from the model. Detailed description of the model with implications to deformed nuclei is presented in the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deformed%20nuclei" title="deformed nuclei">deformed nuclei</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20effects" title=" signature effects"> signature effects</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20inversion" title=" signature inversion"> signature inversion</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20reversal" title=" signature reversal"> signature reversal</a> </p> <a href="https://publications.waset.org/abstracts/84934/two-quasiparticle-rotor-model-for-deformed-nuclei" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/84934.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">158</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">2987</span> Signature Verification System for a Banking Business Process Management</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Rahaf">A. Rahaf</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Liyakathunsia"> S. Liyakathunsia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In today’s world, unprecedented operational pressure is faced by banks that test the efficiency, effectiveness, and agility of their business processes. In a typical banking process, a person’s authorization is usually based on his signature on most all of the transactions. Signature verification is considered as one of the highly significant information needed for any bank document processing. Banks usually use Signature Verification to authenticate the identity of individuals. In this paper, a business process model has been proposed in order to increase the quality of the verification process and to reduce time and needed resources. In order to understand the current process, a survey has been conducted and distributed among bank employees. After analyzing the survey, a process model has been created using Bizagi modeler which helps in simulating the process after assigning time and cost of it. The outcomes show that the automation of signature verification process is highly recommended for a banking business process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=business%20process%20management" title="business process management">business process management</a>, <a href="https://publications.waset.org/abstracts/search?q=process%20modeling" title=" process modeling"> process modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=quality" title=" quality"> quality</a>, <a href="https://publications.waset.org/abstracts/search?q=Signature%20Verification" title=" Signature Verification"> Signature Verification</a> </p> <a href="https://publications.waset.org/abstracts/67664/signature-verification-system-for-a-banking-business-process-management" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67664.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">427</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">2986</span> Triangular Geometric Feature for Offline Signature Verification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zuraidasahana%20Zulkarnain">Zuraidasahana Zulkarnain</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Shafry%20Mohd%20Rahim"> Mohd Shafry Mohd Rahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Nor%20Anita%20Fairos%20Ismail"> Nor Anita Fairos Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Azhar%20M.%20Arsad"> Mohd Azhar M. Arsad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Handwritten signature is accepted widely as a biometric characteristic for personal authentication. The use of appropriate features plays an important role in determining accuracy of signature verification; therefore, this paper presents a feature based on the geometrical concept. To achieve the aim, triangle attributes are exploited to design a new feature since the triangle possesses orientation, angle and transformation that would improve accuracy. The proposed feature uses triangulation geometric set comprising of sides, angles and perimeter of a triangle which is derived from the center of gravity of a signature image. For classification purpose, Euclidean classifier along with Voting-based classifier is used to verify the tendency of forgery signature. This classification process is experimented using triangular geometric feature and selected global features. Based on an experiment that was validated using Grupo de Senales 960 (GPDS-960) signature database, the proposed triangular geometric feature achieves a lower Average Error Rates (AER) value with a percentage of 34% as compared to 43% of the selected global feature. As a conclusion, the proposed triangular geometric feature proves to be a more reliable feature for accurate signature verification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biometrics" title="biometrics">biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=euclidean%20classifier" title=" euclidean classifier"> euclidean classifier</a>, <a href="https://publications.waset.org/abstracts/search?q=features%20extraction" title=" features extraction"> features extraction</a>, <a href="https://publications.waset.org/abstracts/search?q=offline%20signature%20verification" title=" offline signature verification"> offline signature verification</a>, <a href="https://publications.waset.org/abstracts/search?q=voting-based%20classifier" title=" voting-based classifier"> voting-based classifier</a> </p> <a href="https://publications.waset.org/abstracts/45300/triangular-geometric-feature-for-offline-signature-verification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45300.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">378</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">2985</span> Separating Permanent and Induced Magnetic Signature: A Simple Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O.%20J.%20G.%20Somsen">O. J. G. Somsen</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20P.%20M.%20Wagemakers"> G. P. M. Wagemakers</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Magnetic signature detection provides sensitive detection of metal objects, especially in the natural environment. Our group is developing a tabletop setup for magnetic signatures of various small and model objects. A particular issue is the separation of permanent and induced magnetization. While the latter depends only on the composition and shape of the object, the former also depends on the magnetization history. With common deperming techniques, a significant permanent signature may still remain, which confuses measurements of the induced component. We investigate a basic technique of separating the two. Measurements were done by moving the object along an aluminum rail while the three field components are recorded by a detector attached near the center. This is done first with the rail parallel to the Earth magnetic field and then with anti-parallel orientation. The reversal changes the sign of the induced- but not the permanent magnetization so that the two can be separated. Our preliminary results on a small iron block show excellent reproducibility. A considerable permanent magnetization was indeed present, resulting in a complex asymmetric signature. After separation, a much more symmetric induced signature was obtained that can be studied in detail and compared with theoretical calculations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=magnetic%20signature" title="magnetic signature">magnetic signature</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20analysis" title=" data analysis"> data analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetization" title=" magnetization"> magnetization</a>, <a href="https://publications.waset.org/abstracts/search?q=deperming%20techniques" title=" deperming techniques"> deperming techniques</a> </p> <a href="https://publications.waset.org/abstracts/34318/separating-permanent-and-induced-magnetic-signature-a-simple-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34318.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">451</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">2984</span> The Forensic Handwriting Analysis of a Painter’s Signature: Claude Monet’s Case</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Olivia%20Rybak-Karkosz">Olivia Rybak-Karkosz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper's purpose was to present a case study on a questioned Claude Monet's signature forensic handwriting analysis. It is an example taken from the author’s experience as a court handwriting expert. A comparative study was conducted to determine whether the signature resembles similarities (and if so, to what measure) with the features representing the writing patterns and their natural variability typical for Claude Monet. It was conducted to check whether all writing features are within the writer's normal range of variation. The paper emphasizes the difficulties and challenges encountered by the forensic handwriting expert while analysing the questioned signature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artist%E2%80%99s%20signatures" title="artist’s signatures">artist’s signatures</a>, <a href="https://publications.waset.org/abstracts/search?q=authenticity%20of%20an%20artwork" title=" authenticity of an artwork"> authenticity of an artwork</a>, <a href="https://publications.waset.org/abstracts/search?q=forensic%20handwriting%20analysis" title=" forensic handwriting analysis"> forensic handwriting analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=graphic-comparative%20method" title=" graphic-comparative method"> graphic-comparative method</a> </p> <a href="https://publications.waset.org/abstracts/152843/the-forensic-handwriting-analysis-of-a-painters-signature-claude-monets-case" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152843.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">114</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">2983</span> Examination of Forged Signatures Printed by Means of Fabrication in Terms of Their Relation to the Perpetrator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Salim%20Yaren">Salim Yaren</a>, <a href="https://publications.waset.org/abstracts/search?q=Nergis%20Canturk"> Nergis Canturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Signatures are signs that are handwritten by person in order to confirm values such as information, amount, meaning, time and undertaking that bear on a document. It is understood that the signature of a document and the accuracy of the information on the signature is accepted and approved. Forged signatures are formed by forger without knowing and seeing original signature of person that forger will imitate and as a result of his/her effort for hiding typical characteristics of his/her own signatures. Forged signatures are often signed by starting with the initials of the first and last name or persons of the persons whose fake signature will be signed. The similarities in the signatures are completely random. Within the scope of the study, forged signatures are collected from 100 people both their original signatures and forged signatures signed referring to 5 imaginary people. These signatures are compared for 14 signature analyzing criteria by 2 signature analyzing experts except the researcher. 1 numbered analyzing expert who is 9 year experience in his/her field evaluated signatures of 39 (39%) people right and of 25 (25%) people wrong and he /she made any evaluations for signatures of 36 (36%) people. 2 numbered analyzing expert who is 16 year experienced in his/her field evaluated signatures of 49 (49%) people right and 28 (28%) people wrong and he /she made any evaluations for signatures of 23 (23%) people. Forged signatures that are signed by 24 (24%) people are matched by two analyzing experts properly, forged signatures that are signed by 8 (8%) people are matched wrongfully and made up signatures that are signed by 12 (12%) people couldn't be decided by both analyzing experts. Signatures analyzing is a subjective topic so that analyzing and comparisons take form according to education, knowledge and experience of the expert. Consequently, due to the fact that 39% success is achieved by analyzing expert who has 9 year professional experience and 49% success is achieved by analyzing expert who has 16 year professional experience, it is seen that success rate is directly proportionate to knowledge and experience of the expert. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=forensic%20signature" title="forensic signature">forensic signature</a>, <a href="https://publications.waset.org/abstracts/search?q=forensic%20signature%20analysis" title=" forensic signature analysis"> forensic signature analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20analysis%20criteria" title=" signature analysis criteria"> signature analysis criteria</a>, <a href="https://publications.waset.org/abstracts/search?q=forged%20signature" title=" forged signature"> forged signature</a> </p> <a href="https://publications.waset.org/abstracts/104765/examination-of-forged-signatures-printed-by-means-of-fabrication-in-terms-of-their-relation-to-the-perpetrator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104765.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">124</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">2982</span> An Efficient Proxy Signature Scheme Over a Secure Communications Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Proxy signature scheme permits an original signer to delegate his/her signing capability to a proxy signer, and then the proxy signer generates a signing message on behalf of the original signer. The two parties must be able to authenticate one another and agree on a secret encryption key, in order to communicate securely over an unreliable public network. Authenticated key agreement protocols have an important role in building secure communications network between the two parties. In this paper, we present a secure proxy signature scheme over an efficient and secure authenticated key agreement protocol based on the discrete logarithm problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=proxy%20signature" title="proxy signature">proxy signature</a>, <a href="https://publications.waset.org/abstracts/search?q=warrant%20partial%20delegation" title=" warrant partial delegation"> warrant partial delegation</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20agreement" title=" key agreement"> key agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete%20logarithm" title=" discrete logarithm"> discrete logarithm</a> </p> <a href="https://publications.waset.org/abstracts/51599/an-efficient-proxy-signature-scheme-over-a-secure-communications-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51599.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">345</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">2981</span> TRNG Based Key Generation for Certificateless Signcryption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.Balaji">S.Balaji</a>, <a href="https://publications.waset.org/abstracts/search?q=R.Sujatha"> R.Sujatha</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Ramakrishnan"> M. Ramakrishnan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously in low cost when compared with the traditional signature-then-encryption approach. In this paper, we propose a novel mouse movement based key generation technique to generate secret keys which is secure against the outer and insider attacks. Tag Key Encapsulation Mechanism (KEM) process is implemented using True Random Number Generator (TRNG) method. This TRNG based key is used for data encryption in the Data Encapsulation Mechanism (DEM). We compare the statistical reports of the proposed system with the previous methods which implements TKEM based on pseudo random number generator <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo%20random%20umber%20generator" title="pseudo random umber generator">pseudo random umber generator</a>, <a href="https://publications.waset.org/abstracts/search?q=signcryption" title=" signcryption"> signcryption</a>, <a href="https://publications.waset.org/abstracts/search?q=true%20random%20number%20generator" title=" true random number generator"> true random number generator</a>, <a href="https://publications.waset.org/abstracts/search?q=node%20deployment" title=" node deployment"> node deployment</a> </p> <a href="https://publications.waset.org/abstracts/15844/trng-based-key-generation-for-certificateless-signcryption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15844.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">341</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">2980</span> System of Quality Automation for Documents (SQAD)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Babi%20Saraswathi">R. Babi Saraswathi</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Divya"> K. Divya</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Habeebur%20Rahman"> A. Habeebur Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20B.%20Hari%20Prakash"> D. B. Hari Prakash</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Jayanth"> S. Jayanth</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Kumar"> T. Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijayarangan"> N. Vijayarangan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Document automation is the design of systems and workflows, assembling repetitive documents to meet the specific business needs. In any organization or institution, documenting employee’s information is very important for both employees as well as management. It shows an individual’s progress to the management. Many documents of the employee are in the form of papers, so it is very difficult to arrange and for future reference we need to spend more time in getting the exact document. Also, it is very tedious to generate reports according to our needs. The process gets even more difficult on getting approvals and hence lacks its security aspects. This project overcomes the above-stated issues. By storing the details in the database and maintaining the e-documents, the automation system reduces the manual work to a large extent. Then the approval process of some important documents can be done in a much-secured manner by using Digital Signature and encryption techniques. Details are maintained in the database and e-documents are stored in specific folders and generation of various kinds of reports is possible. Moreover, an efficient search method is implemented is used in the database. Automation supporting document maintenance in many aspects is useful for minimize data entry, reduce the time spent on proof-reading, avoids duplication, and reduce the risks associated with the manual error, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-documents" title="e-documents">e-documents</a>, <a href="https://publications.waset.org/abstracts/search?q=automation" title=" automation"> automation</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=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/1713/system-of-quality-automation-for-documents-sqad" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1713.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">391</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">2979</span> Digital Preservation: A Need of Tomorrow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gaurav%20Kumar">Gaurav Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital libraries have been established all over the world to create, maintain and to preserve the digital materials. This paper exhibits the importance and objectives of digital preservation. The necessities of preservation are hardware and software technology to interpret the digital documents and discuss various aspects of digital preservation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=preservation" title="preservation">preservation</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20preservation" title=" digital preservation"> digital preservation</a>, <a href="https://publications.waset.org/abstracts/search?q=conservation" title=" conservation"> conservation</a>, <a href="https://publications.waset.org/abstracts/search?q=archive" title=" archive"> archive</a>, <a href="https://publications.waset.org/abstracts/search?q=repository" title=" repository"> repository</a>, <a href="https://publications.waset.org/abstracts/search?q=document" title=" document"> document</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20technology" title=" information technology"> information technology</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware" title=" hardware"> hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=organization" title=" organization"> organization</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20readable%20format" title=" machine readable format"> machine readable format</a> </p> <a href="https://publications.waset.org/abstracts/23433/digital-preservation-a-need-of-tomorrow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23433.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">588</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">2978</span> A New Approach to Predicting Physical Biometrics from Behavioural Biometrics</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raid%20R.%20O.%20Al-Nima">Raid R. O. Al-Nima</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20S.%20Dlay"> S. S. Dlay</a>, <a href="https://publications.waset.org/abstracts/search?q=W.%20L.%20Woo"> W. L. Woo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A relationship between face and signature biometrics is established in this paper. A new approach is developed to predict faces from signatures by using artificial intelligence. A multilayer perceptron (MLP) neural network is used to generate face details from features extracted from signatures, here face is the physical biometric and signatures is the behavioural biometric. The new method establishes a relationship between the two biometrics and regenerates a visible face image from the signature features. Furthermore, the performance efficiencies of our new technique are demonstrated in terms of minimum error rates compared to published work. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=behavioural%20biometric" title="behavioural biometric">behavioural biometric</a>, <a href="https://publications.waset.org/abstracts/search?q=face%20biometric" title=" face biometric"> face biometric</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title=" neural network"> neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20biometric" title=" physical biometric"> physical biometric</a>, <a href="https://publications.waset.org/abstracts/search?q=signature%20biometric" title=" signature biometric"> signature biometric</a> </p> <a href="https://publications.waset.org/abstracts/15556/a-new-approach-to-predicting-physical-biometrics-from-behavioural-biometrics" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15556.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">474</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">2977</span> Study of the S-Bend Intake Hammershock Based on Improved Delayed Detached Eddy Simulation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qun-Feng%20Zhang">Qun-Feng Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Pan-Pan%20Yan"> Pan-Pan Yan</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Li"> Jun Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun-Qing%20Lei"> Jun-Qing Lei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Numerical investigation of hammershock propagation in the S-bend intake caused by engine surge has been conducted by using Improved Delayed Detach-Eddy Simulation (IDDES). The effects of surge signatures on hammershock characteristics are obtained. It was shown that once the hammershock is produced, it moves upward to the intake entrance quickly with constant speed, however, the strength of hammershock keeps increasing. Meanwhile, being influenced by the centrifugal force, the hammershock strength on the larger radius side is much larger. Hammershock propagation speed and strength are sensitive to the ramp upgradient of surge signature. A larger ramp up gradient results in higher propagation speed and greater strength. Nevertheless, ramp down profile of surge signature have no obvious effect on the propagation speed and strength of hammershock. Increasing the maximum value of surge signature leads to enhance in the intensity of hammershock, they approximately match quadratic function distribution law. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hammershock" title="hammershock">hammershock</a>, <a href="https://publications.waset.org/abstracts/search?q=IDDES" title=" IDDES"> IDDES</a>, <a href="https://publications.waset.org/abstracts/search?q=S-bend" title=" S-bend"> S-bend</a>, <a href="https://publications.waset.org/abstracts/search?q=surge%20signature" title=" surge signature"> surge signature</a> </p> <a href="https://publications.waset.org/abstracts/67566/study-of-the-s-bend-intake-hammershock-based-on-improved-delayed-detached-eddy-simulation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67566.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">299</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">2976</span> A General Framework to Successfully Operate the Digital Transformation Process in the Post-COVID Era</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Driss%20Kettani">Driss Kettani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we shed light on “Digital Divide 2.0,” which we see as COVID-19’s Version of the Digital Divide! We believe that “Fighting” against Digital Divide 2.0 necessitates for a Country to be seriously advanced in the Global Digital Transformation that is, naturally, a complex, delicate, costly and long-term Process. We build an argument supporting our assumption and, from there, we present the foundations of a computational framework to guide and streamline Digital Transformation at all levels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20divide%202.0" title="digital divide 2.0">digital divide 2.0</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20transformation" title=" digital transformation"> digital transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=ICTs%20for%20development" title=" ICTs for development"> ICTs for development</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20outcomes%20assessment" title=" computational outcomes assessment"> computational outcomes assessment</a> </p> <a href="https://publications.waset.org/abstracts/143734/a-general-framework-to-successfully-operate-the-digital-transformation-process-in-the-post-covid-era" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143734.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">177</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">2975</span> Improving Digital Data Security Awareness among Teacher Candidates with Digital Storytelling Technique</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Veysel%20%C3%87elik">Veysel Çelik</a>, <a href="https://publications.waset.org/abstracts/search?q=Aynur%20Aker"> Aynur Aker</a>, <a href="https://publications.waset.org/abstracts/search?q=Ebru%20G%C3%BC%C3%A7"> Ebru Güç</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Developments in information and communication technologies have increased both the speed of producing information and the speed of accessing new information. Accordingly, the daily lives of individuals have started to change. New concepts such as e-mail, e-government, e-school, e-signature have emerged. For this reason, prospective teachers who will be future teachers or school administrators are expected to have a high awareness of digital data security. The aim of this study is to reveal the effect of the digital storytelling technique on the data security awareness of pre-service teachers of computer and instructional technology education departments. For this purpose, participants were selected based on the principle of volunteering among third-grade students studying at the Computer and Instructional Technologies Department of the Faculty of Education at Siirt University. In the research, the pretest/posttest half experimental research model, one of the experimental research models, was used. In this framework, a 6-week lesson plan on digital data security awareness was prepared in accordance with the digital narration technique. Students in the experimental group formed groups of 3-6 people among themselves. The groups were asked to prepare short videos or animations for digital data security awareness. The completed videos were watched and evaluated together with prospective teachers during the evaluation process, which lasted approximately 2 hours. In the research, both quantitative and qualitative data collection tools were used by using the digital data security awareness scale and the semi-structured interview form consisting of open-ended questions developed by the researchers. According to the data obtained, it was seen that the digital storytelling technique was effective in creating data security awareness and creating permanent behavior changes for computer and instructional technology students. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20storytelling" title="digital storytelling">digital storytelling</a>, <a href="https://publications.waset.org/abstracts/search?q=self-regulation" title=" self-regulation"> self-regulation</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20data%20security" title=" digital data security"> digital data security</a>, <a href="https://publications.waset.org/abstracts/search?q=teacher%20candidates" title=" teacher candidates"> teacher candidates</a>, <a href="https://publications.waset.org/abstracts/search?q=self-efficacy" title=" self-efficacy"> self-efficacy</a> </p> <a href="https://publications.waset.org/abstracts/124959/improving-digital-data-security-awareness-among-teacher-candidates-with-digital-storytelling-technique" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124959.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">2974</span> The Roles of Aesthetics and Information Quality on Intention to Continued Used of Digital Library within the Context of UTAUT2</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahruhaida%20Adayu%20Mohd%20Paili">Shahruhaida Adayu Mohd Paili</a>, <a href="https://publications.waset.org/abstracts/search?q=Abd%20Latif%20Abdul%20Rahman"> Abd Latif Abdul Rahman</a>, <a href="https://publications.waset.org/abstracts/search?q=Asmadi%20Mohammed%20Ghazali"> Asmadi Mohammed Ghazali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital library was developed by many organizations, especially universities. The digital library can be considered as a new information system. Digital library brings many benefits to the users. There are many researches that have investigated the importance of the digital library, the acceptance, and continuance use of digital library. The investigation towards the digital library is important and it is crucial to understand the reason why users accept and continued use of digital library. Users can search the information and available resources through the digital library website. It is important to know the user’s perception towards the aesthetics of the digital library. Besides that, because of digital library provided information to the users, the researcher also needed to investigate the quality of information in digital library. This study used Extending the Unified Theory of Acceptance and Use of Technology (UTAUT2) in order to know the user’s intention to continued use of digital library. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20library" title="digital library">digital library</a>, <a href="https://publications.waset.org/abstracts/search?q=aesthetics" title=" aesthetics"> aesthetics</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20quality" title=" information quality"> information quality</a>, <a href="https://publications.waset.org/abstracts/search?q=intention%20to%20continued%20use%20of%20digital%20library" title=" intention to continued use of digital library"> intention to continued use of digital library</a>, <a href="https://publications.waset.org/abstracts/search?q=UTAUT2" title=" UTAUT2"> UTAUT2</a> </p> <a href="https://publications.waset.org/abstracts/45725/the-roles-of-aesthetics-and-information-quality-on-intention-to-continued-used-of-digital-library-within-the-context-of-utaut2" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45725.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">388</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">2973</span> Implementing Fault Tolerance with Proxy Signature on the Improvement of RSA System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Fault tolerance and data security are two important issues in modern communication systems. During the transmission of data between the sender and receiver, errors may occur frequently. Therefore, the sender must re-transmit the data to the receiver in order to correct these errors, which makes the system very feeble. To improve the scalability of the scheme, we present a proxy signature scheme with fault tolerance over an efficient and secure authenticated key agreement protocol based on the improved RSA system. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title="fault tolerance">fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=improved%20RSA" title=" improved RSA"> improved RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20agreement" title=" key agreement"> key agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=proxy%20signature" title=" proxy signature"> proxy signature</a> </p> <a href="https://publications.waset.org/abstracts/51456/implementing-fault-tolerance-with-proxy-signature-on-the-improvement-of-rsa-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51456.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">425</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">2972</span> A Practical Approach and Implementation of Digital Library Towards Best Practice in Malaysian Academic Library</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zainab%20Ajab%20Mohideen">Zainab Ajab Mohideen</a>, <a href="https://publications.waset.org/abstracts/search?q=Kiran%20Kaur"> Kiran Kaur</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Basheer%20Ahamadhu"> A. Basheer Ahamadhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Noor%20Azlinda%20Wan%20Jan"> Noor Azlinda Wan Jan</a>, <a href="https://publications.waset.org/abstracts/search?q=Sukmawati%20Muhammad"> Sukmawati Muhammad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The corpus in the digital library is to provide an overview and evidence from library automation that can be used to justify the needs of the digital library. This paper disperses the approach and implementation of the digital library as part of best practices by the Automation Division at Hamzah Sendut Library of the University Science Malaysia (USM). The implemented digital library model emphasizes on the entire library collections, technical perspective, and automation solution. This model served as a foundation for digital library services as part of information delivery in the USM digital library. The approach to digital library includes discussion on key factors, design, architecture, and pragmatic model that has been collected, captured, and identified during the implementation stages. At present, the USM digital library has achieved the status of an Institutional Repository (IR). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=academic%20digital%20library" title="academic digital library">academic digital library</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20information%20system" title=" digital information system"> digital information system</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20library%20best%20practice" title=" digital library best practice"> digital library best practice</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20library%20model" title=" digital library model"> digital library model</a> </p> <a href="https://publications.waset.org/abstracts/31709/a-practical-approach-and-implementation-of-digital-library-towards-best-practice-in-malaysian-academic-library" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31709.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">555</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">2971</span> A Watermarking Signature Scheme with Hidden Watermarks and Constraint Functions in the Symmetric Key Setting</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yanmin%20Zhao">Yanmin Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Siu%20Ming%20Yiu"> Siu Ming Yiu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To claim the ownership for an executable program is a non-trivial task. An emerging direction is to add a watermark to the program such that the watermarked program preserves the original program&rsquo;s functionality and removing the watermark would heavily destroy the functionality of the watermarked program. In this paper, the first watermarking signature scheme with the watermark and the constraint function hidden in the symmetric key setting is constructed. The scheme uses well-known techniques of lattice trapdoors and a lattice evaluation. The watermarking signature scheme is unforgeable under the Short Integer Solution (SIS) assumption and satisfies other security requirements such as the unremovability security property. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=short%20integer%20solution%20%28SIS%29%20problem" title="short integer solution (SIS) problem">short integer solution (SIS) problem</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric-key%20setting" title=" symmetric-key setting"> symmetric-key setting</a>, <a href="https://publications.waset.org/abstracts/search?q=watermarking%20schemes" title=" watermarking schemes"> watermarking schemes</a>, <a href="https://publications.waset.org/abstracts/search?q=watermarked%20signatures" title=" watermarked signatures"> watermarked signatures</a> </p> <a href="https://publications.waset.org/abstracts/126087/a-watermarking-signature-scheme-with-hidden-watermarks-and-constraint-functions-in-the-symmetric-key-setting" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126087.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">133</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">2970</span> A Secure Proxy Signature Scheme with Fault Tolerance Based on RSA System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20El-Kamchouchi">H. El-Kamchouchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Heba%20Gaber"> Heba Gaber</a>, <a href="https://publications.waset.org/abstracts/search?q=Fatma%20Ahmed"> Fatma Ahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Dalia%20H.%20El-Kamchouchi"> Dalia H. El-Kamchouchi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Due to the rapid growth in modern communication systems, fault tolerance and data security are two important issues in a secure transaction. During the transmission of data between the sender and receiver, errors may occur frequently. Therefore, the sender must re-transmit the data to the receiver in order to correct these errors, which makes the system very feeble. To improve the scalability of the scheme, we present a secure proxy signature scheme with fault tolerance over an efficient and secure authenticated key agreement protocol based on RSA system. Authenticated key agreement protocols have an important role in building a secure communications network between the two parties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=proxy%20signature" title="proxy signature">proxy signature</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerance" title=" fault tolerance"> fault tolerance</a>, <a href="https://publications.waset.org/abstracts/search?q=rsa" title=" rsa"> rsa</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20agreement%20protocol" title=" key agreement protocol"> key agreement protocol</a> </p> <a href="https://publications.waset.org/abstracts/51452/a-secure-proxy-signature-scheme-with-fault-tolerance-based-on-rsa-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51452.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">286</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=digital%20signature&amp;page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;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=digital%20signature&amp;page=99">99</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;page=100">100</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=digital%20signature&amp;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">&copy; 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">&times;</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>

Pages: 1 2 3 4 5 6 7 8 9 10