Compact sequential aggregate signatures

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 249-253

  Mu, Yi ^a   Susilo, Willy ^a   Zhu, Huafei ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Communication; Computer; Provably secure; RSA problem; Signatures

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; VECTOR QUANTIZATION;

COMPACT SEQUENTIAL AGGREGATE SIGNATURES; OVERFLOW BITS; PUBLIC KEY VECTORS; RANDOM ORACLE MODELS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 35248834067     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244065     Document Type: Conference Paper

References (14)

1. D.Boneh, C.Gentry, B.Lynn and H.Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432.
2. D.Boneh, B.Lynn, H.Shacham: Short Signatures from the Weil Pairing. ASIACRYPT 2001: 514 -532.
3. M.Bellare and P.Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In D. Denning, R.PyIe, R.Ganesan, R.Sandhu, and V.Ashby, editors, Proceedings of CCS 1993, pages 62-73. ACM Press, 1993.
4. R. Canetti: Universally Composable Security: A New Paradigm for Cryptographic Protocols. FOCS 2001: 136-145
5. R. Canetti. Universally Composable Signatures, Certification, and Authentication. Proceedings of the 17th Computer Security Foundations Workshop (CSFW), June 2004.
6. S.Goldwasser, S.Micali, R.Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308 (1988).
7. R.Hayashi, T.Okamoto, K.Tanaka: An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications. Public Key Cryptography 2004: 291 -304.
8. A.Lysyanskaya, S.Micali, L.Reyzin and H.Shacham: Sequential Aggregate Signatures from trapdoor one-way permutations. EUROCRYPT 2004: 74-90.
9. S.Lu, R.Ostrovsky, A.Sahai, H.Shacham, and B.Waters: Sequential Aggregate Signatures and Multisignatures without Random Oracles. Eurocrypt 2006, page 465-485.
10. R.Rivest, A.Shamir, and L.M.Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2): 120-126 (1978).
11. B.Waters: Efficient Identity-Based Encryption Without Random Oracles. EUROCRYPT 2005: 114-127.
12. H.Zhu, F.Bao, R.Deng: Sequential Aggregate Signatures Working over Independent Homomorphic Trapdoor One-Way Permutation Domains. ICICS 2005: 207 -219.
13. H.Zhu, F.Bao, T.Chigan. Compact Routing Discovery Protocol with Lower Communication Complexity, IEEE Wireless Communications and Networking Conference 2006.
14. H.Zhu, J.Zhou: Finding Compact Reliable Broadcast Communications in Unknown Fixed-identity Networks. ICICS 2006, December 4 -7, 2006, Raleigh, North Carolina, USA.