Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles

DOI10.1007/s00145-012-9126-5zbMath1279.94098OpenAlexW2166844482WikidataQ122219623 ScholiaQ122219623MaRDI QIDQ2377064

Brent Waters, Rafail Ostrovsky, Steve Lu, Amit Sahai, Hovav Shacham

Publication date: 27 June 2013

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-012-9126-5

zbMATH Keywords

bilinear mapsecure BGPwaters signature

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression, A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes, Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party, Must the communication graph of MPC protocols be an expander?, Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES, Practical verifiably encrypted signatures without random oracles, Blockchain-based two-party fair contract signing scheme, Sequential aggregate signatures with short public keys without random oracles

Cites Work

• Unnamed Item
• Secure proxy signature schemes for delegation of signing rights
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• Short signatures from the Weil pairing
• The random oracle methodology, revisited
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• Perfect Non-interactive Zero Knowledge for NP
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Reducing elliptic curve logarithms to logarithms in a finite field
• A digital multisignature scheme using bijective public-key cryptosystems
• Hierarchical ID-Based Cryptography
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Identity-Based Encryption from the Weil Pairing
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Pairing-Friendly Elliptic Curves of Prime Order
• Unrestricted Aggregate Signatures
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Efficient Sequential Aggregate Signed Data
• On the Generic Construction of Identity-Based Signatures with Additional Properties
• Advances in Elliptic Curve Cryptography
• Efficient Identity-Based Signatures Secure in the Standard Model
• Cryptography and Coding
• Information Security and Cryptology - ICISC 2005
• Public Key Cryptography – PKC 2004
• Advances in Cryptology - ASIACRYPT 2003