DSpace at EWHA: A group key agreement protocol from pairings

View : 666 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	이향숙	-
dc.date.accessioned	2018-05-30T08:14:27Z	-
dc.date.available	2018-05-30T08:14:27Z	-
dc.date.issued	2005	-
dc.identifier.issn	0096-3003	-
dc.identifier.other	OAK-2952	-
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/243655	-
dc.description.abstract	We propose an n-round key agreement protocol for any N-participants, where 3n-1 &lt; N ≤ 3n, using the tripartite Joux key agreement protocol from pairings in combination with a divide-and-conquer strategy. The security of this protocol is based on the hardness of the bilinear Diffie-Hellman problem and the computational Diffie-Hellman problem. © 2004 Elsevier Inc. All rights reserved.	-
dc.language	English	-
dc.title	A group key agreement protocol from pairings	-
dc.type	Article	-
dc.relation.issue	2	-
dc.relation.volume	167	-
dc.relation.index	SCIE	-
dc.relation.index	SCOPUS	-
dc.relation.startpage	1451	-
dc.relation.lastpage	1456	-
dc.relation.journaltitle	Applied Mathematics and Computation	-
dc.identifier.doi	10.1016/j.amc.2004.08.011	-
dc.identifier.wosid	WOS:000232501200048	-
dc.identifier.scopusid	2-s2.0-25144470681	-
dc.author.google	Duursma I.	-
dc.author.google	Lee H.-S.	-
dc.contributor.scopusid	이향숙(34870017000)	-
dc.date.modifydate	20230411110859	-