In a proxy re-signatures (PRS) scheme, a semi-trusted proxy is given some information which allows it to translate a user i's signature on a message m into another user j's signature on the same message m. However, the proxy cannot, on it own, compute signatures for either i or j. This notion introduced by Blaze et a. at EUROCRYPT 1998, and then revisited by Ateniese and Hohenberger at CCS 2005. The existence of multi-use unidirectional PRS scheme is an open problem left by AH05. Whereafter, at CCS 2008, Libert and Vergnaud constructed the first multi-use unidirectional PRS scheme. However, there is a major drawback in the LV08 scheme that the size of the signatures is linear in the number of translations. Hence, Libert and Vergnaud said that a more challenging task would be to find out implementations of such primitives where the size of signatures and the verification cost do not grow linearly with the number of translations. In this work we resolve this task by constructing a such PRS scheme in the standard model by using indistinguishability obfuscation. A shortcoming of our construction is that the security is selective but not full.
Fei TANG
Institute of Information Engineering of Chinese Academy of Sciences,Data Assurance and Communication Security Research Center of Chinese Academy of Sciences,University of Chinese Academy of Sciences
Hongda LI
Institute of Information Engineering of Chinese Academy of Sciences,Data Assurance and Communication Security Research Center of Chinese Academy of Sciences
Jinyong CHANG
Institute of Information Engineering of Chinese Academy of Sciences
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Fei TANG, Hongda LI, Jinyong CHANG, "Multi-Use Unidirectional Proxy Re-Signatures of Constant Size without Random Oracles" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 3, pp. 898-905, March 2015, doi: 10.1587/transfun.E98.A.898.
Abstract: In a proxy re-signatures (PRS) scheme, a semi-trusted proxy is given some information which allows it to translate a user i's signature on a message m into another user j's signature on the same message m. However, the proxy cannot, on it own, compute signatures for either i or j. This notion introduced by Blaze et a. at EUROCRYPT 1998, and then revisited by Ateniese and Hohenberger at CCS 2005. The existence of multi-use unidirectional PRS scheme is an open problem left by AH05. Whereafter, at CCS 2008, Libert and Vergnaud constructed the first multi-use unidirectional PRS scheme. However, there is a major drawback in the LV08 scheme that the size of the signatures is linear in the number of translations. Hence, Libert and Vergnaud said that a more challenging task would be to find out implementations of such primitives where the size of signatures and the verification cost do not grow linearly with the number of translations. In this work we resolve this task by constructing a such PRS scheme in the standard model by using indistinguishability obfuscation. A shortcoming of our construction is that the security is selective but not full.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.898/_p
Copy
@ARTICLE{e98-a_3_898,
author={Fei TANG, Hongda LI, Jinyong CHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Multi-Use Unidirectional Proxy Re-Signatures of Constant Size without Random Oracles},
year={2015},
volume={E98-A},
number={3},
pages={898-905},
abstract={In a proxy re-signatures (PRS) scheme, a semi-trusted proxy is given some information which allows it to translate a user i's signature on a message m into another user j's signature on the same message m. However, the proxy cannot, on it own, compute signatures for either i or j. This notion introduced by Blaze et a. at EUROCRYPT 1998, and then revisited by Ateniese and Hohenberger at CCS 2005. The existence of multi-use unidirectional PRS scheme is an open problem left by AH05. Whereafter, at CCS 2008, Libert and Vergnaud constructed the first multi-use unidirectional PRS scheme. However, there is a major drawback in the LV08 scheme that the size of the signatures is linear in the number of translations. Hence, Libert and Vergnaud said that a more challenging task would be to find out implementations of such primitives where the size of signatures and the verification cost do not grow linearly with the number of translations. In this work we resolve this task by constructing a such PRS scheme in the standard model by using indistinguishability obfuscation. A shortcoming of our construction is that the security is selective but not full.},
keywords={},
doi={10.1587/transfun.E98.A.898},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Multi-Use Unidirectional Proxy Re-Signatures of Constant Size without Random Oracles
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 898
EP - 905
AU - Fei TANG
AU - Hongda LI
AU - Jinyong CHANG
PY - 2015
DO - 10.1587/transfun.E98.A.898
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2015
AB - In a proxy re-signatures (PRS) scheme, a semi-trusted proxy is given some information which allows it to translate a user i's signature on a message m into another user j's signature on the same message m. However, the proxy cannot, on it own, compute signatures for either i or j. This notion introduced by Blaze et a. at EUROCRYPT 1998, and then revisited by Ateniese and Hohenberger at CCS 2005. The existence of multi-use unidirectional PRS scheme is an open problem left by AH05. Whereafter, at CCS 2008, Libert and Vergnaud constructed the first multi-use unidirectional PRS scheme. However, there is a major drawback in the LV08 scheme that the size of the signatures is linear in the number of translations. Hence, Libert and Vergnaud said that a more challenging task would be to find out implementations of such primitives where the size of signatures and the verification cost do not grow linearly with the number of translations. In this work we resolve this task by constructing a such PRS scheme in the standard model by using indistinguishability obfuscation. A shortcoming of our construction is that the security is selective but not full.
ER -