Sequential Aggregate Signatures and Multisignatures Without Random Oracles
暂无分享,去创建一个
Rafail Ostrovsky | Hovav Shacham | Brent Waters | Amit Sahai | Steve Lu | R. Ostrovsky | A. Sahai | Brent Waters | H. Shacham | Steve Lu
[1] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[2] Keisuke Tanaka,et al. An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications , 2004, Public Key Cryptography.
[3] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[4] Paulo S. L. M. Barreto,et al. Pairing-Friendly Elliptic Curves of Prime Order , 2005, Selected Areas in Cryptography.
[5] S. Galbraith,et al. Advances in Elliptic Curve Cryptography: Pairings , 2005 .
[6] Jean-Sébastien Coron,et al. Boneh et al.'s k-Element Aggregate Extraction Assumption Is Equivalent to the Diffie-Hellman Assumption , 2003, ASIACRYPT.
[7] David Naccache,et al. Secure and practical identity-based encryption , 2005, IET Inf. Secur..
[8] Silvio Micali,et al. Accountable-subgroup multisignatures: extended abstract , 2001, CCS '01.
[9] Alexandra Boldyreva,et al. Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme , 2003, Public Key Cryptography.
[10] Charles Lynn,et al. Secure Border Gateway Protocol (Secure-BGP) , 2000 .
[11] Stephen T. Kent,et al. Secure Border Gateway Protocol (S-BGP) , 2000, IEEE Journal on Selected Areas in Communications.
[12] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[13] K. Paterson. Advances in Elliptic Curve Cryptography: Cryptography from Pairings , 2005 .
[14] Eiji Okamoto,et al. Proxy signatures for delegating signing operation , 1996, CCS '96.
[15] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[16] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[17] K. Itakura,et al. A public-key cryptosystem suitable for digital multisignatures , 1983 .
[18] Tatsuaki Okamoto,et al. A digital multisignature scheme using bijective public-key cryptosystems , 1988, TOCS.
[19] Sanjit Chatterjee,et al. Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model , 2005, ICISC.
[20] N. Asokan,et al. Optimistic fair exchange of digital signatures , 1998, IEEE Journal on Selected Areas in Communications.
[21] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[22] Sean W. Smith,et al. Evaluation of efficient security for BGP route announcements using parallel simulation , 2004, Simul. Model. Pract. Theory.
[23] Hovav Shacham,et al. Sequential Aggregate Signatures from Trapdoor Permutations , 2004, EUROCRYPT.
[24] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.
[25] Alfred Menezes,et al. Pairing-Based Cryptography at High Security Levels , 2005, IMACC.
[26] Robert H. Deng,et al. Efficient and practical fair exchange protocols with off-line TTP , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).
[27] Mihir Bellare,et al. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions , 2003, EUROCRYPT.
[28] Jonathan Katz,et al. Ring Signatures: Stronger Definitions, and Constructions without Random Oracles , 2005, IACR Cryptol. ePrint Arch..
[29] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[30] K. Ohta,et al. Multi-Signature Schemes Secure against Active Insider Attacks (Special Section on Cryptography and Information Security) , 1999 .