B. Barak, How to go beyond the black-box simulation barrier, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.106-115, 2001.
DOI : 10.1109/SFCS.2001.959885

M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme, Journal of Cryptology, vol.16, issue.3, pp.185-215, 2003.
DOI : 10.1007/s00145-002-0120-1

M. Bellare and G. Neven, Transitive Signatures: New Schemes and Proofs, IEEE Transactions on Information Theory, vol.51, issue.6, pp.2133-2151, 2005.
DOI : 10.1109/TIT.2005.847697

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.7399

M. Bellare and A. Palacio, GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks, Lect. Notes Comput. Sci, vol.2442, pp.162-177, 2002.
DOI : 10.1007/3-540-45708-9_11

M. Bellare and R. Sandhu, The Security of Practical Two-Party RSA Signature Schemes, 2001.

A. Boldyreva, Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme, 6th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2003, pp.31-46, 2003.
DOI : 10.1007/3-540-36288-6_3

D. Boneh, B. Lynn, and H. Shacham, Short Signatures from the Weil Pairing, J. Cryptology, vol.17, issue.4, pp.297-319, 2004.

D. R. Brown, Irreducibility to the One-More Evaluation Problems: More May Be Less, 2007.

D. R. Brown and R. P. Gallant, The Static Diffie-Hellman Problem, 2004.

D. Chaum, Blind Signatures for Untraceable Payments Advances in Cryptology -Crypto'82, pp.199-203, 1983.

D. Chaum and H. Van-antwerpen, Undeniable Signatures, Undeniable Signatures. Lect. Notes Comput. Sci, vol.435, pp.212-216, 1990.
DOI : 10.1007/0-387-34805-0_20

L. C. Guillou and J. Quisquater, A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory, Advances in Cryptology -Eurocrypt'88, pp.123-128, 1988.
DOI : 10.1007/3-540-45961-8_11

S. Micali and R. L. Rivest, Transitive Signature Schemes, Transitive Signature Schemes. Lect. Notes Comput. Sci, vol.2271, pp.236-243, 2002.
DOI : 10.1007/3-540-45760-7_16

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7893

T. Okamoto and D. Pointcheval, The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, pp.104-118, 1992.
DOI : 10.1007/3-540-44586-2_8

P. Paillier and D. Vergnaud, Discrete-Log-Based Signatures May Not Be Equivalent??to??Discrete??Log, Lect. Notes Comput. Sci, vol.3788, pp.1-20, 2005.
DOI : 10.1007/11593447_1

URL : https://hal.archives-ouvertes.fr/hal-00019352

D. Pointcheval and J. Stern, Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol.13, issue.3, pp.361-396, 2000.
DOI : 10.1007/s001450010003

C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991.
DOI : 10.1007/BF00196725

URL : http://publikationen.ub.uni-frankfurt.de/files/4280/schnorr.pdf

M. Tompa and H. Wol, Random self-reducibility and zero knowledge interactive proofs of possession of information, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp.472-482, 1987.
DOI : 10.1109/SFCS.1987.49