On the Impossibility of Three-Move Blind Signature Schemes
暂无分享,去创建一个
[1] G. Glauberman. Proof of Theorem A , 1977 .
[2] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[3] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[4] The final step. , 1987, Food management.
[5] Russell Impagliazzo,et al. Limits on the Provable Consequences of One-way Permutations , 1988, CRYPTO.
[6] Oded Goldreich,et al. A Note on Computational Indistinguishability , 1990, Inf. Process. Lett..
[7] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[8] Rafail Ostrovsky,et al. Security of Blind Digital Signatures (Extended Abstract) , 1997, CRYPTO.
[9] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[10] Rafail Ostrovsky,et al. Security of blind digital signatures , 1997 .
[11] Daniel R. Simon,et al. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? , 1998, EUROCRYPT.
[12] Kaisa Nyberg,et al. Advances in Cryptology — EUROCRYPT'98 , 1998 .
[13] Dan Boneh,et al. Breaking RSA May Not Be Equivalent to Factoring , 1998, EUROCRYPT.
[14] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[15] R. Venkatesan,et al. Breaking RSA May Be Easier Than Factoring , 1999 .
[16] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[17] Ran Canetti,et al. Resettable Zero-Knowledge , 1999, IACR Cryptol. ePrint Arch..
[18] Ran Canetti,et al. Resettable zero-knowledge (extended abstract) , 2000, STOC '00.
[19] Masayuki Abe,et al. A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures , 2001, EUROCRYPT.
[20] Jean-Sébastien Coron,et al. Optimal Security Proofs for PSS and Other Signature Schemes , 2002, EUROCRYPT.
[21] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[22] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[23] Yehuda Lindell,et al. Strict polynomial-time in simulation and extraction , 2002, STOC '02.
[24] Yvo Desmedt. Public Key Cryptography — PKC 2003 , 2002, Lecture Notes in Computer Science.
[25] Alexandra Boldyreva,et al. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .
[26] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[27] Chanathip Namprempre,et al. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.
[28] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[29] Jan Camenisch,et al. Efficient Blind Signatures Without Random Oracles , 2004, SCN.
[30] Moni Naor,et al. Concurrent zero-knowledge , 2004, JACM.
[31] Aggelos Kiayias,et al. Concurrent Blind Signatures Without Random Oracles , 2006, SCN.
[32] Daniel R. L. Brown. What Hashes Make RSA-OAEP Secure? , 2006, IACR Cryptol. ePrint Arch..
[33] Jorge Luis Villar,et al. Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption , 2006, ASIACRYPT.
[34] Tatsuaki Okamoto,et al. Efficient Blind and Partially Blind Signatures Without Random Oracles , 2006, IACR Cryptol. ePrint Arch..
[35] Kefei Chen,et al. Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006, Proceedings , 2006, ASIACRYPT.
[36] Marc Fischlin,et al. Round-Optimal Composable Blind Signatures in the Common Reference String Model , 2006, CRYPTO.
[37] Yehuda Lindell,et al. Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions , 2007, TCC.
[38] Daniel R. L. Brown,et al. Irreducibility to the One-More Evaluation Problems: More May Be Less , 2007, IACR Cryptol. ePrint Arch..
[39] Jonathan Katz,et al. Universally-Composable Two-Party Computation in Two Rounds , 2007, CRYPTO.
[40] Abhi Shelat,et al. Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.
[41] Moni Naor. Advances in Cryptology - EUROCRYPT 2007, 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007, Proceedings , 2007, EUROCRYPT.
[42] A. J. Menezes,et al. Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings , 2007, CRYPTO.
[43] Aggelos Kiayias,et al. Equivocal Blind Signatures and Adaptive UC-Security , 2008, TCC.
[44] Tal Malkin. Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings , 2008, CT-RSA.
[45] Emmanuel Bresson,et al. Separation Results on the "One-More" Computational Problems , 2008, CT-RSA.
[46] Markus Rückert,et al. Lattice-based Blind Signatures , 2010, Algorithms and Number Theory.
[47] Masayuki Abe,et al. A Framework for Universally Composable Non-committing Blind Signatures , 2009, ASIACRYPT.
[48] Marc Fischlin,et al. Security of Blind Signatures under Aborts , 2009, Public Key Cryptography.
[49] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.