• English
    • ไทย
  • English 
    • English
    • ไทย
  • Login
View Item 
  •   Wisdom Repository Home
  • คณะและวิทยาลัย
  • คณะสถิติประยุกต์
  • GSAS: Dissertations
  • View Item
  •   Wisdom Repository Home
  • คณะและวิทยาลัย
  • คณะสถิติประยุกต์
  • GSAS: Dissertations
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of Wisdom RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy Submit DateResource TypesThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Submit DateResource Types

My Account

Login

A dynamic asymmetric key agreement for broadcast encryption based on braid groups

by Norranut Saguansakdiyotin

Title:

A dynamic asymmetric key agreement for broadcast encryption based on braid groups

Author(s):

Norranut Saguansakdiyotin

Advisor:

Pipat Hiranvanichakorn

Degree name:

Doctor of Philosophy

Degree level:

Doctoral

Degree discipline:

Computer Science

Degree department:

School of Applied Statistics

Degree grantor:

National Institute of Development Administration

Issued date:

2012

Publisher:

National Institute of Development Administration

Abstract:

Broadcast encryption is the scheme that a sender encrypts messages for a designated group of receivers, and sends the ciphertexts by broadcasting over the networks. Many research papers have done it using elliptic curve cryptosystem. This research proposes a dynamic asymmetric key agreement protocols for the broadcast encryption which is based on braid groups cryptosystem, an alternative method in the public key cryptography in which it can reduce the computational cost. The proposed scheme is also used the concept of an identity-based cryptosystem in order to reduce a system complexity and cost for establishing and managing a public key authentication framework. The scheme has some advantages over the other scheme in that the proposed scheme does not require a center for group key management, thus it is suitable for dynamic networks like mobile ad hoc networks in which group members can be dynamically changed all the time. The scheme also has a low computation cost in encryption and decryption processes and it makes a constant ciphertext

Description:

Thesis (Ph.D. (Computer Science))--National Institute of Development Administration

Resource type:

Dissertation

Extent:

83 leaves

Type:

Text

File type:

application/pdf

Language:

eng

Rights:

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

URI:

http://repository.nida.ac.th/handle/662723737/733
Show full item record

Files in this item (CONTENT)

Thumbnail
View
  • b176348.pdf ( 1.28 MB )

ทรัพยากรสารสนเทศทั้งหมดในคลังปัญญา ใช้เพื่อประโยชน์ทางการเรียนการสอนและการค้นคว้าเท่านั้น และต้องมีการอ้างอิงแหล่งที่มาทุกครั้งที่นำไปใช้ ห้ามดัดแปลงเนื้อหา และทำสำเนาต่อ รวมถึงไม่ให้อนุญาตนำไปใช้ประโยชน์เพื่อการค้า ไม่ว่ากรณีใด ๆ ทั้งสิ้น



This item appears in the following Collection(s)

  • GSAS: Dissertations [166]

Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International license.

Copyright © National Institute of Development Administration | สถาบันบัณฑิตพัฒนบริหารศาสตร์
Library and Information Center | สำนักบรรณสารการพัฒนา
Email: NIDAWR@nida.ac.th    Chat: Facebook Messenger    Facebook: NIDAWisdomRepository
 

 

Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International license.

Copyright © National Institute of Development Administration | สถาบันบัณฑิตพัฒนบริหารศาสตร์
Library and Information Center | สำนักบรรณสารการพัฒนา
Email: NIDAWR@nida.ac.th    Chat: Facebook Messenger    Facebook: NIDAWisdomRepository
 

 

‹›×