Articles producció científica> Enginyeria Informàtica i Matemàtiques

Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications

  • Datos identificativos

    Identificador: imarina:9282602
    Handle: https://hdl.handle.net/20.500.11797/imarina9282602
    Autores:
    Zhang, LeiWu, QianhongDomingo-Ferrer, JosepQin, BoDong, Zheming
    Resumen:
    Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k-bilinear Diffie-Hellman exponent assumption. © 2005-2012 IEEE.

  • Otros:

    Autor según el artículo: Zhang, Lei; Wu, Qianhong; Domingo-Ferrer, Josep; Qin, Bo; Dong, Zheming
    Departamento: Enginyeria Informàtica i Matemàtiques
    Autor/es de la URV: Domingo Ferrer, Josep
    Palabras clave: Secure group communications Secure communication Provably secure Network security Multisignature scheme Key management Identity-based cryptosystem Identity-based cryptography Identity based cryptography Group key agreement Dynamic groups Distributed computer systems Cryptography Communication security
    Resumen: Modern collaborative and group-oriented applications typically involve communications over open networks. Given the openness of today's networks, communications among group members must be secure and, at the same time, efficient. Group key agreement (GKA) is widely employed for secure group communications in modern collaborative and group-oriented applications. This paper studies the problem of GKA in identity-based cryptosystems with an emphasis on round-efficient, sender-unrestricted, member-dynamic, and provably secure key escrow freeness. The problem is resolved by proposing a one-round dynamic asymmetric GKA protocol which allows a group of members to dynamically establish a public group encryption key, while each member has a different secret decryption key in an identity-based cryptosystem. Knowing the group encryption key, any entity can encrypt to the group members so that only the members can decrypt. We construct this protocol with a strongly unforgeable stateful identity-based batch multisignature scheme. The proposed protocol is shown to be secure under the k-bilinear Diffie-Hellman exponent assumption. © 2005-2012 IEEE.
    Áreas temáticas: Safety, risk, reliability and quality Interdisciplinar Engineering, electrical & electronic Engenharias iv Engenharias iii Computer science, theory & methods Computer networks and communications Ciência da computação
    Acceso a la licencia de uso: https://creativecommons.org/licenses/by/3.0/es/
    Direcció de correo del autor: josep.domingo@urv.cat
    Identificador del autor: 0000-0001-7213-4962
    Fecha de alta del registro: 2024-10-12
    Versión del articulo depositado: info:eu-repo/semantics/submittedVersion
    URL Documento de licencia: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referencia al articulo segun fuente origial: Ieee Transactions On Information Forensics And Security. 10 (11): 2352-2364
    Referencia de l'ítem segons les normes APA: Zhang, Lei; Wu, Qianhong; Domingo-Ferrer, Josep; Qin, Bo; Dong, Zheming (2015). Round-Efficient and Sender-Unrestricted Dynamic Group Key Agreement Protocol for Secure Group Communications. Ieee Transactions On Information Forensics And Security, 10(11), 2352-2364. DOI: 10.1109/TIFS.2015.2447933
    Entidad: Universitat Rovira i Virgili
    Año de publicación de la revista: 2015
    Tipo de publicación: Journal Publications

  • Palabras clave:

    Computer Networks and Communications,Computer Science, Theory & Methods,Engineering, Electrical & Electronic,Safety, Risk, Reliability and Quality
    Secure group communications
    Secure communication
    Provably secure
    Network security
    Multisignature scheme
    Key management
    Identity-based cryptosystem
    Identity-based cryptography
    Identity based cryptography
    Group key agreement
    Dynamic groups
    Distributed computer systems
    Cryptography
    Communication security
    Safety, risk, reliability and quality
    Interdisciplinar
    Engineering, electrical & electronic
    Engenharias iv
    Engenharias iii
    Computer science, theory & methods
    Computer networks and communications
    Ciência da computação

  • Documentos:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar