Concurrent Blind Signatures Without Random Oracles
暂无分享,去创建一个
[1] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[2] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[3] Rafail Ostrovsky,et al. Security of blind digital signatures , 1997 .
[4] Jan Camenisch,et al. Efficient Blind Signatures Without Random Oracles , 2004, SCN.
[5] Ivan Damgård,et al. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model , 2000, EUROCRYPT.
[6] Jacques Stern,et al. New blind signatures equivalent to factorization (extended abstract) , 1997, CCS '97.
[7] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[8] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[9] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[10] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[11] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.
[12] Chanathip Namprempre,et al. The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme , 2002, Financial Cryptography.
[13] Masayuki Abe,et al. A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures , 2001, EUROCRYPT.
[14] Chanathip Namprempre,et al. On the (Im)possibility of Blind Message Authentication Codes , 2006, CT-RSA.
[15] Atsushi Fujioka,et al. A Practical Secret Voting Scheme for Large Scale Elections , 1992, AUSCRYPT.
[16] Tatsuaki Okamoto,et al. Provably Secure Partially Blind Signatures , 2000, CRYPTO.
[17] Tatsuaki Okamoto,et al. Efficient Blind and Partially Blind Signatures Without Random Oracles , 2006, IACR Cryptol. ePrint Arch..
[18] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[19] Amit Sahai,et al. Pseudonym Systems , 1999, Selected Areas in Cryptography.
[20] Jacques Stern,et al. Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.
[21] Birgit Pfitzmann,et al. How To Break and Repair A "Provably Secure" Untraceable Payment System , 1991, CRYPTO.
[22] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[23] Masayuki Abe,et al. Provably Secure Fair Blind Signatures with Tight Revocation , 2001, ASIACRYPT.
[24] Jan Camenisch,et al. Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.
[25] Ivan Damgård,et al. Parallel Divertibility of Proofs of Knowledge (Extended Abstract) , 1994, EUROCRYPT.
[26] Ivan Damgård,et al. Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals , 1988, CRYPTO.
[27] Masayuki Abe,et al. How to Date Blind Signatures , 1996, ASIACRYPT.
[28] Rafail Ostrovsky,et al. Security of Blind Digital Signatures (Extended Abstract) , 1997, CRYPTO.
[29] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[30] David Pointcheval,et al. Strengthened Security for Blind Signatures , 1998, EUROCRYPT.
[31] Kazuo Ohta,et al. Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility , 1990, EUROCRYPT.