Provable security of identity-based encryption-signature schemesID 기반 암호-서명기법 안전성 증명

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 492
  • Download : 0
After the advent of the concept of provable security, there have been lots of results proving the security of cryptographic schemes theoretically. However, the coverage of those proof is limited to a single scheme. This means that in practice, if somebody congures a combination of two or more schemes, such as encryption and signature, some security vulnerabilities that a scheme compromises the other schemes may happen. So far, there has been few results on a combination of existing cryptographic schemes. In this paper, we begin a rigorous study of the security of the combination of an encryption scheme and a signature scheme. We give a formal de finitions of the combination of those schemes which we call an encryption-signature (ES). As a variant we also consider an identity-based version which we call an identity-based encryption-signature (IDB-ES). We propose security models of these schemes. Assuming hash functions are random oracles, we prove the security of an IDB-ES scheme obtained by combining a practical identity-based encryption scheme of Boneh-Franklin and signature scheme of Cha-Cheon. Our IDB-ES scheme is secure if Bilinear Di e-Hellman Problem is intractable.
Advisors
Cha, Jae-Choon차재춘
Description
한국정보통신대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2006
Identifier
392653/225023 / 020044602
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2006, [ vi, 57 p. ]

Keywords

public key encryption; signature; 공개키 암호시스템; 전자서명; Provable security; 안전성 증명

URI
http://hdl.handle.net/10203/55473
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392653&flag=dissertation
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0