Widespread use of sensors and multisensory personal devices generate a lot of personal informatio... more Widespread use of sensors and multisensory personal devices generate a lot of personal information. Sharing this information with others could help in various ways. However, this information may be misused when shared with all. Sharing of information between trusted parties overcomes this problem. This paper describes a model to share information based on interactions and opinions to build trust among peers. It also considers institutional and other controls, which influence the behaviour of the peers. The trust and control build confidence. The computed confidence bespeaks whether to reveal information or not thereby increasing trusted cooperation among peers
ACM Transactions on Database Systems ( …, Jan 1, 1988
This paper deals with the application of fuzzy logic in a relational database environment with th... more This paper deals with the application of fuzzy logic in a relational database environment with the objective of capturing more meaning of the data. It is shown that with suitable interpretations for the fuzzy membership functions, a fuzzy relational data model can be used to represent ambiguities in data values as well as impreciseness in the association among them. Relational operators for fuzzy relations have been studied, and applicability of fuzzy logic in capturing integrity constraints has been investigated. By introducing a fuzzy resemblance measure EQUAL for comparing domain values, the definition of classical functional dependency has been generalized to fuzzy functional dependency (ffd). The implication problem of ffds has been examined and a set of sound and complete inference axioms has been proposed. Next, the problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies is investigated. It is proved that with a suitable restriction on EQUAL, the design theory of a classical relational database with functional dependencies can be extended to fuzzy relations satisfying fuzzy functional dependencies. l 131 r = rl w r2 = (t ] t[XY] E rl and t[YZ] E r2] (2.2)
It is often necessary to join (naturally) two or more fuzzy relations to answer a user's query. H... more It is often necessary to join (naturally) two or more fuzzy relations to answer a user's query. However, the result of a join may not be what one expects. In this paper, we study the decomposition problem of fuzzy relation schemes. We show that the algorithm proposed by Aho et al. [1] to test lossless join decomposition for classical relations can be applied in the fuzzy domain when particularizations are induced by functional dependencies.
Trust plays a key role in each transaction in online peer-to-peer (P2P) communities. Transaction ... more Trust plays a key role in each transaction in online peer-to-peer (P2P) communities. Transaction based trust computation is an insufficient mechanism when the number of transactions is less. Reputation plays a major role when a peer transacts with other peers for the first time. Reputation computation which is very close to the reality is very important to all the online transactions. Several methods were proposed in the literature for reputation computation. The mechanism discussed in this paper offers a weighted feedback based reputation computation. In case, a malicious peer deceives by exaggerating or underrating the feedback, the method includes a dynamic corrective procedure, which forces a peer to give correct feedback. Thus, this mechanism attempts to solve the reputation computation problem with minimum overheads of storage and retrieval.
International Journal of Computer Theory …, Jan 1, 2010
The tremendous growth in the emerging technologies especially the increase in the bandwidth attra... more The tremendous growth in the emerging technologies especially the increase in the bandwidth attracting the researchers for the development of new network based applications. One of the popular applications among them is the group based applications. The group based applications like e-learning, conferencing, TV over Internet, interactive gaming etc gaining popularity and influencing the life of modern people. These group based are vulnerable to many attacks. Maintaining security in multicast applications is a challenging issue. The dynamic changes in the group membership with frequent joins and evictions are the prime factor which makes the security difficult in any group based applications. Key distribution and key management is the challenging issue with any of these applications. This paper describes two novel techniques for secure distribution of the group key. The techniques proposed in this paper makes use of the hybrid key trees which allow the complete elimination of the secure channels for the distribution of the key material unlike many of the earlier proposed schemes, minimum storage requirements at each member, elimination of the chances of generation of week keys, less number of rounds and minimum computational overhead.
Widespread use of sensors and multisensory personal devices generate a lot of personal informatio... more Widespread use of sensors and multisensory personal devices generate a lot of personal information. Sharing this information with others could help in various ways. However, this information may be misused when shared with all. Sharing of information between trusted parties overcomes this problem. This paper describes a model to share information based on interactions and opinions to build trust among peers. It also considers institutional and other controls, which influence the behaviour of the peers. The trust and control build confidence. The computed confidence bespeaks whether to reveal information or not thereby increasing trusted cooperation among peers
ACM Transactions on Database Systems ( …, Jan 1, 1988
This paper deals with the application of fuzzy logic in a relational database environment with th... more This paper deals with the application of fuzzy logic in a relational database environment with the objective of capturing more meaning of the data. It is shown that with suitable interpretations for the fuzzy membership functions, a fuzzy relational data model can be used to represent ambiguities in data values as well as impreciseness in the association among them. Relational operators for fuzzy relations have been studied, and applicability of fuzzy logic in capturing integrity constraints has been investigated. By introducing a fuzzy resemblance measure EQUAL for comparing domain values, the definition of classical functional dependency has been generalized to fuzzy functional dependency (ffd). The implication problem of ffds has been examined and a set of sound and complete inference axioms has been proposed. Next, the problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies is investigated. It is proved that with a suitable restriction on EQUAL, the design theory of a classical relational database with functional dependencies can be extended to fuzzy relations satisfying fuzzy functional dependencies. l 131 r = rl w r2 = (t ] t[XY] E rl and t[YZ] E r2] (2.2)
It is often necessary to join (naturally) two or more fuzzy relations to answer a user's query. H... more It is often necessary to join (naturally) two or more fuzzy relations to answer a user's query. However, the result of a join may not be what one expects. In this paper, we study the decomposition problem of fuzzy relation schemes. We show that the algorithm proposed by Aho et al. [1] to test lossless join decomposition for classical relations can be applied in the fuzzy domain when particularizations are induced by functional dependencies.
Trust plays a key role in each transaction in online peer-to-peer (P2P) communities. Transaction ... more Trust plays a key role in each transaction in online peer-to-peer (P2P) communities. Transaction based trust computation is an insufficient mechanism when the number of transactions is less. Reputation plays a major role when a peer transacts with other peers for the first time. Reputation computation which is very close to the reality is very important to all the online transactions. Several methods were proposed in the literature for reputation computation. The mechanism discussed in this paper offers a weighted feedback based reputation computation. In case, a malicious peer deceives by exaggerating or underrating the feedback, the method includes a dynamic corrective procedure, which forces a peer to give correct feedback. Thus, this mechanism attempts to solve the reputation computation problem with minimum overheads of storage and retrieval.
International Journal of Computer Theory …, Jan 1, 2010
The tremendous growth in the emerging technologies especially the increase in the bandwidth attra... more The tremendous growth in the emerging technologies especially the increase in the bandwidth attracting the researchers for the development of new network based applications. One of the popular applications among them is the group based applications. The group based applications like e-learning, conferencing, TV over Internet, interactive gaming etc gaining popularity and influencing the life of modern people. These group based are vulnerable to many attacks. Maintaining security in multicast applications is a challenging issue. The dynamic changes in the group membership with frequent joins and evictions are the prime factor which makes the security difficult in any group based applications. Key distribution and key management is the challenging issue with any of these applications. This paper describes two novel techniques for secure distribution of the group key. The techniques proposed in this paper makes use of the hybrid key trees which allow the complete elimination of the secure channels for the distribution of the key material unlike many of the earlier proposed schemes, minimum storage requirements at each member, elimination of the chances of generation of week keys, less number of rounds and minimum computational overhead.
Uploads
Papers by Raju KVSVN
Sharing this information with others could help in various ways. However, this information may be
misused when shared with all. Sharing of information between trusted parties overcomes this problem.
This paper describes a model to share information based on interactions and opinions to build trust
among peers. It also considers institutional and other controls, which influence the behaviour of the
peers. The trust and control build confidence. The computed confidence bespeaks whether to reveal
information or not thereby increasing trusted cooperation among peers
Sharing this information with others could help in various ways. However, this information may be
misused when shared with all. Sharing of information between trusted parties overcomes this problem.
This paper describes a model to share information based on interactions and opinions to build trust
among peers. It also considers institutional and other controls, which influence the behaviour of the
peers. The trust and control build confidence. The computed confidence bespeaks whether to reveal
information or not thereby increasing trusted cooperation among peers