Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
Accountable-subgroup multisignatures: extended abstract
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
A robust multisignature scheme with applications to acknowledgement aggregation
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Secure acknowledgment of multicast messages in open peer-to-peer networks
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Secure many-to-one symbol transmission for implementation on smart cards
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure and scalable many-to-one symbol transmission for sensor networks
Computer Communications
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Proceedings of the 15th ACM conference on Computer and communications security
Non-interactive multisignatures in the plain public-key model with efficient verification
Information Processing Letters
Non-interactive CDH-based multisignature scheme in the plain public key model with tighter security
ISC'11 Proceedings of the 14th international conference on Information security
Identity-Based multi-signatures from RSA
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
| Hi-index | 0.00 |
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. However, secure verification of individual acknowledgments from all receivers can impose a significant computation and communication burden. Such cost can be significantly reduced if intermediate nodes along the distribution tree aggregate the acknowledgments produced by the multicast receivers into a single multisignature.The approach explored in prior work on acknowledgment aggregation [A. Nicolosi, D. Mazieres, Secure acknowledgement of multicast messages in open peer-to-peer networks, in: 3rd International Workshop on Peer-to-Peer Systems (IPTPS'04), San Diego, CA, February 2004] is based on a multisignature scheme of [A. Boldyreva, Efficient threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme, in: Public Key Cryptography 2003, 2003]. However, this multisignature scheme requires a relatively new cryptographic assumption of "Gap Diffie-Hellman". In contrast, we propose a solution using multisignature schemes secure under more standard and long-standing security assumptions. In particular, we show how to extend previously known non-robust multisignature scheme [S. Micali, K. Ohta, L. Reyzin, Accountable-subgroup multisignatures, in: ACM Conference on Computer and Communications Security, October 2001] based on the discrete logarithm assumption to achieve limited robustness. Our extension--which also generalizes to certain other multisignature schemes--allows for efficient multisignature generation in the presence of (possibly malicious) node and communication failures, as long as the number of such faults does not exceed a certain threshold.