See this document in CiteSeerX!

Unrestricted Aggregate Signatures (2006)  (Make Corrections)  
Mihir Bellare, Chanathip Namprempre, Gregory Neven



  Home/Search   Context   Related

 
View or download:
iacr.org/2006/285.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iacr.org/2006/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Secure use of the BGLS [7] aggregate signature schemes is restricted to the aggregation of distinct messages (for the basic scheme) or per-signer distinct messages (for the enhanced, prepend-public-key version of the scheme). We argue that these restrictions preclude interesting applications, make usage of the schemes error-prone and are generally undesirable in practice. Via a new analysis and proof, we show how the restrictions can be lifted, yielding the first truly unrestricted... (Update)

Active bibliography (related documents):   More   All
0.5:   Identity-based Key Agreement Protocols from Pairings - Chen, Cheng, Smart (2006)   (Correct)
0.4:   Sequential Aggregate Signatures and.. - Lu, Ostrovsky.. (2006)   (Correct)
0.3:   The Exact Security of an Identity Based Signature and its.. - Libert, Quisquater (2004)   (Correct)

Similar documents based on text:
6.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ bellare-unrestricted,
  author = "Mihir Bellare and Chanathip Namprempre and Gregory Neven",
  title = "Unrestricted Aggregate Signatures",
  url = "citeseer.ist.psu.edu/bellare06unrestricted.html" }
Citations (may not include all citations):
659   Random oracles are practical: A paradigm for designing effic.. - Bellare, Rogaway - 1993
501   A digital signature scheme secure against adaptive chosenmes.. - Goldwasser, Micali et al. - 1988
193   Short signatures from the Weil pairing - Boneh, Lynn et al.
60   the exact security of full domain hash - Coron - 2000
58   On defining proofs of knowledge - Bellare, Goldreich
45   Aggregate and verifiably encrypted signatures from bilinear .. - Boneh, Gentry et al.
17   Certifying permutations: Noninteractive zero-knowledge based.. - Bellare, Yung - 1996
11   multisignatures and blind signatures based on the gap-Diffie.. (context) - Boldyreva
5   Sequential aggregate signatures from trapdoor permutations (context) - Lysyanskaya, Micali et al.
4   An RSA family of trap-door permutations with a common domain.. (context) - Hayashi, Okamoto et al.
3   Code-based game-playing proofs and the security of triple en.. - Bellare, Rogaway
3   Randomness re-use in multi-recipient encryption schemeas (context) - Bellare, Boldyreva et al.
2   New Paradigms in Signature Schemes (context) - Shacham - 2005
1   Sequential aggregate signatures and multisignatures without .. - Lu, Ostrovsky et al.
1   A survey of two signature aggregation techniques - Boneh, Gentry et al. - 2003
1   Trapdoor hard-to-invert group isomorphisms and their applica.. (context) - Catalano, Pointcheval et al. - 2006

Documents on the same site (http://eprint.iacr.org/2006/):   More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006)   (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006)   (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC