Cryptanalysis of an Anonymous Identity-based Identification Scheme in Ad-Hoc Group without Pairings
暂无分享,去创建一个
[1] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[2] Xiaofeng Chen,et al. Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 , 2009, Inf. Process. Lett..
[3] Aggelos Kiayias,et al. Anonymous Identification in Ad Hoc Groups , 2004, EUROCRYPT.
[4] Huaxiong Wang,et al. The Bilinear Pairing-based Accumulator Proposed at CT-RSA'05 is not Collision Resistant , 2006, IACR Cryptol. ePrint Arch..
[5] Yuefei Zhu,et al. An Efficient Identity Based Anonymous Identification Scheme for Ad-Hoc Groups from Pairings , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.
[6] Lan Nguyen,et al. Accumulators from Bilinear Pairings and Applications , 2005, CT-RSA.
[7] Mihir Bellare,et al. GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks , 2002, CRYPTO.
[8] C. Pandu Rangan,et al. Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings , 2013, SPACE.
[9] Lan Nguyen. Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and Group Membership Revocation , 2005, IACR Cryptol. ePrint Arch..