On the security of probabilistic multisignature schemes and their optimality

Authors:
Yuichi Komano;Kazuo Ohta;Atsushi Shimbo;Shinichi Kawamura
Affiliations:
Toshiba Corporation, Kawasaki, Japan;The University of Electro-Communications, Tokyo, Japan;Toshiba Corporation, Kawasaki, Japan;Toshiba Corporation, Kawasaki, Japan
Venue:
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Year:
2005

Citing 8
Cited 2

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Accountable-subgroup multisignatures: extended abstract

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Optimal Security Proofs for PSS and Other Signature Schemes

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the Security and the Efficiency of Multi-Signature Schemes Based on a Trapdoor One-Way Permutation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On the exact security of multi-signature schemes based on RSA

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Provably Secure Multisignatures in Formal Security Model and Their Optimality

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Formal security model of multisignatures

ISC'06 Proceedings of the 9th international conference on Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first prove that the following three probabilistic multisignature schemes based on a trapdoor permutation have tight security; PFDH (probabilistic full domain hash) based multisignature scheme (PFDH-MSS), PSS (probabilistic signature scheme) based multisignature scheme (PSS-MSS), and short signature PSS based multisignature scheme (S-PSS-MSS). Second, we give an optimal proof (general result) for multisignature schemes, which derives the lower bound for the length of random salt. We also estimate the upper bound for the length in each scheme and derive the optimal length of a random salt. Two of the schemes are promising in terms of security tightness and optimal signature length.