Search results for: shamir secret sharing
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1176

Search results for: shamir secret sharing

1176 Cloud Data Security Using Map/Reduce Implementation of Secret Sharing Schemes

Authors: Sara Ibn El Ahrache, Tajje-eddine Rachidi, Hassan Badir, Abderrahmane Sbihi

Abstract:

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.

Keywords: cloud computing, data security, Mapreduce, Shamir's secret sharing

Procedia PDF Downloads 306
1175 A Generalization of the Secret Sharing Scheme Codes Over Certain Ring

Authors: Ibrahim Özbek, Erdoğan Mehmet Özkan

Abstract:

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.

Keywords: secret sharing scheme, linear codes, algebra, finite rings

Procedia PDF Downloads 72
1174 A New Authenticable Steganographic Method via the Use of Numeric Data on Public Websites

Authors: Che-Wei Lee, Bay-Erl Lai

Abstract:

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.

Keywords: steganography, data hiding, secret authentication, secret sharing

Procedia PDF Downloads 243
1173 Privacy Preserving in Association Rule Mining on Horizontally Partitioned Database

Authors: Manvar Sagar, Nikul Virpariya

Abstract:

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.

Keywords: Privacy, Privacy Preservation in Data Mining (PPDM), horizontally partitioned database, EMHS, MFI, shamir secret sharing

Procedia PDF Downloads 407
1172 VDGMSISS: A Verifiable and Detectable Multi-Secret Images Sharing Scheme with General Access Structure

Authors: Justie Su-Tzu Juan, Ming-Jheng Li, Ching-Fen Lee, Ruei-Yu Wu

Abstract:

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.

Keywords: multi-secret image sharing scheme, verifiable, de-tectable, general access structure

Procedia PDF Downloads 125
1171 A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based on Bipartite Graphs of Larger Girth

Authors: Hui-Chuan Lu

Abstract:

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.

Keywords: secret-sharing scheme, average information ratio, star covering, deduction, core cluster

Procedia PDF Downloads 361
1170 Secret Sharing in Visual Cryptography Using NVSS and Data Hiding Techniques

Authors: Misha Alexander, S. B. Waykar

Abstract:

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.

Keywords: decryption, encryption, natural visual secret sharing, natural images, noisy share, pixel swapping

Procedia PDF Downloads 404
1169 Minimum Vertices Dominating Set Algorithm for Secret Sharing Scheme

Authors: N. M. G. Al-Saidi, K. A. Kadhim, N. A. Rajab

Abstract:

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.

Keywords: secret sharing scheme, dominating set, information rate, access structure, rank

Procedia PDF Downloads 392
1168 Generalization of Blom Key Predistribution Scheme

Authors: Abbas Cheraghi

Abstract:

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.

Keywords: key predistribution, blom’s scheme, secret sharing, unconditional secure

Procedia PDF Downloads 435
1167 Lossless Secret Image Sharing Based on Integer Discrete Cosine Transform

Authors: Li Li, Ahmed A. Abd El-Latif, Aya El-Fatyany, Mohamed Amin

Abstract:

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.

Keywords: secret image sharing, integer DCT, lossless recovery, sensitivity

Procedia PDF Downloads 397
1166 A Novel Approach of Secret Communication Using Douglas-Peucker Algorithm

Authors: R. Kiruthika, A. Kannan

Abstract:

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.

Keywords: steganography, lsb, embedding, Douglas-Peucker algorithm

Procedia PDF Downloads 363
1165 Secure Message Transmission Using Meaningful Shares

Authors: Ajish Sreedharan

Abstract:

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.

Keywords: visual cryptography, wavelet transform, meaningful shares, grey scale image

Procedia PDF Downloads 455
1164 Image Encryption Using Eureqa to Generate an Automated Mathematical Key

Authors: Halima Adel Halim Shnishah, David Mulvaney

Abstract:

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.

Keywords: image encryption algorithms, Eureqa, statistical measurements, automated key generation

Procedia PDF Downloads 481
1163 The Effect of Supply Chain Integration on Information Sharing

