Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol

Ren Chunyang; Wang Hongyuan; Zhang Zijian; Liao Lejian

doi:10.1007/978-3-642-26007-0_3

Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol

Ren Chunyang^*, Wang Hongyuan, Zhang Zijian, Liao Lejian

^*Corresponding author for this work

School of Cyberspace Science and Technology

Beijing Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) for mutual authentication and key exchange protocols automatically without sacrificing the soundness of the cryptography. We want to extend their work to analyze group key exchange protocols. This paper takes the case of BD protocol with arbitrary participants against passive adversary (BD-Passive), and proves that BD-Passive is a secure group key exchange protocol. More specially, we (1) define the ideal functionality of BD-Passive; (2) prove the security property of BD-Passive in UC security framework by UCSA. Obviously, our work plays a new approach to prove group key exchange protocols automatically without sacrificing the soundness of the cryptography.

Original language	English
Title of host publication	Advances in Control and Communication
Pages	17-20
Number of pages	4
DOIs	https://doi.org/10.1007/978-3-642-26007-0_3
Publication status	Published - 2012
Event	2nd International Conference of Electrical and Electronics Engineering, ICEEE 2011 - Macau, China Duration: 1 Dec 2011 → 2 Dec 2011

Publication series

Name	Lecture Notes in Electrical Engineering
Volume	137 LNEE
ISSN (Print)	1876-1100
ISSN (Electronic)	1876-1119

Conference

Conference	2nd International Conference of Electrical and Electronics Engineering, ICEEE 2011
Country/Territory	China
City	Macau
Period	1/12/11 → 2/12/11

Keywords

Burmester-Desmedt protocol
Ideal Functionality
Universally Composable
Universally Composable Symbolic Analysis

Access to Document

10.1007/978-3-642-26007-0_3

Cite this

@inproceedings{2a13896d599b457d9e78bf4921e74990,

title = "Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol",

abstract = "Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) for mutual authentication and key exchange protocols automatically without sacrificing the soundness of the cryptography. We want to extend their work to analyze group key exchange protocols. This paper takes the case of BD protocol with arbitrary participants against passive adversary (BD-Passive), and proves that BD-Passive is a secure group key exchange protocol. More specially, we (1) define the ideal functionality of BD-Passive; (2) prove the security property of BD-Passive in UC security framework by UCSA. Obviously, our work plays a new approach to prove group key exchange protocols automatically without sacrificing the soundness of the cryptography.",

keywords = "Burmester-Desmedt protocol, Ideal Functionality, Universally Composable, Universally Composable Symbolic Analysis",

author = "Ren Chunyang and Wang Hongyuan and Zhang Zijian and Liao Lejian",

year = "2012",

doi = "10.1007/978-3-642-26007-0\_3",

language = "English",

isbn = "9783642260063",

series = "Lecture Notes in Electrical Engineering",

pages = "17--20",

booktitle = "Advances in Control and Communication",

note = "2nd International Conference of Electrical and Electronics Engineering, ICEEE 2011 ; Conference date: 01-12-2011 Through 02-12-2011",

}

Chunyang, R, Hongyuan, W, Zijian, Z & Lejian, L 2012, Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol. in Advances in Control and Communication. Lecture Notes in Electrical Engineering, vol. 137 LNEE, pp. 17-20, 2nd International Conference of Electrical and Electronics Engineering, ICEEE 2011, Macau, China, 1/12/11. https://doi.org/10.1007/978-3-642-26007-0_3

Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol. / Chunyang, Ren; Hongyuan, Wang; Zijian, Zhang et al.
Advances in Control and Communication. 2012. p. 17-20 (Lecture Notes in Electrical Engineering; Vol. 137 LNEE).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Automatic security analysis for group key exchange protocol

T2 - 2nd International Conference of Electrical and Electronics Engineering, ICEEE 2011

AU - Chunyang, Ren

AU - Hongyuan, Wang

AU - Zijian, Zhang

AU - Lejian, Liao

PY - 2012

Y1 - 2012

N2 - Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) for mutual authentication and key exchange protocols automatically without sacrificing the soundness of the cryptography. We want to extend their work to analyze group key exchange protocols. This paper takes the case of BD protocol with arbitrary participants against passive adversary (BD-Passive), and proves that BD-Passive is a secure group key exchange protocol. More specially, we (1) define the ideal functionality of BD-Passive; (2) prove the security property of BD-Passive in UC security framework by UCSA. Obviously, our work plays a new approach to prove group key exchange protocols automatically without sacrificing the soundness of the cryptography.

AB - Canetti and Herzog have already proposed universally composable symbolic analysis (UCSA) for mutual authentication and key exchange protocols automatically without sacrificing the soundness of the cryptography. We want to extend their work to analyze group key exchange protocols. This paper takes the case of BD protocol with arbitrary participants against passive adversary (BD-Passive), and proves that BD-Passive is a secure group key exchange protocol. More specially, we (1) define the ideal functionality of BD-Passive; (2) prove the security property of BD-Passive in UC security framework by UCSA. Obviously, our work plays a new approach to prove group key exchange protocols automatically without sacrificing the soundness of the cryptography.

KW - Burmester-Desmedt protocol

KW - Ideal Functionality

KW - Universally Composable

KW - Universally Composable Symbolic Analysis

UR - https://www.scopus.com/pages/publications/84856151513

U2 - 10.1007/978-3-642-26007-0_3

DO - 10.1007/978-3-642-26007-0_3

M3 - Conference contribution

AN - SCOPUS:84856151513

SN - 9783642260063

T3 - Lecture Notes in Electrical Engineering

SP - 17

EP - 20

BT - Advances in Control and Communication

Y2 - 1 December 2011 through 2 December 2011

ER -

Automatic security analysis for group key exchange protocol: A case study in Burmester-Desmedt protocol

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this