View : 638 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.advisor이향숙-
dc.contributor.author안영주-
dc.creator안영주-
dc.date.accessioned2016-08-25T10:08:58Z-
dc.date.available2016-08-25T10:08:58Z-
dc.date.issued2010-
dc.identifier.otherOAK-000000060413-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/185901-
dc.identifier.urihttp://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000060413-
dc.description.abstractIn Public Key Cryptography, one of active research areas is to develop efficient signature schemes with tight security reduction. The security proof of signature scheme involves with some hard problems in mathematics. Variations of Diffie-Hellman problems(DHP) are most frequently considered as hard problems in public key cryptography. In this paper, we studied some known results on relations among several variations of DHP. And we studied some known signature schemes based on Computational Diffie-Hellman Problem(CDHP). We also present a modification of Waters signature scheme. Our signature scheme is efficient by reducing the public key size almost in half compare to Waters signature scheme. The security of our scheme is based on Square Computational Diffie-Hellman Problem(SCDHP) which is equivalent to CDHP.;암호학에서는 tight security reduction을 가지면서 효율적인 서명 scheme에 대한 연구가 활발하게 이루어지고 있다. 그리고 안전성의 기반이 되는 hard problem 중에는 Diffie-Hellman Problem(DHP)이 있다. 이 논문에서는 여러 종류의 DHP들에 대한 상관관계에 대해 분석 한 기존의 결과들을 정리하고, 그 중 가장 기본적인 난제에 속하는 Computational Diffie-Hellman Problem(CDHP)에 기반한 서명기법들과 그 안전성 증명방법들을 살펴본다. 또한 CDHP 기반의 서명 scheme인 Waters scheme의 공개키 사이즈를 줄인 변형 scheme을 제안한다. 본 논문에서 제안하는 서명기법은 Square Computational Diffie-Hellman Problem (SCDHP) 기반에서 안전성을 가지면서 공개키의 사이즈를 Waters scheme에 비해 절반으로 줄여서 효율성이 향상되었다.-
dc.description.tableofcontents1. Introduction 1 2. Variations of Computational Diffie-Hellman Problem 2 2.1. On the Equivalence of CDH Problems 2 2.1.1. Equivalence between CDH and SCDH 2 2.1.2. On the q-Strong Diffie-Hellman Problem 4 3. Signature Schemes and Security 5 3.1. Signature Schemes 5 3.2. Chameleon Hashes 5 3.3. Weakly-Secure and Fully-Seure signatures 6 4. Signature Schemes Based on the CDH Problem 8 4.1. Goh, Jarecki, Katz and Wang's Scheme 8 4.2. The Waters Signature 12 4.2.1. The Waters Signature 12 4.2.2. Proof of Security 12 4.2.3. Fully-Secure CDH Signature 15 5. A SCDH-Based Construction 15 5.1. A Variation of Waters Signature 16 5.2. Analysis of Our Scheme 17 5.2.1. Proof of Security 17 5.2.2. Efficiency of Our Scheme 20 5.3. Fully-Secure SCDH Signature 20 6. Conclusions and Open Problems 21 References 22 국문초록 24-
dc.formatapplication/pdf-
dc.format.extent525828 bytes-
dc.languageeng-
dc.publisher이화여자대학교 대학원-
dc.titleReducing the Public Key Size of Waters Signature using the Hardness of SCDH-
dc.typeMaster's Thesis-
dc.format.pageii, 24 p.-
dc.identifier.thesisdegreeMaster-
dc.identifier.major대학원 수학과-
dc.date.awarded2010. 8-
Appears in Collections:
일반대학원 > 수학과 > Theses_Master
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE