research-article

Universal forgery of the identity-based sequential aggregate signature scheme

Authors:

Jung Yeon Hwang,

Dong Hoon Lee,

Moti YungAuthors Info & Claims

ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security

Pages 157 - 160

https://doi.org/10.1145/1533057.1533080

Published: 10 March 2009 Publication History

Get Access

Abstract

At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any messages of its choice. In addition, we show that the computational assumption is not correct by concretely presenting a constant-time algorithm solving the problem. The contribution of the new scheme and assumption is a natural step in cryptologic research that calls for further investigation, which is a step we perform in the current work.

References

[1]

W. Aiello, J. Ioannidis, and P. McDaniel. Origin authentication in interdomain routing. In 10th ACM Conference on Computer and Communications Security - CCS 2003, pages 165--178. ACM, 2003.

Digital Library

Google Scholar

[2]

A. Boldyreva, C. Gentry, A. O'Neill, and D. H. Yum. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In 14th ACM Conference on Computer and Communications Security - CCS 2007, pages 276--285. ACM. The full version is available at www.cc.gatech.edu/ aboldyre/publications.html, 2007.

Digital Library

Google Scholar

[3]

A. Boldyreva, C. Gentry, A. O'Neill, and D. H. Yum. New multiparty signature schemes for network routing applications. ACM Transactions and Information and Systems Security, 12(1):1--39, 2008.

Digital Library

Google Scholar

[4]

D. Boneh and X. Boyen. Short signatures without random oracles. In Proc. Eurocrypt 2004, volume 3027 of LNCS, pages 56--73. Springer, 2004.

Google Scholar

[5]

D. Boneh, X. Boyen, and E. Goh. Hierarchical identity based encryption with constant size ciphertext. In Proc. Eurocrypt 2005, volume 3494 of LNCS, pages 440--456. Springer, 2005.

Digital Library

Google Scholar

[6]

D. Boneh, C. Gentry, B. Lynn, and M. Franklin. Aggregate and verifiably encrypted signatures from bilinear maps. In Proc. Eurocrypt 2003, volume 2656 of LNCS, pages 416--432. Springer, 2003.

Digital Library

Google Scholar

[7]

K. Bulter and W. Aiello. Optimizing bgp security by exploiting path stability. In 13th ACM Conference on Computer and Communications Security - CCS 2006, pages 298--310. ACM, 2006.

Digital Library

Google Scholar

[8]

C. Gentry and Z. Ramzan. Identity-based aggregate signatures. In Proc. PKC 2006, volume 3958 of LNCS, pages 257--273. Springer, 2006.

Digital Library

Google Scholar

[9]

S. Kent, C. Lynn, and K. Seo. Secure border gateway protocol (secure-bgp). IEEE Journal on Selected Areas in Communications, 18(4):582--592, 2000.

Digital Library

Google Scholar

[10]

A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In Proc. Selected Areas in Cryptography 1999, volume 1758 of LNCS, pages 184--199. Springer, 1999.

Digital Library

Google Scholar

[11]

A. Lysyanskya, S. Micali, L. Reyzin, and H. Shacham. Sequential aggregate signatures from trapdoor permutations. In Proc. Eurocrypt 2004, volume 3027 of LNCS, pages 74--90. Springer, 2004.

Google Scholar

[12]

A. Lysyanskya, R. Ostrovsky, A. Sahai, H. Shacham, and B. Waters. Sequential aggregate signatures and multisignatures without random oracles. In Proc. Eurocrypt 2006, volume 4004 of LNCS, pages 465--485. Springer, 2006.

Digital Library

Google Scholar

[13]

A. Shmair. Identity-based cryptosystems and signature schemes. In Proc. CRYPTO 1984, volume 196 of LNCS, pages 47--53. Springer, 1984.

Digital Library

Google Scholar

[14]

V. Shoup. Lower bounds for discrete logarithms and related problems. In Proc. Eurocrypt 1997, volume 1592 of LNCS, pages 256--266. Springer, 1997.

Digital Library

Google Scholar

Cited By

View all

Kabaleeshwaran RVenkata Shanmukh Sai P(2024)Synchronized Aggregate Signature Under Standard Assumption in the Random Oracle ModelProgress in Cryptology – INDOCRYPT 202310.1007/978-3-031-56232-7_10(197-220)Online publication date: 29-Mar-2024
https://doi.org/10.1007/978-3-031-56232-7_10
Pattaranantakul MSong QTian YWang LZhang ZMeddahi AVorakulpipat C(2021)On Achieving Trustworthy Service Function ChainingIEEE Transactions on Network and Service Management10.1109/TNSM.2021.308101418:3(3140-3153)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3081014
Wu YLuo JZhao JYang Q(2020)Privacy-Preserving Scheme Based on Group Signature in Smart GridWireless Sensor Networks10.1007/978-981-33-4214-9_16(209-220)Online publication date: 20-Nov-2020
https://doi.org/10.1007/978-981-33-4214-9_16
Show More Cited By

