Abstract
At PODC’05, Subramanian, Katz, Roth, Shenker and Stoica (SKRSS) introduced and formulated a new theoretical problem called reliable broadcast problems in unknown fixed-identity networks [3] and further proposed a feasible result to this problem. Since the size of signatures of a message traversing a path grows linearly with the number of hops in their implementations, this leaves an interesting research problem (an open problem advertised by Subramanian et al in [3]) – how to reduce the communication complexity of their reliable broadcast protocol?
In this paper, we provide a novel implementation of reliable broadcast problems in unknown fixed-identity networks with lower communication complexity. The idea behind of our improvement is that we first transfer the notion of path-vector signatures to that of sequential aggregate path-vector signatures and show that the notion of sequential aggregate path-vector is a special case of the notion of sequential aggregate signatures. As a result, the currently known results regarding sequential aggregate signatures can be used to solve the open problem. We then describe the work of [3] in light of sequential aggregate signatures working over independent RSA, and show that if the size of an node v i,j ’s public key |g(v i, j )| is t i,j and the number of hops in a path p i is d i in the unknown fixed-identity graph G (with k adversaries), the reduced communication complexity is approximate to \(\sum_{j=1} ^{d_i-1} t_{i, j}\) while the computation (time) complexity of our protocol is the same as that presented in [3].
Chapter PDF
Similar content being viewed by others
References
Dolev, D.: The Byzantine Generals Strike Again. J. Algorithms 3(1), 14–30 (1982)
Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential Aggregate Signatures from trapdoor one-way permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74–90. Springer, Heidelberg (2004)
Subramanian, L., Katz, R., Roth, V., Shenker, S., Stoica, I.: Reliable broadcast in unknown fixed-identity networks. In: PODC 2005, pp. 342–351 (2005)
Zhu, H., Bao, F., Deng, R.H.: Sequential Aggregate Signatures Working over Independent Homomorphic Trapdoor One-Way Permutation Domains. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 207–219. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, H., Zhou, J. (2006). Finding Compact Reliable Broadcast in Unknown Fixed-Identity Networks (Short Paper). In: Ning, P., Qing, S., Li, N. (eds) Information and Communications Security. ICICS 2006. Lecture Notes in Computer Science, vol 4307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935308_6
Download citation
DOI: https://doi.org/10.1007/11935308_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49496-6
Online ISBN: 978-3-540-49497-3
eBook Packages: Computer ScienceComputer Science (R0)