Boneh et al.'s k-element aggregate extraction assumption is equivalent to the Diffie-Hellman -assumption

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

Volumn 2894, Issue , 2003, Pages 392-397

  Coron, Jean Sebastien ^a   Naccache, David ^a  

^a GEMPLUS   (France)

Author keywords

Aggregate signatures; Complexity assumption; Diffie Hellman problem

Indexed keywords

ALUMINUM; AUTHENTICATION; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; EXTRACTION; NETWORK SECURITY; SECURITY OF DATA;

AGGREGATE EXTRACTIONS; AGGREGATE SIGNATURE; COMPLEXITY ASSUMPTIONS; COMPUTATIONAL DIFFIE-HELLMAN PROBLEMS; CRYPTOGRAPHIC PRIMITIVES; DIFFIE-HELLMAN ASSUMPTION; DIFFIE-HELLMAN PROBLEM; VERIFIABLY ENCRYPTED SIGNATURES;

AGGREGATES;

EID: 0344232849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40061-5_25     Document Type: Article

References (3)

1. D. Boneh, B. Lynn and H. Shacham, Short Signatures From the Weil Pairing, Proceedings of ASIACRYPT' 2001, Lecture Notes in Computer Science vol. 2248, Springer-Verlag, pp. 514-532, 2001.
2. D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, Advances in Cryptology - EUROCRYPT' 2003 Proceedings, Lecture Notes in Computer Science vol. 2656, E. Biham ed., Springer-Verlag, pp. 416-432, 2003.
3. D. Boneh, C. Gentry, B. Lynn and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, Cryptology ePrint Archive, Report 2002/175, 2002, http://eprint.iacr.org/.