[1] Balfanz D, Durfee G, Shankar N, et al. Secret Handshakes from Pairing-based Key Agreements[C]//Proc. of IEEE Symposium on Security and Privacy. Berkeley, USA: IEEE Computer Society, 2003. [2] Castelluccia C, Jarecki S, Tsudik G. Secret Handshakes from Ca-oblivious Encryption[C]//Proc. of AsiaCrypt’04. [S. 1.]: Springer-Verlag, 2004. [3] 赵春明, 葛建华, 李新国. 一种不经意的基于数字签名的电子信封[J]. 华中科技大学学报: 自然科学版, 2005, 33(4): 17-19. [4] Zhou Lan, Susilo W, Mu Y. Three-round Secret Handshakes Based on Elgamal and DSA[C]//Proc. of ISPEC’06. [S. 1.]: Springer-Verlag, 2006. [5] Xu Shouhuai, Yung M. K-anonymous Secret Handshakes with Reusable Credentials[C]//Proc. of Conf. on Computer and Communications Security. Washington D. C., USA: ACM Press, 2004. [6] Huang Hai, Cao Zhenfu. A Novel and Efficient Unlinkable Secret Handshake Scheme[J]. IEEE Communications Letters, 2009, 13(5): 363-365. [7] Su Renwang. On the Security of a Novel and Efficient Unlinkable Secret Handshakes Scheme[J]. IEEE Communications Letters, 2009, 13(9): 712-713. [8] Gu Jie, Xue Zhi. An Improved Efficient Secret Handshakes Scheme with Unlinkability[J]. IEEE Communication Letters, 2011, 15(2): 259-261. [9] Wen Yamin, Zhang Fangguo, Xu Lingling. Unlinkable Secret Handshakes from Message Recovery Signature[J]. Chinese Journal of Electronics, 2010, 19(4): 705-709. [10] Waters B. Efficient Identity-based Encryption Without Random Oracles[C]//Proc. of EUROCRYPT’05. [S. 1.]: Springer-Verlag, 2005. [11] Ateniese G, Blanton M, Kirsch J. Secret Handshakes with Dynamic and Fuzzy Matching[C]//Proc. of Network and Distributed System Security Symposium. San Diego, USA: [s. n.], 2007: 159-177. [12] Mitsunari S, Sakai R, Kasahara M. A New Traitor Tracing[J]. IEICE Transactions on Fundamentals, 2002, E85-A(2): 481-484. [13] Zhang Fangguo, Safavi-Naini R, Susilo W. An Efficient Signature Scheme from Bilinear Pairings and Its Applications[C]//Proc. of PKC’04. [S. 1.]: Springer-Verlag, 2004. [14] Brands S. An Efficient Off-line Electronic Cash System Based on the Representation Problem[R]. Amsterdam, The Netherlands: Centre for Mathematics and Computer Science, Tech. Rep.: CS-R9323, 1993. [15] Belenkiy M, Camenisch J, Chase M, et al. Randomizable Proofs and Delegatable Anonymous Credentdials[C]//Proc. of CRYPTO’09. [S. 1.]: Springer-Verlag, 2009. [16] Camenisch J, Lysyanskaya A. Signature Schemes and Anonymous Credentials from Bilinear Maps[C]//Proc. of CRYPTO’04. [S. 1.]: Springer-Verlag, 2004. [17] Pointcheval D, Stern J. Security Proofs for Signature Schemes[C]//Proc. of EUROCRYPT‘96. [S. 1.]: Springer- Verlag, 1996.
|