參考文獻 |
[1] A. Lysyanskayak, ”Signature Schemes and Applications to Cryptographic Protocol
Design,” PhD thesis, Massachusetts Institute of Technology, 2002.
[2] A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, ”On Monotone
Formula Closure of SZK,” Proc. of the 35th Annual Symposium on Foundations
of Computer Science - SFCS ′94, pp. 454--465, 1994.
[3] A. De Santis, G. Di Crescenzo, and G. Persiano, ”Communication-Ecient
Anonymous Group Identication,” Proc. of the 5th ACM Conference on Com-
puter and Communications Security - CCS ′98 pp. 73--82, 1998.
[4] A. Miyaji, M. Nakabayashi, and S. Takano, ”New Explicit Conditions of Elliptic
Curve Traces for FR-Reduction,” IEICE Trans. Fundamentals, Vol. E84-A, No.
5, pp. 1234--1243, 2001.
[5] C. Paquin and S. Brands, ”U-Prove Cryptographic Specification v1.0,” Mi-
crosoft Corporation, 2010.
[6] C. Paquin and G. Zaverucha, ”U-Prove Cryptographic Specification V1.1 (Revision
3),” Microsoft Corporation, 2013.
[7] D. Chaum, ”Blind Signatures for Untraceable Payments,” Proc. of CRYPTO
′83, LNCS 82, pp. 199--203, 1983.
[8] D. Chaum, ”Security without Identication: Transaction systems to Make Big
Brother Obsolete,” Communications of the ACM, Vol. 28, Issue 10, pp. 1030--
1044, 1985.
[9] D. Chaum and E. van Heyst, ”Group Signatures,” Proc. of EUROCRYPT ′91,
LNCS 547, pp. 257--265, 1991.
[10] D. Chaum and H. Van Antwerpen, ”Undeniable Signatures,” Proc. of CRYPTO
′90, LNCS 435, pp. 212--216, 1990.
[11] D. Boneh, C. Gentry, B. Lynn, and H. Shacham, ”Aggregate and Verifiably
Encrypted Signatures from Bilinear Maps,” Proc. of EUROCRYPT ′03, LNCS
2656, pp. 416--432, 2003.
[12] D. Boneh and X. Boyen, ”Short Signatures without Random Oracles,” Proc. of
EUROCRYPT ′04, LNCS 3027, pp. 56--73, 2004.
[13] D. Boneh and H. Shacham, ”Group Signatures with Verifier-Local Revocation,”
Proc. of the 11th ACM conference on Computer and Communications Security
- CCS ′04, pp. 168--177, 2004.
[14] D. Boneh, X. Boyen, and H. Shacham, ”Short Group Signatures,” Proc. of
CRYPTO ′04, LNCS 3152, pp. 41--55, 2004.
[15] D. Cooper, S. Santesson, S. Farrell, S. Boeyen, R. Housley, and W. Polk, ”Internet
X.509 Public Key Infrastructure Certicate and Certificate Revocation
List (CRL) Prole,” In RFC 3280, 2008.
[16] D.X. Song, ”Practical Forward Secure Group Signature Schemes,” Proc. of the
8th ACM conference on Computer and Communications Security - CCS ′01,
pp. 225--234, 2001.
[17] E. R. Verheul, ”Self-Blindable Credential Certificates from the Weil Pairing,”
Proc. of ASIACRYPT ′01, LNCS 2248, pp. 533--551, 2001.
[18] G. Ateniese, D. Song, and G. Tsudik, ”Quasi-Ecient Revocation of Group Signatures,”
Proc. of the 6th International Conference on Financial Cryptography
- FC ′02, LNCS 2357, pp. 183--197, 2002.
[19] G. Ateniese and B. de Medeiros, ”Identity-Based Chameleon Hash and Applications,”
Proc. of the 8th International Conference on Financial Cryptography
- FC ′04, LNCS 3110, pp. 164--180, 2004.
[20] G. Frey, M. Muller, and H. Ruck. ”The Tate Pairing and the Discrete Logarithm
Applied to Elliptic Curve Cryptosystems,” IEEE Transactions on Information
Theory, Vol. 45, Issue. 5, pp. 1717--1718, 1999.
[21] H. Krawczyk and T. Rabin, ”Chameleon Hashing and Signatures,” Proc. of
NDSS ′00, pp. 143--154, 2000.
[22] J. Camenisch and A. Lysyanskaya, ”An Efficient System for Non-transferable
Anonymous Credentials with Optional Anonymity Revocation,” Proc. of EU-
ROCRYPT ′01, LNCS 2045, pp. 93--118, 2001.
[23] J. Camenisch and A. Lysyanskaya, ”Dynamic Accumulators and Application to
Efficient Revocation of Anonymous Credentials,” Proc. of CRYPTO ′02, LNCS
2442, pp. 61--76, 2002.
[24] J. Camenisch and E. Van Herreweghen, ”Design and Implementation of the
Idemix Anonymous Credential System,” Proc. of the 9th ACM Conference on
Computer and Communications Security - CCS ′02, pp. 1030--1044, 2002.
[25] J. Benaloh and M. de Mare, ”One-way Accumulators: A Decentralized Alternative
to Digital Signatures,” Proc. of EUROCRYPT ′93, LNCS 4948, pp. 274--
285, 1993.
[26] J. Camenisch, M. Kohlweiss, and C. Soriente, ”An Accumulator Based on Bilinear
Maps and Efficient Revocation for Anonymous Credentials,” Proc. of PKC
′09, LNCS 5443, pp. 481--500, 2009.
[27] J. Camenisch, M. Kohlweiss, and C. Soriente, ”Solving Revocation with Effi-
cient Update of Anonymous Credentials,” Proc. of the 7th International Con-
ference on Security and Cryptography for Networks - SCN ′10, LNCS 6280,
pp. 454--471, 2010.
[28] M. Jakobsson, ”Blackmailing Using Undeniable Signatures,” Proc. of EURO-
CRYPT ′94, LNCS 950, pp.425--427, 1994.
[29] M. Naor, ”On Cryptographic Assumptions and Challenges,” Proc. of CRYPTO
′03, LNCS 2729, pp. 96--109, 2003.
[30] M. Bellare and P. Rogaway, ”Random Oracles are Practical: A Paradigm for
Designing Efficient Protocols,” Proc. of the 1th ACM Conference on Computer
and Communications Security - CCS ′93, pp. 62--73, 1993.
[31] M. Jakobsson, K. Sako, and R. Impagliazzo, ”Designated Verifier Proofs and
their Applications,” Proc. of EUROCRYPT ′96, LNCS 1070, pp. 143--154, 1996.
[32] M.H. Au, W. Susilo, and Y. Mu, ”Constant-Size Dynamic k-TAA,” Proc. of
the 5th International Conference on Security and Cryptography for Networks -
SCN ′06, LNCS 4116, pp. 111--125, 2006.
[33] P. Persiano and I. Visconti, ”An Anonymous Credential System and a Privacy-
Aware PKI,” Proc. of the 8th Australasian Conference on Information Security
and Privacy - ACISP ′03, LNCS 2727, pp. 27--38, 2003.
[34] P.P. Tsang, M.H. Au, A. Kapadia, and S.W. Smith, ”Blacklistable Anonymous
Credentials: Blocking Misbehaving Users without TTPS,” Proc. of the
14th ACM Conference on Computer and Communications Security - CCS ′07,
pp. 72--80, 2007.
[35] S. Brands, ”Rethinking Public Key Infrastructure and Digital Certicates
Building in Privacy,” PhD thesis, Eindhoven Institute of Technology, 1999.
[36] S. Brands, L. Demuynck, and B. De Decker, ”A Practical System for Globally
Revoking the Unlinkable Pseudonyms of Unknown Users,” Proc. of the 12th
Australasian Conference on Information Security and Privacy - ACISP ′07,
LNCS 4586, pp. 400--415, 2007.
[37] Security Team, Computer Science Dept, ”Specication of the Identity Mixer
Cryptographic Library,” IBM Research, Zurich, 2009.
[38] T. Nakanishi and N. Funabiki, ”Verifier-Local Revocation Group Signature
Schemes with Backward Unlinkability from Bilinear Maps,” Proc. of ASI-
ACRYPT ′05, LNCS 3788, pp. 533--548, 2005.
[39] T. Nakanishi, H. Fujii, Y. Hira, and N. Funabiki, ”Revocable Group Signature
Schemes with Constant Costs for Signing and Verifying,” Proc. of PKC ′09,
LNCS 5443, pp. 463--480, 2009.
[40] V. Miller. ”The Weil Pairing, and Its Efficient Calculation,” Journal of Cryp-
tology, Vol. 17, No. 4, pp. 235--261, 2004.
[41] W. Susilo, F. Zhang, and Y. Mu, ”Identity-Based Strong Designated Verifier
Signature Schemes,” Proc. of the 9th Australasian Conference on Information
Security and Privacy - ACISP ′04, LNCS 3108, pp. 313--324, 2004.
[42] Y. Desmedt and M. Yung, ”Weaknesses with Undeniable Signature Schemes,”
Proc. of EUROCRYPTO ′91, LNCS 547, pp. 205--220, 1991.
[43] Y. Desmedt, C. Goutier, and S.Bengio, ”Special Uses and Abuses of the Fiat-
Shamir Passport Protocol,” Proc. of CRYPTO ′87, LNCS 293, pp. 21--39, 1987. |