Synchronized aggregate signatures from the RSA assumption
From MaRDI portal
(Redirected from Synchronized aggregate signatures from the RSA assumption)
Recommendations
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Improved security proof for the Camenisch-Lysyanskaya signature-based synchronized aggregate signature scheme
- Identity-based aggregate and multi-signature schemes based on RSA
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Fault-tolerant aggregate signatures
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- On the security of some aggregate signature schemes
- From rerandomizability to sequential aggregation: efficient signature schemes based on SXDH assumption
- Information Security and Cryptology
Cited in
(13)- New methods and abstractions for RSA-based forward secure signatures
- The round complexity of quantum zero-knowledge
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Locally verifiable signature and key aggregation
- Pointcheval-Sanders signature-based synchronized aggregate signature
- Identity-based interactive aggregate signatures from lattices
- Synchronized aggregate signature under standard assumption in the random oracle model
- Multi-signer locally verifiable aggregate signature from (leveled) multilinear maps
- Tightly secure lattice-based synchronized aggregate signature in standard model
- Pairing-based aggregate signatures without random oracles
- Hash-based multi-signatures for post-quantum Ethereum
- Two-round 2PC ECDSA at the cost of 1 OLE: applications to embedded cryptocurrency wallets
This page was built for publication: Synchronized aggregate signatures from the RSA assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648827)
