1,758 research outputs found

    Non-transferable unidirectional proxy re-encryption scheme for secure social cloud storage sharing

    Get PDF
    (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Proxy re-encryption (PRE), introduced by Blaze et al. in 1998, allows a semi-trusted proxy with the re-encryption key to translatea ciphertext under the delegator into another ciphertext, which can be decrypted by the delegatee. In this process, the proxy is required to know nothing about the plaintext. Many PRE schemes have been proposed so far, however until now almost all the unidirectional PRE schemes suffer from the transferable property. That is, if the proxy and a set of delegatees collude, they can re-delegate the delegator's decryption rights to the other ones, while the delegator has no agreement on this. Thus designing non-transferable unidirectional PRE scheme is an important open research problem in the field. In this paper, we tackle this open problem by using the composite order bilinear pairing. Concretely, we design a non-transferable unidirectional PRE scheme based on Hohenberger et al.'s unidirectional PRE scheme. Furthermore, we discuss our scheme's application to secure cloud storage, especially for sharing private multimedia content for social cloud storage users.Peer ReviewedPostprint (author's final draft

    Identity based proxy re-encryption scheme (IBPRE+) for secure cloud data sharing

    Get PDF
    (c) 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.In proxy re-encryption (PRE), a proxy with re-encryption keys can transfer aciphertext computed under Alice's public key into a new one, which can be decrypted by Bob only with his secret key. Recently, Wang et al. introduced the concept of PRE plus (PRE+) scheme, which can be seen as the dual of PRE, and is almost the same as PRE scheme except that the re-encryption keys are generated by the encrypter. Compared to PRE, PRE+ scheme can easily achieve two important properties: first, the message-level based fine-grained delegation and, second, the non-transferable property. In this paper, we extend the concept of PRE+ to the identity based setting. We propose a concrete IBPRE+ scheme based on 3-linear map and roughly discuss its properties. We also demonstrate potential application of this new primitive to secure cloud data sharing.Peer ReviewedPostprint (author's final draft

    Secure and energy-efficient multicast routing in smart grids

    Get PDF
    A smart grid is a power system that uses information and communication technology to operate, monitor, and control data flows between the power generating source and the end user. It aims at high efficiency, reliability, and sustainability of the electricity supply process that is provided by the utility centre and is distributed from generation stations to clients. To this end, energy-efficient multicast communication is an important requirement to serve a group of residents in a neighbourhood. However, the multicast routing introduces new challenges in terms of secure operation of the smart grid and user privacy. In this paper, after having analysed the security threats for multicast-enabled smart grids, we propose a novel multicast routing protocol that is both sufficiently secure and energy efficient.We also evaluate the performance of the proposed protocol by means of computer simulations, in terms of its energy-efficient operation

    Options for Securing RTP Sessions

    Get PDF
    The Real-time Transport Protocol (RTP) is used in a large number of different application domains and environments. This heterogeneity implies that different security mechanisms are needed to provide services such as confidentiality, integrity, and source authentication of RTP and RTP Control Protocol (RTCP) packets suitable for the various environments. The range of solutions makes it difficult for RTP-based application developers to pick the most suitable mechanism. This document provides an overview of a number of security solutions for RTP and gives guidance for developers on how to choose the appropriate security mechanism

    Securing Restricted Publisher-Subscriber Communications in Smart Grid Substations

    Get PDF
    Smart Grid applications require accurate and correct data transmission from publisher to subscribers with critical communication latency requirements. Since the smart grid is being supported by distributed communication networks, deployed using various wired and wireless technologies, including IP-based networks, securing the communication infrastructure is both critically important and challenging. In this paper, we propose a secure and efficient data delivery scheme, based on a restricted yet dynamic publisher-subscriber architecture, for the published messages from a publisher to the subscribers distributed in the smart grid network. The scheme ensures that the published message is delivered from an authentic publisher to only those authorized subscribers by verifying publisher's signature and access structure of all subscribers. Operation overheads are reduced by performing only one encryption and decryption or hashing per subscriber location using a proxy node as a remote terminal unit. Our analysis shows that the scheme is resistant against replay, man-in-the-middle, and impersonation attacks. Performance evaluation shows that the scheme can support 600 subscribers given the communication latency requirement of 3 ms. We provide the performance of the scheme under different scenarios, and observe that the efficiency of our scheme increases as the ratio of the geographical locations within a substation to the number of subscribers increases

    MULTIMEDIA ON GEOGRAPHIC NETWORK

    Get PDF
    In this thesis we investigate the topic of the multimedia contents distribution on a geo- graphic network which is a rarefied and huge field. First of all we have to classify the main parts necessary in the multimedia distribution on a geographic network. The main aspects of a geographic network that will be highlighted in this thesis are: the mechanism used to retrieve the sources of the multimedia content; in the case of the peer-to-peer network on geographic network one of the most important mechanism is the query flooding protocol. The kind of overlay network (peer-to-peer) used to distribute the multimedia content. The usage of this overlay network in a multicast network. The security of the overlay network over a geographic network. Therefore the first topic which is investigated in this thesis is the query flooding protocol that can be used in any kind of query operation on a peer-to-peer network. For this protocol we achieve an analytical model through a complex analysis of the proxies network. In this analysis we can see how the proxies permit an improvement in the performance with respect to the routing operations in a generic network of routers. Moreover we address a simple formulation and framework about the performance of the network with and without layer 7 (proxy) and we apply them in three different types of scenarios to show the advantages achieved with the usage of proxies instead of routers. Through the query flooding operation, each peer of the peer-to-peer network can achieve the list of the peers that hold the desired multimedia content. In a multimedia content dis- tribution system, after the previous step in which the list of the peers that hold the desired multimedia content is retrieved, it is necessary to establish the kind of peer-to-peer network used to distribute this multimedia content to the peers that require it. Therefore the second aspect analysed in this thesis, is how the peer-to-peer network is built so that it is possible to provide the multimedia content to the vast majority of peers (that require this content) with the minimum delay. The construction of the peer-to-peer networks used for the distribution of the multimedia contents is not a very investigated field. Thus in this thesis we produce new algorithms used to build peer-to-peer networks in an incremental way on asymmetric and radio channel and we establish which algorithm is better with respect to the maximum delay of the network, the maximization of the number of peers accepted in the network and the minimization of the bit error probability of each peer of the peer-to-peer network. In this thesis, we propose an usage of the overlay network (peer-to-peer network) in a multicast network. We introduce an innovative mechanism that exploits the peer-to-peer network to make reliable a standard unreliable multicast network. Moreover we present an analytical model for this innovative mechanism. Finally the last aspect of a geographic network is the security of the communications among a group of peers. Thus to ensure the maximum level of security with secure commu- nications among a group of three or more peers, in this thesis we propose a new protocol, based on the Massey Omura protocol, which can allow the communications among the peers of a peer-to-peer network in a secure way. Moreover we present the security prob- lems of this Massey Omura Multiple Users Protocol and how it is possible to avoid these issues through a specific encryption function and a specific decryption function by chang- ing the encryption and decryption keys of each peer when the source peer changes. Finally we present a new cryptography protocol which we use to share the decryption shared key that is used in the Massey Omura Multiple Users Protocol
    • …
    corecore