Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 35-51
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman ProblemsJournal of Cryptology, 2007
- Unrestricted Aggregate Signatures2007
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks2007
- Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic GroupsJournal of Cryptology, 2003
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps2003
- A Signature Scheme as Secure as the Diffie-Hellman Problem2003
- Efficient Algorithms for Pairing-Based Cryptosystems2002
- Short Signatures from the Weil Pairing2001
- Wallet Databases with Observers2001
- A digital multisignature scheme using bijective public-key cryptosystemsACM Transactions on Computer Systems, 1988