Authors: Khlif Hamadi

Abstract:

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.

Keywords: supply chain integration, supply chain management, information sharing, supply chain performance

Procedia PDF Downloads 259
1162 Modeling Salam Contract for Profit and Loss Sharing

Authors: Dchieche Amina, Aboulaich Rajae

Abstract:

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.

Keywords: Islamic finance, shariah compliance, profi t and loss sharing, derivatives, risks, hedging, salam contract

Procedia PDF Downloads 332
1161 Cars Redistribution Optimization Problem in the Free-Float Car-Sharing

Authors: Amine Ait-Ouahmed, Didier Josselin, Fen Zhou

Abstract:

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.

Keywords: one-way car-sharing, vehicle redistribution, car reservation, linear programming

Procedia PDF Downloads 345
1160 Research and Development of Net-Centric Information Sharing Platform

Authors: Wang Xiaoqing, Fang Youyuan, Zheng Yanxing, Gu Tianyang, Zong Jianjian, Tong Jinrong

Abstract:

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.

Keywords: net-centric environment, information sharing, metadata registry and catalog, cross-domain data access control

Procedia PDF Downloads 568
1159 Uses and Gratification with the Website Secret-thai.com

Authors: Siriporn Meenanan

Abstract:

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.

Keywords: uses and gratification, website, Secret-Thai.com, moral contents

Procedia PDF Downloads 232
1158 Knowledge Sharing and Organizational Performance: A System Dynamics Approach

Authors: Shachi Pathak

Abstract:

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.

Keywords: knowledge management, knowledge sharing, organizational performance, system dynamics

Procedia PDF Downloads 373
1157 Knowledge and Information Sharing in the Opinion of the Polish Academic Community

Authors: Marzena Świgoń

Abstract:

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.

Keywords: academics, information sharing, knowledge sharing, scholarly communication

Procedia PDF Downloads 410
1156 Organizational Climate being Knowledge Sharing Oriented: A Fuzzy-Set Analysis

Authors: Paulo Lopes Henriques, Carla Curado

Abstract:

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.

Keywords: fsQCA, knowledge sharing oriented organizational climate, knowledge sharing costs, knowledge sharing incentives

Procedia PDF Downloads 327
1155 Knowledge Sharing within a Team: Exploring the Antecedents and Role of Trust

Authors: Li Yan Hei, Au Wing Tung

Abstract:

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.

Keywords: knowledge sharing, project management, team, trust

Procedia PDF Downloads 616
1154 Influence Analysis of Profit Sharing Agreement and Financing Risk to Profitability in Islamic Bank of Indonesia

Authors: Irena Paramita Pramono

Abstract:

Islamic bank is a financial industry with huge potential to grow in Indonesia. Profit-sharing agreement in the operations of Islamic banks distinguishes Islamic banks with conventional banks. Profit-sharing agreement allows sharing of benefits and risks between shahibul maal and mudharib in islamic bank. This study aimed to observe the patterns of influence between the risk-sharing agreement, financing risk and Profitability in Islamic banks. This research used several Islamic banks as sample and path analysis method. The empirical results of this research shows that the profit-sharing agreement in deposits structure has no direct significant effect to ROA, but it has indirect effect to ROA through profit-sharing financing. On the other hand, profit-sharing financing has direct and indirect influence to ROA through financing risk. This research shows that profit-sharing financing has a positive significant effect to the financing risk and also to the ROA. The research recommends Islamic banks to continue using and developing profit-sharing agreement in its operational activities, hence to create value.

Keywords: Islamic bank, profit-loss sharing agreement, financing risk, profitability

Procedia PDF Downloads 807
1153 High Secure Data Hiding Using Cropping Image and Least Significant Bit Steganography

Authors: Khalid A. Al-Afandy, El-Sayyed El-Rabaie, Osama Salah, Ahmed El-Mhalaway

Abstract:

