[1] 卢晓燕. 数码防伪技术发展历程及其前景[J]. 中国防伪报道, 2008(2): 19-24.
Lu Xiaoyan. The Development and Prospect of Digital Anti-counterfeiting Techniques[J]. China Anti-Counterfeiting Report, 2008(2): 19-24.
[2] 肖鸿, 王宏, 马润年, 等. 随机预言模型下可证安全的门限FFS签名方案[J]. 西安电子科技大学学报, 2011, 38(6): 130-133.
Xiao Hong, Wang Hong, Ma Runnian, et al. Provably Secure Threshold FFS Signature Scheme in the Random Oracle Model[J]. Journal of Xidian Univeristy, 2011, 38(6): 130-133.
[3] Abe M, Groth J, Haralambiev K, et al. Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups[C]//Advances in Cryptology-Crypto 2011: LNCS 6841. Santa Barbara: Springer-Verlag, 2011: 649-666.
[4] Garg S, Rao V, Sahai A, et al. Round Optimal Blind Signatures[C]//Advances in Cryptology-Crypto 2011: LNCS 6841 . Santa Barbara: Springer-Verlag, 2011: 630-648.
[5] Chaum D, van Antwerpen H. Undeniable Signatures[C]//Advances in Cryptology-Crypto 1989: LNCS 435. Santa Barbara: Springer-Verlag, 1989: 212-216.
[6] Krawczyk H, Rabin T. Chameleon Hashing and Signatures[C]//Proc of the Network and Distributed System Security Symposium (NDSS 2000). San Diego: The Internet Society, 2000: 143-154.
[7] Ateniese G, de Medeiros B. Identity-based Chameleon Hash and Applications[C]//Proc of the 8th International Conference on Financial Cryptography (FC 2004): LNCS 3110. Key West: Springer-Verlag, 2004: 164-180.
[8] Chen X F, Zhang F, Kim K. Chameleon Hashing Without Key Exposure[C]//Proceeding of the 7th International Conference on Information Security (ISC 2004): LNCS 3225. Palo Alto: Springer-Verlag, 2004: 87-98.
[9] Ateniese G, de Medeiros B. On the Key Exposure Problem in Chameleon Hashes[C]//Proc of the 4th International Conference on Security in Communication Networks (SCN 2004): LNCS 3352. Amalfi: Springer-Verlag, 2005: 165-179.
[10] Chen X, Zhang F, Tian H, et al. Key-exposure Free Chameleon Hashing and Signatures Based on Discrete Logarithm Systems[J]. Computers and Electrical Engineering, 2011, 37(4): 614-623. |