M. Abdalla, J. H. An, M. Bellare, and C. Namprempre, From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security, Lecture Notes in Computer Science, vol.2332, pp.418-433, 2002.
DOI : 10.1007/3-540-46035-7_28

M. Abe, M. Ohkubo, and K. Suzuki, 1-out-of-n Signatures from a Variety of Keys, Advances in Cryptology ? ASIACRYPT 2002, pp.415-432, 2002.
DOI : 10.1007/3-540-36178-2_26

N. Asokan, M. Schunter, and M. Waidner, Optimistic protocols for fair exchange, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.7-17, 1997.
DOI : 10.1145/266420.266426

B. Baum-waidner and M. Waidner, Round-Optimal and Abuse-Free Optimistic Multi-party Contract Signing, Automata, Languages and Programming, 27th International Colloquium, pp.524-535, 2000.
DOI : 10.1007/3-540-45022-X_44

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract), 20th Annual ACM Symposium on Theory of Computing, pp.1-10, 1988.

C. Cachin and J. Camenisch, Optimistic Fair Secure Computation, Lecture Notes in Computer Science, vol.1880, pp.93-111, 2000.
DOI : 10.1007/3-540-44598-6_6

D. Chaum, C. Crépeau, and I. Damgård, Multiparty unconditionally secure protocols (extended abstract), 20th Annual ACM Symposium on Theory of Computing, pp.11-19, 1988.

L. Chen, C. Kudla, and K. G. Paterson, Concurrent Signatures, Lecture Notes in Computer Science, vol.3027, pp.287-305, 2004.
DOI : 10.1007/978-3-540-24676-3_18

R. Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract), Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp.364-369, 1986.

T. Elgamal, A public key cryptosystem and a signature scheme based on discrete logarithms Advances in Cryptology ? CRYPTO'84, Lecture Notes in Computer Science, vol.19623, pp.10-18, 1984.

U. Feige, A. Fiat, and A. Shamir, Zero-knowledge proofs of identity, 19th Annual ACM Symposium on Theory of Computing, pp.210-217, 1987.
DOI : 10.1007/BF02351717

J. A. Garay, M. Jakobsson, and P. D. Mackenzie, Abuse-Free Optimistic Contract Signing, Lecture Notes in Computer Science, vol.1666, pp.449-466, 1999.
DOI : 10.1007/3-540-48405-1_29

J. A. Garay, P. D. Mackenzie, M. Prabhakaran, and K. Yang, Resource Fairness and Composability of Cryptographic Protocols, TCC 2006: 3rd Theory of Cryptography Conference, pp.404-428, 2006.
DOI : 10.1007/11681878_21

M. Girault, G. Poupard, and J. Stern, On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order, Journal of Cryptology, vol.19, issue.4, pp.463-487, 2006.
DOI : 10.1007/s00145-006-0224-0

O. Goldreich, A simple protocol for signing contracts Advances in Cryptology, Proceedings of CRYPTO '83, pp.133-136, 1983.

O. Goldreich, Foundations of Cryptography: Basic Applications, 2004.

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, 19th Annual ACM Symposium on Theory of Computing, pp.218-229, 1987.

S. Goldwasser and L. A. Levin, Fair Computation of General Functions in Presence of Immoral Majority, Lecture Notes in Computer Science, vol.537, pp.77-93, 1991.
DOI : 10.1007/3-540-38424-3_6

S. D. Gordon, C. Hazay, J. Katz, and Y. Lindell, Complete fairness in secure two-party computation, 40th Annual ACM Symposium on Theory of Computing, pp.413-422, 2008.

P. Horster, H. Petersen, and M. Michels, Meta-El-Gamal signature schemes, ACM CCS 94: 2nd Conference on Computer and Communications Security, pp.96-107

M. Jakobsson, K. Sako, and R. Impagliazzo, Designated Verifier Proofs and Their Applications, Advances in Cryptology ? EUROCRYPT'96, pp.143-154, 1996.
DOI : 10.1007/3-540-68339-9_13

A. Y. Lindell, Legally-Enforceable Fairness in Secure Two-Party Computation, Lecture Notes in Computer Science, vol.4964, pp.121-137, 2008.
DOI : 10.1007/978-3-540-79263-5_8

S. Micali, Simple and fast optimistic protocols for fair electronic exchange, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.12-19, 2003.
DOI : 10.1145/872035.872038

B. Pinkas, Fair Secure Two-Party Computation, Lecture Notes in Computer Science, vol.2656, pp.87-105, 2003.
DOI : 10.1007/3-540-39200-9_6

D. Pointcheval and J. Stern, Security Proofs for Signature Schemes, Lecture Notes in Computer Science, vol.1070, pp.387-398, 1996.
DOI : 10.1007/3-540-68339-9_33

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

R. L. Rivest, A. Shamir, and Y. Tauman, How to Leak a Secret, Advances in Cryptology ? ASIACRYPT 2001, pp.552-565, 2001.
DOI : 10.1007/3-540-45682-1_32

C. P. Schnorr, Efficient Identification and Signatures for Smart Cards, Lecture Notes in Computer Science, vol.435, pp.239-252, 1990.
DOI : 10.1007/0-387-34805-0_22

Y. Seurin, On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model, Lecture Notes in Computer Science, vol.7237, pp.554-571, 2012.
DOI : 10.1007/978-3-642-29011-4_33

A. C. Yao, How to generate and exchange secrets (extended abstract) In: 27th Annual Symposium on Foundations of Computer Science, pp.162-167, 1986.