This paper presents a high secure data hiding technique using image cropping and Least Significant Bit (LSB) steganography. The predefined certain secret coordinate crops will be extracted from the cover image. The secret text message will be divided into sections. These sections quantity is equal the image crops quantity. Each section from the secret text message will embed into an image crop with a secret sequence using LSB technique. The embedding is done using the cover image color channels. Stego image is given by reassembling the image and the stego crops. The results of the technique will be compared to the other state of art techniques. Evaluation is based on visualization to detect any degradation of stego image, the difficulty of extracting the embedded data by any unauthorized viewer, Peak Signal-to-Noise Ratio of stego image (PSNR), and the embedding algorithm CPU time. Experimental results ensure that the proposed technique is more secure compared with the other traditional techniques.

Keywords: steganography, stego, LSB, crop

Procedia PDF Downloads 268
1152 Symmetric Arabic Language Encryption Technique Based on Modified Playfair Algorithm

Authors: Fairouz Beggas

Abstract:

Due to the large number of exchanges in the networks, the security of communications is essential. Most ways of keeping communication secure rely on encryption. In this work, a symmetric encryption technique is offered to encrypt and decrypt simple Arabic scripts based on a multi-level security. A proposed technique uses an idea of Playfair encryption with a larger table size and an additional layer of encryption to ensure more security. The idea of the proposed algorithm aims to generate a dynamic table that depends on a secret key. The same secret key is also used to create other secret keys to over-encrypt the plaintext in three steps. The obtained results show that the proposed algorithm is faster in terms of encryption/decryption speed and can resist to many types of attacks.

Keywords: arabic data, encryption, playfair, symmetric algorithm

Procedia PDF Downloads 86
1151 Benefit Sharing of Research Participants in Human Genomic Research: Ethical Concerns and Ramifications

Authors: Tamanda Kamwendo

Abstract:

The concept of benefit sharing has been a prominent global debate in the world, gaining traction in human research ethics. Despite its prevalence, the concept of benefit sharing is not without controversy over its meaning and justification. This is due to the fact that it lacks a broadly accepted definition and many proponents discuss benefit sharing by arguing for its necessity rather than engaging in critical intellectual engagement with technical issues such as what it implies. What is clear in the literature is that the underlying premise of benefit-sharing is that research involving underprivileged and marginalized people is currently unjust and inequitable because these people are denied access to these gains; thus, benefit-sharing arrangements are required for these research projects to be just and equitable. This paper, therefore, investigates the discourses and justifications behind the concept of benefit sharing to human participants, particularly when dealing with human genomics research. Furthermore, considering that benefit sharing is generally viewed as a transaction between research organizations and research participants, it raises ethical concerns concerning the commodification of human material and undermines the sanctity of the human genome. This is predicated on the idea that research sponsors would be compelled to deliver a minimum set of possible benefits to research participants and communities in exchange for their involvement in the study. There is, therefore, need to protect benefit-sharing practices in international health research by developing a governance legal framework. A legal framework of benefit sharing will also dispel the issue of commodification of human material where human genomic research is done.

Keywords: benefit sharing, human participants, human genomic research, ethical concerns

Procedia PDF Downloads 76
1150 Investigating the Interaction of Individuals' Knowledge Sharing Constructs

Authors: Eugene Okyere-Kwakye

Abstract:

Knowledge sharing is a practice where individuals commonly exchange both tacit and explicit knowledge to jointly create a new knowledge. Knowledge management literature vividly express that knowledge sharing is the keystone and perhaps it is the most important aspect of knowledge management. To enhance the understanding of knowledge sharing domain, this study is aimed to investigate some factors that could influence employee’s attitude and behaviour to share their knowledge. The researchers employed the social exchange theory as a theoretical foundation for this study. Three essential factors namely: Trust, mutual reciprocity and perceived enjoyment that could influence knowledge sharing behaviour has been incorporated into a research model. To empirically validate this model, data was collected from one hundred and twenty respondents. The multiple regression analysis was employed to analyse the data. The results indicate that perceived enjoyment and trust have a significant influence on knowledge sharing. Surprisingly, mutual reciprocity did not influence knowledge sharing. The paper concludes by highlight the practical implications of the findings and areas for future research to consider.