Index Terms

Universal forgery of the identity-based sequential aggregate signature scheme

Recommendations

Identity-Based Sequential Aggregate Signature from RSA
CHINAGRID '09: Proceedings of the 2009 Fourth ChinaGrid Annual Conference

Sequential aggregate signature (SAS) schemes allow multiple signers to sequentially produce a short signature of different messages and also allow signers to attest to these messages as well as the order in which they signed. Identity-based signature (...
An ID-based multi-signer universal designated multi-verifier signature scheme

In an ID-based universal designated verifier signature scheme, a single signer generates a signature that can only be verified by a designated verifier using a simplified public identity such as an e-mail address. In this paper, we expand the scheme to ...
Secure universal designated verifier identity-based signcryption

In 2003, Steinfeld et al. introduced the notion of universal designated verifier signature UDVS, which allows a signature holder, who receives a signature from the signer, to convince a designated verifier whether he is possession of a signer's ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security

March 2009

408 pages

ISBN:9781605583945

DOI:10.1145/1533057

General Chairs:
Wanqing Li
University of Wollongong, Australia
,
Willy Susilo
University of Wollongong, Australia
,
Udaya Tupakula
Macquarie University, Australia
,
Program Chairs:
Rei Safavi-Naini
University of Calgary, Canada
,
Vijay Varadharajan
Macquarie University, Australia

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

Asia CCS 09

Sponsor:

SIGSAC

Asia CCS 09: Asia CCS 2009 ACM Symposium on Information, Computer and Communications Security

March 10 - 12, 2009

Sydney, Australia

Acceptance Rates

Overall Acceptance Rate 418 of 2,322 submissions, 18%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
462
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)3

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kabaleeshwaran RVenkata Shanmukh Sai P(2024)Synchronized Aggregate Signature Under Standard Assumption in the Random Oracle ModelProgress in Cryptology – INDOCRYPT 202310.1007/978-3-031-56232-7_10(197-220)Online publication date: 29-Mar-2024
https://doi.org/10.1007/978-3-031-56232-7_10
Pattaranantakul MSong QTian YWang LZhang ZMeddahi AVorakulpipat C(2021)On Achieving Trustworthy Service Function ChainingIEEE Transactions on Network and Service Management10.1109/TNSM.2021.308101418:3(3140-3153)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3081014
Wu YLuo JZhao JYang Q(2020)Privacy-Preserving Scheme Based on Group Signature in Smart GridWireless Sensor Networks10.1007/978-981-33-4214-9_16(209-220)Online publication date: 20-Nov-2020
https://doi.org/10.1007/978-981-33-4214-9_16
Bellare MDai W(2020)The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and SignaturesProgress in Cryptology – INDOCRYPT 202010.1007/978-3-030-65277-7_24(529-552)Online publication date: 13-Dec-2020
https://dl.acm.org/doi/10.1007/978-3-030-65277-7_24
van der Laan BErsoy OErkin ZHung CPapadopoulos G(2019)MUSCLEProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297320(382-391)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297320
Barthe GFagerholm EFiore DMitchell JScedrov ASchmidt B(2019)Automated Analysis of Cryptographic Assumptions in Generic Group ModelsJournal of Cryptology10.1007/s00145-018-9302-332:2(324-360)Online publication date: 1-Apr-2019
https://dl.acm.org/doi/10.1007/s00145-018-9302-3
Badra MZeadally S(2017)Lightweight and efficient privacy-preserving data aggregation approach for the Smart GridAd Hoc Networks10.1016/j.adhoc.2017.05.01164(32-40)Online publication date: Sep-2017
https://doi.org/10.1016/j.adhoc.2017.05.011
Ambrona MBarthe GSchmidt B(2016)Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group ModelProceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 966610.5555/3081738.3081767(822-851)Online publication date: 8-May-2016
https://dl.acm.org/doi/10.5555/3081738.3081767
Ambrona MBarthe GSchmidt B(2016)Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group ModelAdvances in Cryptology – EUROCRYPT 201610.1007/978-3-662-49896-5_29(822-851)Online publication date: 28-Apr-2016
https://doi.org/10.1007/978-3-662-49896-5_29
Hur JKoo DShin Y(2015)Privacy-Preserving Smart Metering with Authentication in a Smart GridApplied Sciences10.3390/app50415035:4(1503-1527)Online publication date: 1-Dec-2015
https://doi.org/10.3390/app5041503
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Identity-Based Sequential Aggregate Signature from RSA

An ID-based multi-signer universal designated multi-verifier signature scheme

Secure universal designated verifier identity-based signcryption