FSS2-Id/A Fast Safe Identity-Based Multi Signature Scheme
暂无分享,去创建一个
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Gene Tsudik,et al. Secure acknowledgment aggregation and multisignatures with limited robustness , 2006, Comput. Networks.
[3] Mihir Bellare,et al. Multi-signatures in the plain public-Key model and a general forking lemma , 2006, CCS '06.
[4] Silvio Micali,et al. Transitive Signature Schemes , 2002, CT-RSA.
[5] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[6] Kwangjo Kim,et al. ID-Based Blind Signature and Ring Signature from Pairings , 2002, ASIACRYPT.
[7] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[8] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.
[9] Gene Tsudik,et al. A Robust Multisignatures Scheme with Applications to Acknowledgment Aggregation , 2004, SCN.
[10] Jung Hee Cheon,et al. An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.
[11] Tatsuaki Okamoto,et al. A digital multisignature scheme using bijective public-key cryptosystems , 1988, TOCS.
[12] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[13] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[14] Adi Shamir,et al. Efficient Signature Schemes Based on Polynomial Equations , 1984, CRYPTO.
[15] Alexandra Boldyreva,et al. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .
[16] Hugo Krawczyk,et al. Robust and Efficient Sharing of RSA Functions , 2000, Journal of Cryptology.
[17] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .