Intrusion-Resilient Proxy Signature Schemes
碩士 === 國立交通大學 === 資訊科學系 === 91 === We proposed intrusion-resilient proxy signature schemes, which combine time bounded proxy signature schemes and signer-base intrusion-resilient signatures. First, we set up a home base that shares proxy parameters with the proxy signer, updates and refre...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/43582078892031670781 |
id |
ndltd-TW-091NCTU0394053 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-091NCTU03940532016-06-22T04:14:06Z http://ndltd.ncl.edu.tw/handle/43582078892031670781 Intrusion-Resilient Proxy Signature Schemes 可抵擋入侵的代理簽章系統 Ti-Wen Sun 孫荻雯 碩士 國立交通大學 資訊科學系 91 We proposed intrusion-resilient proxy signature schemes, which combine time bounded proxy signature schemes and signer-base intrusion-resilient signatures. First, we set up a home base that shares proxy parameters with the proxy signer, updates and refreshes the proxy signer’s key. Second, the original signer generates proxy parameters and then divides them into two parts. The first part of them is sent to the proxy signer and the second part is sent to the home base. The proxy signer and the home base check the validity of those parameters. If it is correct, they accept it; otherwise, they reject it. Before signing a message m, the proxy signer computes the proxy secret key with the home base’s help. After computing the proxy secret key, the signing and the verification stage are the same as those of time-bounded proxy signature schemes. We give two theorems to prove the security of our scheme by assuming hardness of the Strong-RSA problem. Wen-Guey Tzeng 曾文貴 2003 學位論文 ; thesis 43 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 資訊科學系 === 91 === We proposed intrusion-resilient proxy signature schemes, which combine time bounded proxy signature schemes and signer-base intrusion-resilient signatures. First, we set up a home base that shares proxy parameters with the proxy signer, updates and refreshes the proxy signer’s key. Second, the original signer generates proxy parameters and then divides them into two parts. The first part of them is sent to the proxy signer and the second part is sent to the home base. The proxy signer and the home base check the validity of those parameters. If it is correct, they accept it; otherwise, they reject it. Before signing a message m, the proxy signer computes the proxy secret key with the home base’s help. After computing the proxy secret key, the signing and the verification stage are the same as those of time-bounded proxy signature schemes. We give two theorems to prove the security of our scheme by assuming hardness of the Strong-RSA problem.
|
author2 |
Wen-Guey Tzeng |
author_facet |
Wen-Guey Tzeng Ti-Wen Sun 孫荻雯 |
author |
Ti-Wen Sun 孫荻雯 |
spellingShingle |
Ti-Wen Sun 孫荻雯 Intrusion-Resilient Proxy Signature Schemes |
author_sort |
Ti-Wen Sun |
title |
Intrusion-Resilient Proxy Signature Schemes |
title_short |
Intrusion-Resilient Proxy Signature Schemes |
title_full |
Intrusion-Resilient Proxy Signature Schemes |
title_fullStr |
Intrusion-Resilient Proxy Signature Schemes |
title_full_unstemmed |
Intrusion-Resilient Proxy Signature Schemes |
title_sort |
intrusion-resilient proxy signature schemes |
publishDate |
2003 |
url |
http://ndltd.ncl.edu.tw/handle/43582078892031670781 |
work_keys_str_mv |
AT tiwensun intrusionresilientproxysignatureschemes AT sūndíwén intrusionresilientproxysignatureschemes AT tiwensun kědǐdǎngrùqīndedàilǐqiānzhāngxìtǒng AT sūndíwén kědǐdǎngrùqīndedàilǐqiānzhāngxìtǒng |
_version_ |
1718315049475375104 |