Multi-signatures in the plain public-Key model and a general forking lemma

By Mihir Bellare, Gregory Neven. Conference on Computer and Communications Security, 2006

730 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Instantaneous Decentralized Poker (2017, methodology): “An efficient Schnorr-based multisignature scheme without multiple key generations is given by Bellare and Neven [4], but their scheme relies on a certificate authority.”
Compact Multi-Signatures for Smaller Blockchains (2018, methodology): “The use of Okamoto signatures avoids the extra round of hashes in the signing protocol of Bellare-Neven [9], but increases the signature size with an additional element in Zq.”
Privacy-Preserving Public Auditing for Secure Cloud Storage (2013, neutral): “This can be done using the idea in [26].”
Lattice Signatures Without Trapdoors (2012, methodology): “Once we have a way to reply to signing queries, we use the forking lemma [38, 7] to use the forger’s valid signatures to recover a short vector v such that Av = 0.”
Simple Schnorr multi-signatures with applications to Bitcoin (2019, methodology): “As in [BN06], our security proof will rely on the following generalized Forking Lemma extending Pointcheval and Stern’s Forking Lemma [PS00] and which does not mention signatures nor forgers and only deals with the outputs of an algorithm A run twice on related inputs.”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, neutral): “As discussed in [10], current public key”