A Provably Secure Scheme for Restrictive Partially Blind Signatures
暂无分享,去创建一个
[1] Claus-Peter Schnorr,et al. Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys , 2001, Inf. Process. Lett..
[2] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.
[3] V. Nechaev. Complexity of a determinate algorithm for the discrete logarithm , 1994 .
[4] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[5] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[6] Masayuki Abe,et al. How to Date Blind Signatures , 1996, ASIACRYPT.
[7] Marc Fischlin,et al. A Note on Security Proofs in the Generic Model , 2000, ASIACRYPT.
[8] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[9] Claus-Peter Schnorr,et al. Security of Blind Discrete Log Signatures against Interactive Attacks , 2001, ICICS.
[10] Stefan A. Brands,et al. An Efficient Off-line Electronic Cash System Based On The Representation Problem. , 1993 .
[11] Stefan BrandsCWI,et al. Untraceable Oo-line Cash in Wallets with Observers , 1993 .
[12] Colin Boyd,et al. A Provably Secure Restrictive Partially Blind Signature Scheme , 2002, Public Key Cryptography.
[13] Markus Jakobsson,et al. Security of Signed ElGamal Encryption , 2000, ASIACRYPT.
[14] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[15] Tatsuaki Okamoto,et al. Provably Secure Partially Blind Signatures , 2000, CRYPTO.
[16] Jacques Stern,et al. Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.