CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: secret sharing scheme</title> <meta name="description" content="Search results for: secret sharing scheme"> <meta name="keywords" content="secret sharing scheme"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="secret sharing scheme" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="secret sharing scheme"> <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> 2488</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: secret sharing scheme</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2488</span> VDGMSISS: A Verifiable and Detectable Multi-Secret Images Sharing Scheme with General Access Structure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Justie%20Su-Tzu%20Juan">Justie Su-Tzu Juan</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming-Jheng%20Li"> Ming-Jheng Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Ching-Fen%20Lee"> Ching-Fen Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ruei-Yu%20Wu"> Ruei-Yu Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A secret image sharing scheme is a way to protect images. The main idea is dispersing the secret image into numerous shadow images. A secret image sharing scheme can withstand the impersonal attack and achieve the highly practical property of multiuse  is more practical. Therefore, this paper proposes a verifiable and detectable secret image-sharing scheme called VDGMSISS to solve the impersonal attack and to achieve some properties such as encrypting multi-secret images at one time and multi-use. Moreover, our scheme can also be used for any genera access structure. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-secret%20image%20sharing%20scheme" title="multi-secret image sharing scheme">multi-secret image sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=verifiable" title=" verifiable"> verifiable</a>, <a href="https://publications.waset.org/abstracts/search?q=de-tectable" title=" de-tectable"> de-tectable</a>, <a href="https://publications.waset.org/abstracts/search?q=general%20access%20structure" title=" general access structure"> general access structure</a> </p> <a href="https://publications.waset.org/abstracts/118758/vdgmsiss-a-verifiable-and-detectable-multi-secret-images-sharing-scheme-with-general-access-structure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118758.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">126</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2487</span> Generalization of Blom Key Predistribution Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Cheraghi">Abbas Cheraghi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A key predistribution scheme provides one method to distribute secret ahead of time. Blom’s scheme is a symmetric threshold key exchange protocol in cryptography. The scheme was proposed by the Swedish cryptographer Rolf Blom. In this kind of scheme, trusted authority gives each user a secret key and a public identifier, which enables any two users to create independently a shared key for communicating between each other. However, if an attacker can compromise the keys of at least Known numbers of users, he can break the scheme and reconstruct every shared key. In this paper generalized Blom’s Scheme by multivariate Lagrange interpolation formula. This scheme is a form of threshold secret sharing scheme. In this new scheme, the amount of information transmitted by the trusted authority is independent of the numbers of users. In addition, this scheme is unconditionally secure against any individual user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=key%20predistribution" title="key predistribution">key predistribution</a>, <a href="https://publications.waset.org/abstracts/search?q=blom%E2%80%99s%20scheme" title=" blom’s scheme"> blom’s scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=unconditional%20secure" title=" unconditional secure"> unconditional secure</a> </p> <a href="https://publications.waset.org/abstracts/39358/generalization-of-blom-key-predistribution-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">437</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2486</span> A Generalization of the Secret Sharing Scheme Codes Over Certain Ring</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ibrahim%20%C3%96zbek">Ibrahim Özbek</a>, <a href="https://publications.waset.org/abstracts/search?q=Erdo%C4%9Fan%20Mehmet%20%C3%96zkan"> Erdoğan Mehmet Özkan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we generalize (k,n) threshold secret sharing scheme on the study Ozbek and Siap to the codes over the ring Fq+ αFq. In this way, it is mentioned that the method obtained in that article can also be used on codes over rings, and new advantages to be obtained. The method of securely sharing the key in cryptography, which Shamir first systematized and Massey carried over to codes, became usable for all error-correcting codes. The firewall of this scheme is based on the hardness of the syndrome decoding problem. Also, an open study area is left for those working for other rings and code classes. All codes that correct errors with this method have been the working area of this method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20codes" title=" linear codes"> linear codes</a>, <a href="https://publications.waset.org/abstracts/search?q=algebra" title=" algebra"> algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20rings" title=" finite rings"> finite rings</a> </p> <a href="https://publications.waset.org/abstracts/164183/a-generalization-of-the-secret-sharing-scheme-codes-over-certain-ring" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/164183.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">74</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2485</span> Minimum Vertices Dominating Set Algorithm for Secret Sharing Scheme </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20M.%20G.%20Al-Saidi">N. M. G. Al-Saidi</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20A.%20Kadhim"> K. A. Kadhim</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20A.%20Rajab"> N. A. Rajab</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over the past decades, computer networks and data communication system has been developing fast, so, the necessity to protect a transmitted data is a challenging issue, and data security becomes a serious problem nowadays. A secret sharing scheme is a method which allows a master key to be distributed among a finite set of participants, in such a way that only certain authorized subsets of participants to reconstruct the original master key. To create a secret sharing scheme, many mathematical structures have been used; the most widely used structure is the one that is based on graph theory (graph access structure). Subsequently, many researchers tried to find efficient schemes based on graph access structures. In this paper, we propose a novel efficient construction of a perfect secret sharing scheme for uniform access structure. The dominating set of vertices in a regular graph is used for this construction in the following way; each vertex represents a participant and each minimum independent dominating subset represents a minimal qualified subset. Some relations between dominating set, graph order and regularity are achieved, and can be used to demonstrate the possibility of using dominating set to construct a secret sharing scheme. The information rate that is used as a measure for the efficiency of such systems is calculated to show that the proposed method has some improved values. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme" title="secret sharing scheme">secret sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=dominating%20set" title=" dominating set"> dominating set</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20rate" title=" information rate"> information rate</a>, <a href="https://publications.waset.org/abstracts/search?q=access%20structure" title=" access structure"> access structure</a>, <a href="https://publications.waset.org/abstracts/search?q=rank" title=" rank"> rank</a> </p> <a href="https://publications.waset.org/abstracts/32399/minimum-vertices-dominating-set-algorithm-for-secret-sharing-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32399.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">393</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2484</span> A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hui-Chuan%20Lu">Hui-Chuan Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret-sharing%20scheme" title="secret-sharing scheme">secret-sharing scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20information%20ratio" title=" average information ratio"> average information ratio</a>, <a href="https://publications.waset.org/abstracts/search?q=star%20covering" title=" star covering"> star covering</a>, <a href="https://publications.waset.org/abstracts/search?q=deduction" title=" deduction"> deduction</a>, <a href="https://publications.waset.org/abstracts/search?q=core%20cluster" title=" core cluster"> core cluster</a> </p> <a href="https://publications.waset.org/abstracts/9671/a-new-bound-on-the-average-information-ratio-of-perfect-secret-sharing-schemes-for-access-structures-based-on-bipartite-graphs-of-larger-girth" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9671.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2483</span> Secret Sharing in Visual Cryptography Using NVSS and Data Hiding Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Misha%20Alexander">Misha Alexander</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20Waykar"> S. B. Waykar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual Cryptography is a special unbreakable encryption technique that transforms the secret image into random noisy pixels. These shares are transmitted over the network and because of its noisy texture it attracts the hackers. To address this issue a Natural Visual Secret Sharing Scheme (NVSS) was introduced that uses natural shares either in digital or printed form to generate the noisy secret share. This scheme greatly reduces the transmission risk but causes distortion in the retrieved secret image through variation in settings and properties of digital devices used to capture the natural image during encryption / decryption phase. This paper proposes a new NVSS scheme that extracts the secret key from randomly selected unaltered multiple natural images. To further improve the security of the shares data hiding techniques such as Steganography and Alpha channel watermarking are proposed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decryption" title="decryption">decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20visual%20secret%20sharing" title=" natural visual secret sharing"> natural visual secret sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20images" title=" natural images"> natural images</a>, <a href="https://publications.waset.org/abstracts/search?q=noisy%20share" title=" noisy share"> noisy share</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20swapping" title=" pixel swapping"> pixel swapping</a> </p> <a href="https://publications.waset.org/abstracts/33268/secret-sharing-in-visual-cryptography-using-nvss-and-data-hiding-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">404</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2482</span> Cloud Data Security Using Map/Reduce Implementation of Secret Sharing Schemes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sara%20Ibn%20El%20Ahrache">Sara Ibn El Ahrache</a>, <a href="https://publications.waset.org/abstracts/search?q=Tajje-eddine%20Rachidi"> Tajje-eddine Rachidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Badir"> Hassan Badir</a>, <a href="https://publications.waset.org/abstracts/search?q=Abderrahmane%20Sbihi"> Abderrahmane Sbihi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, there has been increasing confidence for a favorable usage of big data drawn out from the huge amount of information deposited in a cloud computing system. Data kept on such systems can be retrieved through the network at the user’s convenience. However, the data that users send include private information, and therefore, information leakage from these data is now a major social problem. The usage of secret sharing schemes for cloud computing have lately been approved to be relevant in which users deal out their data to several servers. Notably, in a (k,n) threshold scheme, data security is assured if and only if all through the whole life of the secret the opponent cannot compromise more than k of the n servers. In fact, a number of secret sharing algorithms have been suggested to deal with these security issues. In this paper, we present a Mapreduce implementation of Shamir’s secret sharing scheme to increase its performance and to achieve optimal security for cloud data. Different tests were run and through it has been demonstrated the contributions of the proposed approach. These contributions are quite considerable in terms of both security and performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20security" title=" data security"> data security</a>, <a href="https://publications.waset.org/abstracts/search?q=Mapreduce" title=" Mapreduce"> Mapreduce</a>, <a href="https://publications.waset.org/abstracts/search?q=Shamir%27s%20secret%20sharing" title=" Shamir's secret sharing"> Shamir's secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/61331/cloud-data-security-using-mapreduce-implementation-of-secret-sharing-schemes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/61331.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">306</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2481</span> A New Authenticable Steganographic Method via the Use of Numeric Data on Public Websites</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Che-Wei%20Lee">Che-Wei Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Bay-Erl%20Lai"> Bay-Erl Lai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new steganographic method via the use of numeric data on public websites with self-authentication capability is proposed. The proposed technique transforms a secret message into partial shares by Shamir’s (k, n)-threshold secret sharing scheme with n = k + 1. The generated k+1 partial shares then are embedded into the selected numeric items in a website as if they are part of the website’s numeric content. Afterward, a receiver links to the website and extracts every k shares among the k+1 ones from the stego-numeric-content to compute k+1 copies of the secret, and the phenomenon of value consistency of the computed k+1 copies is taken as an evidence to determine whether the extracted message is authentic or not, attaining the goal of self-authentication of the extracted secret message. Experimental results and discussions are provided to show the feasibility and effectiveness of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20hiding" title=" data hiding"> data hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20authentication" title=" secret authentication"> secret authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=secret%20sharing" title=" secret sharing"> secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/27578/a-new-authenticable-steganographic-method-via-the-use-of-numeric-data-on-public-websites" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27578.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">243</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2480</span> Privacy Preserving in Association Rule Mining on Horizontally Partitioned Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manvar%20Sagar">Manvar Sagar</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikul%20Virpariya"> Nikul Virpariya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The advancement in data mining techniques plays an important role in many applications. In context of privacy and security issues, the problems caused by association rule mining technique are investigated by many research scholars. It is proved that the misuse of this technique may reveal the database owner’s sensitive and private information to others. Many researchers have put their effort to preserve privacy in Association Rule Mining. Amongst the two basic approaches for privacy preserving data mining, viz. Randomization based and Cryptography based, the later provides high level of privacy but incurs higher computational as well as communication overhead. Hence, it is necessary to explore alternative techniques that improve the over-heads. In this work, we propose an efficient, collusion-resistant cryptography based approach for distributed Association Rule mining using Shamir’s secret sharing scheme. As we show from theoretical and practical analysis, our approach is provably secure and require only one time a trusted third party. We use secret sharing for privately sharing the information and code based identification scheme to add support against malicious adversaries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Privacy" title="Privacy">Privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=Privacy%20Preservation%20in%20Data%20Mining%20%28PPDM%29" title=" Privacy Preservation in Data Mining (PPDM)"> Privacy Preservation in Data Mining (PPDM)</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontally%20partitioned%20database" title=" horizontally partitioned database"> horizontally partitioned database</a>, <a href="https://publications.waset.org/abstracts/search?q=EMHS" title=" EMHS"> EMHS</a>, <a href="https://publications.waset.org/abstracts/search?q=MFI" title=" MFI"> MFI</a>, <a href="https://publications.waset.org/abstracts/search?q=shamir%20secret%20sharing" title=" shamir secret sharing"> shamir secret sharing</a> </p> <a href="https://publications.waset.org/abstracts/20983/privacy-preserving-in-association-rule-mining-on-horizontally-partitioned-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20983.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">408</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">2479</span> Lossless Secret Image Sharing Based on Integer Discrete Cosine Transform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Li">Li Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20A.%20Abd%20El-Latif"> Ahmed A. Abd El-Latif</a>, <a href="https://publications.waset.org/abstracts/search?q=Aya%20El-Fatyany"> Aya El-Fatyany</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Amin"> Mohamed Amin </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a new secret image sharing method based on integer discrete cosine transform (IntDCT). It first transforms the original image into the frequency domain (DCT coefficients) using IntDCT, which are operated on each block with size 8*8. Then, it generates shares among each DCT coefficients in the same place of each block, that is, all the DC components are used to generate DC shares, the ith AC component in each block are utilized to generate ith AC shares, and so on. The DC and AC shares components with the same number are combined together to generate DCT shadows. Experimental results and analyses show that the proposed method can recover the original image lossless than those methods based on traditional DCT and is more sensitive to tiny change in both the coefficients and the content of the image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=secret%20image%20sharing" title="secret image sharing">secret image sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20DCT" title=" integer DCT"> integer DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=lossless%20recovery" title=" lossless recovery"> lossless recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity" title=" sensitivity"> sensitivity</a> </p> <a href="https://publications.waset.org/abstracts/36824/lossless-secret-image-sharing-based-on-integer-discrete-cosine-transform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36824.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">398</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">2478</span> An Adaptive Opportunistic Transmission for Unlicensed Spectrum Sharing in Heterogeneous Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Daehyoung%20Kim">Daehyoung Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Pervez%20Khan"> Pervez Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hoon%20Kim"> Hoon Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Efficient utilization of spectrum resources is a fundamental issue of wireless communications due to its scarcity. To improve the efficiency of spectrum utilization, the spectrum sharing for unlicensed bands is being regarded as one of key technologies in the next generation wireless networks. A number of schemes such as Listen-Before-Talk(LBT) and carrier sensor adaptive transmission (CSAT) have been suggested from this aspect, but more efficient sharing schemes are required for improving spectrum utilization efficiency. This work considers an opportunistic transmission approach and a dynamic Contention Window (CW) adjustment scheme for LTE-U users sharing the unlicensed spectrum with Wi-Fi, in order to enhance the overall system throughput. The decision criteria for the dynamic adjustment of CW are based on the collision evaluation, derived from the collision probability of the system. The overall performance can be improved due to the adaptive adjustment of the CW. Simulation results show that our proposed scheme outperforms the Distributed Coordination Function (DCF) mechanism of IEEE 802.11 MAC. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=spectrum%20sharing" title="spectrum sharing">spectrum sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20opportunistic%20transmission" title=" adaptive opportunistic transmission"> adaptive opportunistic transmission</a>, <a href="https://publications.waset.org/abstracts/search?q=unlicensed%20bands" title=" unlicensed bands"> unlicensed bands</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20networks" title=" heterogeneous networks"> heterogeneous networks</a> </p> <a href="https://publications.waset.org/abstracts/51830/an-adaptive-opportunistic-transmission-for-unlicensed-spectrum-sharing-in-heterogeneous-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51830.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">350</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">2477</span> Local Differential Privacy-Based Data-Sharing Scheme for Smart Utilities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Veniamin%20Boiarkin">Veniamin Boiarkin</a>, <a href="https://publications.waset.org/abstracts/search?q=Bruno%20Bogaz%20Zarpel%C3%A3o"> Bruno Bogaz Zarpelão</a>, <a href="https://publications.waset.org/abstracts/search?q=Muttukrishnan%20Rajarajan"> Muttukrishnan Rajarajan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The manufacturing sector is a vital component of most economies, which leads to a large number of cyberattacks on organisations, whereas disruption in operation may lead to significant economic consequences. Adversaries aim to disrupt the production processes of manufacturing companies, gain financial advantages, and steal intellectual property by getting unauthorised access to sensitive data. Access to sensitive data helps organisations to enhance the production and management processes. However, the majority of the existing data-sharing mechanisms are either susceptible to different cyber attacks or heavy in terms of computation overhead. In this paper, a privacy-preserving data-sharing scheme for smart utilities is proposed. First, a customer’s privacy adjustment mechanism is proposed to make sure that end-users have control over their privacy, which is required by the latest government regulations, such as the General Data Protection Regulation. Secondly, a local differential privacy-based mechanism is proposed to ensure the privacy of the end-users by hiding real data based on the end-user preferences. The proposed scheme may be applied to different industrial control systems, whereas in this study, it is validated for energy utility use cases consisting of smart, intelligent devices. The results show that the proposed scheme may guarantee the required level of privacy with an expected relative error in utility. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data-sharing" title="data-sharing">data-sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20differential%20privacy" title=" local differential privacy"> local differential privacy</a>, <a href="https://publications.waset.org/abstracts/search?q=manufacturing" title=" manufacturing"> manufacturing</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy-preserving%20mechanism" title=" privacy-preserving mechanism"> privacy-preserving mechanism</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20utility" title=" smart utility"> smart utility</a> </p> <a href="https://publications.waset.org/abstracts/171375/local-differential-privacy-based-data-sharing-scheme-for-smart-utilities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/171375.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">76</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">2476</span> Evaluation and Analysis of the Secure E-Voting Authentication Preparation Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nidal%20F.%20Shilbayeh">Nidal F. Shilbayeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Reem%20A.%20Al-Saidi"> Reem A. Al-Saidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20H.%20Alsswey"> Ahmed H. Alsswey</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we presented an evaluation and analysis of E-Voting Authentication Preparation Scheme (EV-APS). EV-APS applies some modified security aspects that enhance the security measures and adds a strong wall of protection, confidentiality, non-repudiation and authentication requirements. Some of these modified security aspects are Kerberos authentication protocol, PVID scheme, responder certificate validation, and the converted Ferguson e-cash protocol. Authentication and privacy requirements have been evaluated and proved. Authentication guaranteed only eligible and authorized voters were permitted to vote. Also, the privacy guaranteed that all votes will be kept secret. Evaluation and analysis of some of these security requirements have been given. These modified aspects will help in filtering the counter buffer from unauthorized votes by ensuring that only authorized voters are permitted to vote. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=e-voting%20preparation%20stage" title="e-voting preparation stage">e-voting preparation stage</a>, <a href="https://publications.waset.org/abstracts/search?q=blind%20signature%20protocol" title=" blind signature protocol"> blind signature protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Nonce%20based%20authentication%20scheme" title=" Nonce based authentication scheme"> Nonce based authentication scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=Kerberos%20Authentication%20Protocol" title=" Kerberos Authentication Protocol"> Kerberos Authentication Protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo%20voter%20identity%20scheme%20PVID" title=" pseudo voter identity scheme PVID"> pseudo voter identity scheme PVID</a> </p> <a href="https://publications.waset.org/abstracts/48108/evaluation-and-analysis-of-the-secure-e-voting-authentication-preparation-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48108.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">298</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">2475</span> A Novel Approach of Secret Communication Using Douglas-Peucker Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Kiruthika">R. Kiruthika</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Kannan"> A. Kannan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Steganography is the problem of hiding secret messages in 'innocent – looking' public communication so that the presence of the secret message cannot be detected. This paper introduces a steganographic security in terms of computational in-distinguishability from a channel of probability distributions on cover messages. This method first splits the cover image into two separate blocks using Douglas – Peucker algorithm. The text message and the image will be hided in the Least Significant Bit (LSB) of the cover image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=steganography" title="steganography">steganography</a>, <a href="https://publications.waset.org/abstracts/search?q=lsb" title=" lsb"> lsb</a>, <a href="https://publications.waset.org/abstracts/search?q=embedding" title=" embedding"> embedding</a>, <a href="https://publications.waset.org/abstracts/search?q=Douglas-Peucker%20algorithm" title=" Douglas-Peucker algorithm"> Douglas-Peucker algorithm</a> </p> <a href="https://publications.waset.org/abstracts/29673/a-novel-approach-of-secret-communication-using-douglas-peucker-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2474</span> Opacity Synthesis with Orwellian Observers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Moez%20Yeddes">Moez Yeddes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The property of opacity is widely used in the formal verification of security in computer systems and protocols. Opacity is a general language-theoretic scheme of many security properties of systems. Opacity is parametrized with framework in which several security properties of a system can be expressed. A secret behaviour of a system is opaque if a passive attacker can never deduce its occurrence from the system observation. Instead of considering the case of static observability where the set of observable events is fixed off-line or dynamic observability where the set of observable events changes over time depending on the history of the trace, we introduce Orwellian partial observability where unobservable events are not revealed provided that downgrading events never occurs in the future of the trace. Orwellian partial observability is needed to model intransitive information flow. This Orwellian observability is knwon as ipurge function. We show in previous work how to verify opacity for regular secret is opaque for a regular language L w.r.t. an Orwellian projection is PSPACE-complete while it has been proved undecidable even for a regular language L w.r.t. a general Orwellian observation function. In this paper, we address two problems of opacification of a regular secret ϕ for a regular language L w.r.t. an Orwellian projection: Given L and a secret ϕ ∈ L, the first problem consist to compute some minimal regular super-language M of L, if it exists, such that ϕ is opaque for M and the second consists to compute the supremal sub-language M′ of L such that ϕ is opaque for M′. We derive both language-theoretic characterizations and algorithms to solve these two dual problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security%20policies" title="security policies">security policies</a>, <a href="https://publications.waset.org/abstracts/search?q=opacity" title=" opacity"> opacity</a>, <a href="https://publications.waset.org/abstracts/search?q=formal%20verification" title=" formal verification"> formal verification</a>, <a href="https://publications.waset.org/abstracts/search?q=orwellian%0D%0Aobservation" title=" orwellian observation"> orwellian observation</a> </p> <a href="https://publications.waset.org/abstracts/41268/opacity-synthesis-with-orwellian-observers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41268.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">225</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">2473</span> Difference Expansion Based Reversible Data Hiding Scheme Using Edge Directions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Toshanlal%20Meenpal">Toshanlal Meenpal</a>, <a href="https://publications.waset.org/abstracts/search?q=Ankita%20Meenpal"> Ankita Meenpal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A very important technique in reversible data hiding field is Difference expansion. Secret message as well as the cover image may be completely recovered without any distortion after data extraction process due to reversibility feature. In general, in any difference expansion scheme embedding is performed by integer transform in the difference image acquired by grouping two neighboring pixel values. This paper proposes an improved reversible difference expansion embedding scheme. We mainly consider edge direction for embedding by modifying the difference of two neighboring pixels values. In general, the larger difference tends to bring a degraded stego image quality than the smaller difference. Image quality in the range of 0.5 to 3.7 dB in average is achieved by the proposed scheme, which is shown through the experimental results. However payload wise it achieves almost similar capacity in comparisons with previous method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20hiding" title="information hiding">information hiding</a>, <a href="https://publications.waset.org/abstracts/search?q=wedge%20direction" title=" wedge direction"> wedge direction</a>, <a href="https://publications.waset.org/abstracts/search?q=difference%20expansion" title=" difference expansion"> difference expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=integer%20transform" title=" integer transform"> integer transform</a> </p> <a href="https://publications.waset.org/abstracts/18293/difference-expansion-based-reversible-data-hiding-scheme-using-edge-directions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18293.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">484</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">2472</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">2471</span> Advanced CoMP Scheme for LTE-based V2X System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Su-Hyun%20Jung">Su-Hyun Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Young-Su%20Ryu"> Young-Su Ryu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yong-Jun%20Kim"> Yong-Jun Kim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a highly efficient coordinated multiple-point (CoMP) scheme for vehicular communication is proposed. The proposed scheme controls the transmit power and applies proper transmission scheme for the various situations. The proposed CoMP scheme provides comparable performance to the conventional dynamic cell selection (DCS) scheme. Moreover, this scheme provides improved power efficiency compared with the conventional joint transmission (JT) scheme. Simulation results show that the proposed scheme can achieve more enhanced performance with the high power efficiency and improve the cell capacity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CoMP" title="CoMP">CoMP</a>, <a href="https://publications.waset.org/abstracts/search?q=LTE-A" title=" LTE-A"> LTE-A</a>, <a href="https://publications.waset.org/abstracts/search?q=V2I" title=" V2I"> V2I</a>, <a href="https://publications.waset.org/abstracts/search?q=V2V" title=" V2V"> V2V</a>, <a href="https://publications.waset.org/abstracts/search?q=V2X." title=" V2X."> V2X.</a> </p> <a href="https://publications.waset.org/abstracts/32520/advanced-comp-scheme-for-lte-based-v2x-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32520.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">583</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">2470</span> Secure Message Transmission Using Meaningful Shares</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ajish%20Sreedharan">Ajish Sreedharan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Visual cryptography encodes a secret image into shares of random binary patterns. If the shares are exerted onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the shares, however, have no visual meaning and hinder the objectives of visual cryptography. In the Secret Message Transmission through Meaningful Shares a secret message to be transmitted is converted to grey scale image. Then (2,2) visual cryptographic shares are generated from this converted gray scale image. The shares are encrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. Two separate color images which are of the same size of the shares, taken as cover image of the respective shares to hide the shares into them. The encrypted shares which are covered by meaningful images so that a potential eavesdropper wont know there is a message to be read. The meaningful shares are transmitted through two different transmission medium. During decoding shares are fetched from received meaningful images and decrypted using A Chaos-Based Image Encryption Algorithm Using Wavelet Transform. The shares are combined to regenerate the grey scale image from where the secret message is obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=visual%20cryptography" title="visual cryptography">visual cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20transform" title=" wavelet transform"> wavelet transform</a>, <a href="https://publications.waset.org/abstracts/search?q=meaningful%20shares" title=" meaningful shares"> meaningful shares</a>, <a href="https://publications.waset.org/abstracts/search?q=grey%20scale%20image" title=" grey scale image"> grey scale image</a> </p> <a href="https://publications.waset.org/abstracts/16629/secure-message-transmission-using-meaningful-shares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16629.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">455</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2469</span> Image Encryption Using Eureqa to Generate an Automated Mathematical Key</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Halima%20Adel%20Halim%20Shnishah">Halima Adel Halim Shnishah</a>, <a href="https://publications.waset.org/abstracts/search?q=David%20Mulvaney"> David Mulvaney</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Applying traditional symmetric cryptography algorithms while computing encryption and decryption provides immunity to secret keys against different attacks. One of the popular techniques generating automated secret keys is evolutionary computing by using Eureqa API tool, which got attention in 2013. In this paper, we are generating automated secret keys for image encryption and decryption using Eureqa API (tool which is used in evolutionary computing technique). Eureqa API models pseudo-random input data obtained from a suitable source to generate secret keys. The validation of generated secret keys is investigated by performing various statistical tests (histogram, chi-square, correlation of two adjacent pixels, correlation between original and encrypted images, entropy and key sensitivity). Experimental results obtained from methods including histogram analysis, correlation coefficient, entropy and key sensitivity, show that the proposed image encryption algorithms are secure and reliable, with the potential to be adapted for secure image communication applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption%20algorithms" title="image encryption algorithms">image encryption algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=Eureqa" title=" Eureqa"> Eureqa</a>, <a href="https://publications.waset.org/abstracts/search?q=statistical%20measurements" title=" statistical measurements"> statistical measurements</a>, <a href="https://publications.waset.org/abstracts/search?q=automated%20key%20generation" title=" automated key generation"> automated key generation</a> </p> <a href="https://publications.waset.org/abstracts/79042/image-encryption-using-eureqa-to-generate-an-automated-mathematical-key" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79042.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">482</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2468</span> Error Analysis of Wavelet-Based Image Steganograhy Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Geeta%20Kasana">Geeta Kasana</a>, <a href="https://publications.waset.org/abstracts/search?q=Kulbir%20Singh"> Kulbir Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Satvinder%20Singh"> Satvinder Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a steganographic scheme for digital images using Integer Wavelet Transform (IWT) is proposed. The cover image is decomposed into wavelet sub bands using IWT. Each of the subband is divided into blocks of equal size and secret data is embedded into the largest and smallest pixel values of each block of the subband. Visual quality of stego images is acceptable as PSNR between cover image and stego is above 40 dB, imperceptibility is maintained. Experimental results show better tradeoff between capacity and visual perceptivity compared to the existing algorithms. Maximum possible error analysis is evaluated for each of the wavelet subbands of an image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DWT" title="DWT">DWT</a>, <a href="https://publications.waset.org/abstracts/search?q=IWT" title=" IWT"> IWT</a>, <a href="https://publications.waset.org/abstracts/search?q=MSE" title=" MSE"> MSE</a>, <a href="https://publications.waset.org/abstracts/search?q=PSNR" title=" PSNR"> PSNR</a> </p> <a href="https://publications.waset.org/abstracts/19367/error-analysis-of-wavelet-based-image-steganograhy-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19367.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">504</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">2467</span> The Effect of Supply Chain Integration on Information Sharing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khlif%20Hamadi">Khlif Hamadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Supply chain integration has become a potentially valuable way of securing shared information and improving supply chain performance since competition is no longer between organizations but among supply chains. This research conceptualizes and develops three dimensions of supply chain integration (integration with customers, integration with suppliers, and the interorganizational integration) and tests the relationships between supply chain integration, information sharing, and supply chain performance. Furthermore, the four types of information sharing namely; information sharing with customers, information sharing with suppliers, inter-functional information sharing, and intra-organizational information sharing; and the four constructs of Supply Chain Performance represents expenses of costs, asset utilization, supply chain reliability, and supply chain flexibility and responsiveness. The theoretical and practical implications of the study, as well as directions for future research, are discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20integration" title="supply chain integration">supply chain integration</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20management" title=" supply chain management"> supply chain management</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20sharing" title=" information sharing"> information sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=supply%20chain%20performance" title=" supply chain performance"> supply chain performance</a> </p> <a href="https://publications.waset.org/abstracts/90589/the-effect-of-supply-chain-integration-on-information-sharing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/90589.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">260</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">2466</span> Modeling Salam Contract for Profit and Loss Sharing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dchieche%20Amina">Dchieche Amina</a>, <a href="https://publications.waset.org/abstracts/search?q=Aboulaich%20Rajae"> Aboulaich Rajae</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Profit and loss sharing suggests an equitable sharing of risks and profits between the parts involved in a financial transaction. Salam is a contract in which advance payment is made for goods to be delivered at a future date. The purpose of this work is to price a new contract for profit and loss sharing based on Salam contract, using Khiyar Al Ghabn which is an agreement of choice in case of misrepresent facts. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Islamic%20finance" title="Islamic finance">Islamic finance</a>, <a href="https://publications.waset.org/abstracts/search?q=shariah%20compliance" title=" shariah compliance"> shariah compliance</a>, <a href="https://publications.waset.org/abstracts/search?q=profi%0Ct%20and%20loss%20sharing" title=" profit and loss sharing"> profit and loss sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=derivatives" title=" derivatives"> derivatives</a>, <a href="https://publications.waset.org/abstracts/search?q=risks" title=" risks"> risks</a>, <a href="https://publications.waset.org/abstracts/search?q=hedging" title=" hedging"> hedging</a>, <a href="https://publications.waset.org/abstracts/search?q=salam%20contract" title=" salam contract"> salam contract</a> </p> <a href="https://publications.waset.org/abstracts/41170/modeling-salam-contract-for-profit-and-loss-sharing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41170.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">332</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">2465</span> Cars Redistribution Optimization Problem in the Free-Float Car-Sharing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amine%20Ait-Ouahmed">Amine Ait-Ouahmed</a>, <a href="https://publications.waset.org/abstracts/search?q=Didier%20Josselin"> Didier Josselin</a>, <a href="https://publications.waset.org/abstracts/search?q=Fen%20Zhou"> Fen Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Free-Float car-sharing is an one-way car-sharing service where cars are available anytime and anywhere in the streets such that no dedicated stations are needed. This means that after driving a car you can park it anywhere. This car-sharing system creates an imbalance car distribution in the cites which can be regulated by staff agents through the redistribution of cars. In this paper, we aim to solve the car-reservation and agents traveling problem so that the number of successful cars’ reservations could be maximized. Beside, we also tend to minimize the distance traveled by agents for cars redistribution. To this end, we present a mixed integer linear programming formulation for the car-sharing problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=one-way%20car-sharing" title="one-way car-sharing">one-way car-sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20redistribution" title=" vehicle redistribution"> vehicle redistribution</a>, <a href="https://publications.waset.org/abstracts/search?q=car%20reservation" title=" car reservation"> car reservation</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20programming" title=" linear programming"> linear programming</a> </p> <a href="https://publications.waset.org/abstracts/67501/cars-redistribution-optimization-problem-in-the-free-float-car-sharing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67501.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">347</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">2464</span> Research and Development of Net-Centric Information Sharing Platform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wang%20Xiaoqing">Wang Xiaoqing</a>, <a href="https://publications.waset.org/abstracts/search?q=Fang%20Youyuan"> Fang Youyuan</a>, <a href="https://publications.waset.org/abstracts/search?q=Zheng%20Yanxing"> Zheng Yanxing</a>, <a href="https://publications.waset.org/abstracts/search?q=Gu%20Tianyang"> Gu Tianyang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zong%20Jianjian"> Zong Jianjian</a>, <a href="https://publications.waset.org/abstracts/search?q=Tong%20Jinrong"> Tong Jinrong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Compared with traditional distributed environment, the net-centric environment brings on more demanding challenges for information sharing with the characteristics of ultra-large scale and strong distribution, dynamic, autonomy, heterogeneity, redundancy. This paper realizes an information sharing model and a series of core services, through which provides an open, flexible and scalable information sharing platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=net-centric%20environment" title="net-centric environment">net-centric environment</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20sharing" title=" information sharing"> information sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=metadata%20registry%20and%20catalog" title=" metadata registry and catalog"> metadata registry and catalog</a>, <a href="https://publications.waset.org/abstracts/search?q=cross-domain%20data%20access%20control" title=" cross-domain data access control"> cross-domain data access control</a> </p> <a href="https://publications.waset.org/abstracts/7286/research-and-development-of-net-centric-information-sharing-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7286.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">569</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">2463</span> Uses and Gratification with the Website Secret-thai.com</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Siriporn%20Meenanan">Siriporn Meenanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The objective of this study is to study about the uses and gratification of the sample who use the website that named secret-thai.com which provides moral contents, inspires, and builds up the spirit. The study found that the samples mainly use this website to follow up on the dharma activities. They also use the space as the web board to discuss about dharma issues. Moreover, the contents help readers to relax and also provides the guidelines to deal with stress and uncomfortable situations properly. The samples found to be most satisfied. In other words, the samples found the contents of the website are complete, and can cover their needs. Moreover, they found that contents useful in their ways of living. In addition, they are satisfied with the beautiful and interesting design of the website and well classification of the contents that readers can easily find the information that they want. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=uses%20and%20gratification" title="uses and gratification">uses and gratification</a>, <a href="https://publications.waset.org/abstracts/search?q=website" title=" website"> website</a>, <a href="https://publications.waset.org/abstracts/search?q=Secret-Thai.com" title=" Secret-Thai.com"> Secret-Thai.com</a>, <a href="https://publications.waset.org/abstracts/search?q=moral%20contents" title=" moral contents"> moral contents</a> </p> <a href="https://publications.waset.org/abstracts/56197/uses-and-gratification-with-the-website-secret-thaicom" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56197.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">232</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2462</span> Knowledge Sharing and Organizational Performance: A System Dynamics Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shachi%20Pathak">Shachi Pathak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We are living in knowledge based economy where firms can gain competitive advantage with the help of managing knowledge within the organization. The purpose the study is to develop a conceptual model to explain the relationship between factors affecting knowledge sharing, called as knowledge enablers, in an organization, knowledge sharing activities and organizational performance, using system dynamics approach. This research is important since it will provide better understandings on what are the key knowledge enablers to support knowledge sharing activities, and how knowledge sharing activities will affect the capability of an organization to enhance the performance of the organization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=knowledge%20management" title="knowledge management">knowledge management</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing" title=" knowledge sharing"> knowledge sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=organizational%20performance" title=" organizational performance"> organizational performance</a>, <a href="https://publications.waset.org/abstracts/search?q=system%20dynamics" title=" system dynamics"> system dynamics</a> </p> <a href="https://publications.waset.org/abstracts/36508/knowledge-sharing-and-organizational-performance-a-system-dynamics-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36508.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">374</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">2461</span> Knowledge and Information Sharing in the Opinion of the Polish Academic Community</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marzena%20%C5%9Awigo%C5%84">Marzena Świgoń</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to describe the perceptions of knowledge and information sharing by the Polish academic community. An electronic questionnaire was used to gather opinions of respondents. The presented results are a part of the findings of empirical studies carried out amongst academics from various types of universities and academia located throughout Poland. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=academics" title="academics">academics</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20sharing" title=" information sharing"> information sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing" title=" knowledge sharing"> knowledge sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=scholarly%20communication" title=" scholarly communication"> scholarly communication</a> </p> <a href="https://publications.waset.org/abstracts/17121/knowledge-and-information-sharing-in-the-opinion-of-the-polish-academic-community" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17121.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">412</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">2460</span> Organizational Climate being Knowledge Sharing Oriented: A Fuzzy-Set Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paulo%20Lopes%20Henriques">Paulo Lopes Henriques</a>, <a href="https://publications.waset.org/abstracts/search?q=Carla%20Curado"> Carla Curado</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to literature, knowledge sharing behaviors are influenced by organizational values and structures, namely organizational climate. The manuscript examines the antecedents of the knowledge sharing oriented organizational climate. According to theoretical expectations the study adopts the following explanatory conditions: knowledge sharing costs, knowledge sharing incentives, perceptions of knowledge sharing contributing to performance and tenure. The study confronts results considering two groups of firms: nondigital (firms without intranet) vs digital (firms with intranet). The paper applies fsQCA technique to analyze data by using fsQCA 2.5 software (www.fsqca.com) testing several conditional arguments to explain the outcome variable. Main results strengthen claims on the relevancy of the contribution of knowledge sharing to performance. Secondly, evidence brings tenure - an explanatory condition that is associated to organizational memory – to the spotlight. The study provides an original contribution not previously addressed in literature, since it identifies the sufficient conditions sets to knowledge sharing oriented organizational climate using fsQCA, which is, to our knowledge, a novel application of the technique. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fsQCA" title="fsQCA">fsQCA</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing%20oriented%20organizational%20climate" title=" knowledge sharing oriented organizational climate"> knowledge sharing oriented organizational climate</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing%20costs" title=" knowledge sharing costs"> knowledge sharing costs</a>, <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing%20incentives" title=" knowledge sharing incentives"> knowledge sharing incentives</a> </p> <a href="https://publications.waset.org/abstracts/45641/organizational-climate-being-knowledge-sharing-oriented-a-fuzzy-set-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45641.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">328</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2459</span> Knowledge Sharing within a Team: Exploring the Antecedents and Role of Trust</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Yan%20Hei">Li Yan Hei</a>, <a href="https://publications.waset.org/abstracts/search?q=Au%20Wing%20Tung"> Au Wing Tung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Knowledge sharing is a process in which individuals mutually exchange existing knowledge and co-create new knowledge. Previous research has confirmed that trust is positively associated with knowledge sharing. However, only few studies systematically examined the antecedents of trust and these antecedents’ impacts on knowledge sharing. In order to explore and understand the relationships between trust and knowledge sharing in depth, this study proposed a relationship maintenance-based model to examine the antecedents of trust in knowledge sharing in project teams. Three critical elements within a project team were measured, including the environment, project team partner and interaction. It was hypothesized that the trust would lead to knowledge sharing and in turn result in perceived good team performance. With a sample of 200 Hong Kong employees, the proposed model was evaluated with structural equation modeling. Expected findings are trust will contribute to knowledge sharing, resulting in better team performance. The results will also offer insights into antecedents of trust that play a heavy role in the focal relationship. The present study contributes to a more holistic understanding of relationship between trust and knowledge sharing by linking the antecedents and outcomes. The findings will raise the awareness of project managers on ways to promote knowledge sharing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=knowledge%20sharing" title="knowledge sharing">knowledge sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=project%20management" title=" project management"> project management</a>, <a href="https://publications.waset.org/abstracts/search?q=team" title=" team"> team</a>, <a href="https://publications.waset.org/abstracts/search?q=trust" title=" trust"> trust</a> </p> <a href="https://publications.waset.org/abstracts/25010/knowledge-sharing-within-a-team-exploring-the-antecedents-and-role-of-trust" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25010.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">617</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=82">82</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=83">83</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=secret%20sharing%20scheme&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>