On the security of probabilistic multisignature schemes and their optimality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3715 LNCS, Issue , 2005, Pages 132-150

  Komano, Yuichi ^a   Ohta, Kazuo ^b   Shimbo, Atsushi ^a   Kawamura, Shinichi ^a  

^a TOSHIBA CORPORATION   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Aggregate signature; Multisignature; Optimal security; Provable security; Random oracle model

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CRYPTOGRAPHY; OPTIMIZATION;

AGGREGATE SIGNATURE; MULTISIGNATURE; OPTIMAL SECURITY; PROVABLE SECURITY; RANDOM ORACLE MODEL;

SECURITY OF DATA;

EID: 33646166968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_10     Document Type: Conference Paper

References (11)

1. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. of the First ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
2. M. Bellare and P. Rogaway. The exact security of digital signatures -how to sign with RSA and Rabin. In U. Maurer, editor, Advances in Cryptology - EURO-CRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 399-416, Berlin, Heidelberg, New York, 1996. Springer-Verlag.
3. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiability encrypted signature form bilinear maps. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, Berlin, Heidelberg, New York, 2003. Springer-Verlag.
4. J. S. Coron. Optimal security proofs for PSS and other signature schemes. In L. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 272-287, Berlin, Heidelberg, New York, 2002. Springer-Verlag.
5. K. Itakura and K. Nakamura. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, (71), pages 1-8, 1983.
6. K. Kawauchi and M. Tada. On the exact security of multisignature schemes based on RSA. In R. S. Naini and J. Seberry, editors, The Eighth Australasian Conference on Information Security and Privacy (ACISP 2003), volume 2727 of Lecture Notes in Computer Science, pages 336-349, Berlin, Heidelberg, New York, 2003. Springer-Verlag.
7. K. Kawauchi and M. Tada. 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, E88-A(5), 2005.
8. A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. Sequential aggregate signatures from trapdoor permutations. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 74-90, Berlin, Heidelberg, New York, 2004. Springer-Verlag.
9. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. In CCS'01, Eighth ACM Conference on Computer and Communications Security, 2001.
10. S. Mitomi and A. Miyaji. A general model of multisignature schemes with message flexibility, order flexibility, and order verifiability. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E84-A(10):2488-2499, 2001.
11. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.