Keywords: perceived enjoyment, trust, knowledge sharing, knowledge management

Procedia PDF Downloads 446
1149 Moderating Role of Positive External Factors in Relationship of Abusive Supervision and Knowledge Sharing

Authors: I.Hussain, A. Gulzar

Abstract:

Knowledge sharing is very important in organizations for their future progress and survival. This study investigates the impact of destructive leadership (abusive supervision) on knowledge sharing in employees. Further, the authors want to investigate a context variable (group cohesion) and explore its cross level influence on the relationship of abusive supervision and knowledge sharing. Conservation of resource theory (COR) claims loss of psychological capital (an internal positive resource) in employees due to abusive supervision and hence decrease occurs in knowledge sharing. This study tests psychological capital as mediator and group cohesion as moderator in relationship of abusive supervision and knowledge sharing. Data was collected from 239 respondents from more than 40 different organizations and 50 different groups from all over Pakistan. Results show that abusive supervision has negative effect on knowledge sharing through reduction in psychological capital of employees, and increased group cohesion in employees reduces this negative effect improving psychological capital in employees.

Keywords: abusive supervision, knowledge sharing, psychological capital, group cohesion, conservation of resources

Procedia PDF Downloads 215
1148 The Impact of Motivation, Trust, and National Cultural Differences on Knowledge Sharing within the Context of Electronic Mail

Authors: Said Abdullah Al Saifi

Abstract:

The goal of this research is to examine the impact of trust, motivation, and national culture on knowledge sharing within the context of electronic mail. This study is quantitative and survey based. In order to conduct the research, 200 students from a leading university in New Zealand were chosen randomly to participate in a questionnaire survey. Motivation and trust were found to be significantly and positively related to knowledge sharing. The research findings illustrated that face saving, face gaining, and individualism positively moderates the relationship between motivation and knowledge sharing. In addition, collectivism culture negatively moderates the relationship between motivation and knowledge sharing. Moreover, the research findings reveal that face saving, individualism, and collectivism culture positively moderate the relationship between trust and knowledge sharing. In addition, face gaining culture negatively moderates the relationship between trust and knowledge sharing. This study sets out several implications for researchers and practitioners. The study produces an integrative model that shows how attributes of national culture impact knowledge sharing through the use of emails. A better understanding of the relationship between knowledge sharing and trust, motivation, and national culture differences will increase individuals’ ability to make wise choices when sharing knowledge with those from different cultures.

Keywords: knowledge sharing, motivation, national culture, trust

Procedia PDF Downloads 347
1147 Antecedents of Knowledge Sharing: Investigating the Influence of Knowledge Sharing Factors towards Postgraduate Research Supervision

Authors: Arash Khosravi, Mohamad Nazir Ahmad

Abstract:

Today’s economy is a knowledge-based economy in which knowledge is a crucial facilitator to individuals, as well as being an instigator of success. Due to the impact of globalization, universities face new challenges and opportunities. Accordingly, they ought to be more innovative and have their own competitive advantages. One of the most important goals of universities is the promotion of students as professional knowledge workers. Therefore, knowledge sharing and transferring at tertiary level between students and supervisors is vital in universities, as it decreases the budget and provides an affordable way of doing research. Knowledge-sharing impact factors can be categorized into three groups, namely: organizational, individual and technical factors. There are some individual barriers to knowledge sharing, namely: lack of time and trust, lack of communication skills and social networks. IT systems such as e-learning, blogs and portals can increase knowledge sharing capability. However, it must be stated that IT systems are only tools and not solutions. Individuals are still responsible for sharing information and knowledge. This paper proposes new research model to examine the effect of individual factors and organisational factors, namely: learning strategy, trust culture, supervisory support, as well as technological factor on knowledge sharing in a research supervision process at the University of Technology Malaysia.

Keywords: knowledge management, knowledge sharing, research supervision, knowledge transferring

Procedia PDF Downloads 444