141 research outputs found
Adaptive trust and reputation system as a security service in group communications
Group communications has been facilitating many emerging applications which require packet delivery from one or more sender(s) to multiple receivers. Owing to the multicasting and broadcasting nature, group communications are susceptible to various kinds of attacks. Though a number of proposals have been reported to secure group communications, provisioning security in group communications remains a critical and challenging issue.
This work first presents a survey on recent advances in security requirements and services in group communications in wireless and wired networks, and discusses challenges in designing secure group communications in these networks. Effective security services to secure group communications are then proposed. This dissertation also introduces the taxonomy of security services, which can be applied to secure group communications, and evaluates existing secure group communications schemes.
This dissertation work analyzes a number of vulnerabilities against trust and reputation systems, and proposes a threat model to predict attack behaviors. This work also considers scenarios in which multiple attacking agents actively and collaboratively attack the whole network as well as a specific individual node. The behaviors may be related to both performance issues and security issues. Finally, this work extensively examines and substantiates the security of the proposed trust and reputation system.
This work next discusses the proposed trust and reputation system for an anonymous network, referred to as the Adaptive Trust-based Anonymous Network (ATAN). The distributed and decentralized network management in ATAN does not require a central authority so that ATAN alleviates the problem of a single point of failure. In ATAN, the trust and reputation system aims to enhance anonymity by establishing a trust and reputation relationship between the source and the forwarding members. The trust and reputation relationship of any two nodes is adaptive to new information learned by these two nodes or recommended from other trust nodes. Therefore, packets are anonymously routed from the \u27trusted\u27 source to the destination through \u27trusted\u27 intermediate nodes, thereby improving anonymity of communications. In the performance analysis, the ratio of the ATAN header and data payload is around 0.1, which is relatively small.
This dissertation offers analysis on security services on group communications. It illustrates that these security services are needed to incorporate with each other such that group communications can be secure. Furthermore, the adaptive trust and reputation system is proposed to integrate the concept of trust and reputation into communications. Although deploying the trust and reputation system incurs some overheads in terms of storage spaces, bandwidth and computation cycles, it shows a very promising performance that enhance users\u27 confidence in using group communications, and concludes that the trust and reputation system should be deployed as another layer of security services to protect group communications against malicious adversaries and attacks
Implementation of homomorphic encryption technique
Fully homomorphic encryption has long been viewed as cryptography’s prized ”holy grail” amazingly helpful yet rather subtle. Starting from the breakthrough invention of FHE in 2009 by Craig Gentry, numerous schemes are presented then by various authors following the Gentry’s blueprint. We discuss the basic homomorphic encryption given by the DGHV over the integers. It is modification of the Gentry’s scheme which is based on the ideal lattices. The main idea of the DGHV scheme is its simplicity for the arithmetic operations. Our plan is to reduce the size of the public key which ultimately reduces the space complexity of the algorithm. We then further introduces the concept of the approximate common divisor problem on the DGHV scheme. We propose the GACD attack over the modulus switching and public key compression technique of DGHV scheme. The overall contribution of this work is analysis, design and performance of the scheme
Computational Aspects of Retrieving a Representation of an Algebraic Geometry Code
Producción CientíficaCode-based cryptography is an interesting alternative to classic number-theoretic public key cryptosystem since it is conjectured to be secure against quantum computer attacks. Many families of codes have been proposed for these cryptosystems such as algebraic geometry codes. In [Designs, Codes and Cryptography, pages 1-16, 2012] -for so called very strong algebraic geometry codes , where is an algebraic curve over , is an -tuple of mutually distinct -rational points of and is a divisor of with disjoint support from --- it was shown that an equivalent representation can be found. The -tuple of points is obtained directly from a generator matrix of , where the columns are viewed as homogeneous coordinates of these points. The curve is given by , the homogeneous elements of degree of the vanishing ideal . Furthermore, it was shown that can be computed efficiently as the kernel of certain linear map. What was not shown was how to get the divisor and how to obtain efficiently an adequate decoding algorithm for the new representation. The main result of this paper is an efficient computational approach to the first problem, that is getting . The security status of the McEliece public key cryptosystem using algebraic geometry codes is still not completely settled and is left as an open problemThis research was partly supported by the Danish National Research Foundation and the National Science Foundation of China (Grant No.\ 11061130539) for the Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography and by Spanish grants MTM2007-64704, MTM2010-21580-C02-02 and MTM2012-36917-C03-03. Part of the research of the second author is also funded by the Vernon Wilson Endowed Chair at Eastern Kentucky University during his sabbatical leave
Key Management Systems for Smart Grid Advanced Metering Infrastructure: A Survey
Smart Grids are evolving as the next generation power systems that involve
changes in the traditional ways of generation, transmission and distribution of
power. Advanced Metering Infrastructure (AMI) is one of the key components in
smart grids. An AMI comprises of systems and networks, that collects and
analyzes data received from smart meters. In addition, AMI also provides
intelligent management of various power-related applications and services based
on the data collected from smart meters. Thus, AMI plays a significant role in
the smooth functioning of smart grids.
AMI is a privileged target for security attacks as it is made up of systems
that are highly vulnerable to such attacks. Providing security to AMI is
necessary as adversaries can cause potential damage against infrastructures and
privacy in smart grid. One of the most effective and challenging topic's
identified, is the Key Management System (KMS), for sustaining the security
concerns in AMI. Therefore, KMS seeks to be a promising research area for
future development of AMI. This survey work highlights the key security issues
of advanced metering infrastructures and focuses on how key management
techniques can be utilized for safeguarding AMI. First of all, we explore the
main features of advanced metering infrastructures and identify the
relationship between smart grid and AMI. Then, we introduce the security issues
and challenges of AMI. We also provide a classification of the existing works
in literature that deal with secure key management system in AMI. Finally, we
identify possible future research directions of KMS in AMI
Fault tolerant Medical Network (MEDNET)
This investigation describes the development of a new fault tolerant Medical Network (MEDNET) model based on the existing Public Switch Telephone Network (PSTN), Integrated Services Digital Network (ISDN) and Intemetworking (Internet). This research includes the original design, development and testing of the required hardware and software interfaces to provide a complete Medical Network model. MEDNET ties the Doctor, the Patient, the Hospital, the Medical Lab, and the Pharmacy for near real time and fault tolerant exchange of medical information. The MEDNET model includes the following modules: 1 Central Database Server, 2. Remote Client Access, and 3. Communication Interface. This work proves that medical images and data can be exchanged between healthcare providers which are not geographically adjacent, in a cost effective, timely, and secure manne
- …