Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation
Summary :
We proposed a one-way trapdoor permutation f based multi-signature scheme which can keep tighter reduction rate. Assuming the underlying hash functions are ideal, our proposed scheme is not only provably secure, but are so in a tight. An ability to forge multi-signatures with a certain amount of computational resources implies the ability to invert a one-way trapdoor permutation f (on the same size modulus) with about the same computational effort. The proposed scheme provides the exact security against Adaptive-Chosen-Message-Attack and Adaptive-Insider-Attack by
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.5 pp.1141-1153
- Publication Date
- 2004/05/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Kei KAWAUCHI, Yuichi KOMANO, Kazuo OHTA, Mitsuru TADA, "Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 5, pp. 1141-1153, May 2004, doi: .
Abstract: We proposed a one-way trapdoor permutation f based multi-signature scheme which can keep tighter reduction rate. Assuming the underlying hash functions are ideal, our proposed scheme is not only provably secure, but are so in a tight. An ability to forge multi-signatures with a certain amount of computational resources implies the ability to invert a one-way trapdoor permutation f (on the same size modulus) with about the same computational effort. The proposed scheme provides the exact security against Adaptive-Chosen-Message-Attack and Adaptive-Insider-Attack by
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_5_1141/_p
Copy
@ARTICLE{e87-a_5_1141,
author={Kei KAWAUCHI, Yuichi KOMANO, Kazuo OHTA, Mitsuru TADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation},
year={2004},
volume={E87-A},
number={5},
pages={1141-1153},
abstract={We proposed a one-way trapdoor permutation f based multi-signature scheme which can keep tighter reduction rate. Assuming the underlying hash functions are ideal, our proposed scheme is not only provably secure, but are so in a tight. An ability to forge multi-signatures with a certain amount of computational resources implies the ability to invert a one-way trapdoor permutation f (on the same size modulus) with about the same computational effort. The proposed scheme provides the exact security against Adaptive-Chosen-Message-Attack and Adaptive-Insider-Attack by
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1141
EP - 1153
AU - Kei KAWAUCHI
AU - Yuichi KOMANO
AU - Kazuo OHTA
AU - Mitsuru TADA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2004
AB - We proposed a one-way trapdoor permutation f based multi-signature scheme which can keep tighter reduction rate. Assuming the underlying hash functions are ideal, our proposed scheme is not only provably secure, but are so in a tight. An ability to forge multi-signatures with a certain amount of computational resources implies the ability to invert a one-way trapdoor permutation f (on the same size modulus) with about the same computational effort. The proposed scheme provides the exact security against Adaptive-Chosen-Message-Attack and Adaptive-Insider-Attack by
ER -
English
