Toward a generic construction of universally convertible undeniable signatures from pairing-based signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5365 LNCS, Issue , 2008, Pages 145-157

  El Aimani, Laila ^a  

^a Rheinische Friedrich Wilhelms Universität   (Germany)

Author keywords

Generic construction; Pairing based signatures; Undeniable signatures

Indexed keywords

ACCESS CONTROL; AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

DIGITAL SIGNATURES; GENERIC CONSTRUCTION; PAIRING-BASED SIGNATURES; SECURITY MODELING; SIGNATURE SCHEMES; UNDENIABLE SIGNATURES;

CRYPTOGRAPHY;

EID: 58549086412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89754-5_12     Document Type: Conference Paper

References (16)

1. Boneh, D., Boyen, X.: Short Signatures Without Random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56-73. Springer, Heidelberg (2004)
2. Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. J. Cryptology 17(4), 297-319 (2004)
3. Boyar, J., Chaum, D., Damgård, I.B., Pedersen, T.B.: Convertible undeniable signatures. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 189-205. Springer, Heidelberg (1991)
4. Rackoff, C., Simon, D.R.: Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In: Feigenbaum. J. (ed.) CRYPTO 1991. LNCS. vol. 576, pp. 433-444. Springer, Heidelberg (1992)
5. Camenisch, J., Michels, M.: Confirmer Signature Schemes Secure against Adaptative Adversaries. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 243-258. Springer, Heidelberg (2000)
6. Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126-144. Springer. Heidelberg (2003)
7. Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89-105. Springer, Heidelberg (1993)
8. Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212-216. Springer, Heidelberg (1990)
9. El Gamal. T.: A Public Key Cryptosystem and a Signature Scheme based on Discrete Logarithms. IEEE Trans. Inf. Theory 31. 469-472 (1985)
10. Goldreich, O., Micali, S., Wigderson, A.: How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 171-185. Springer, Heidelberg (1987)
11. Herranz, J., Hofheinz, D., Kiltz, E.: KEM/DEM: Necessary and Sufficient Conditions for secure Hybrid Encryption (August 2006). http://eprint.iacr.org/ 2006/265.pdf
12. Laguillaumie, F., Vergnaud, D.: Short Undeniable Signatures Without Random Oracles: the Missing Link. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS. vol. 3797, pp. 283-296. Springer, Heidelberg (2005)
13. Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. "(ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
14. Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS. vol. 3494, pp. 114-127. Springer, Heidelberg (2005)
15. Yuen. T., Au. M.H., Liu, J.K., Susilo. W. (Convertible) Undeniable Signatures Without Random Oracles. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 83-97. Springer, Heidelberg (2007)
16. Zhang, F., Safavi-Naini, R., Susilo, W.: An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao. F., Deng. R., Zhou. J. (eds.) PKC 2004. LNCS. vol. 2947. pp. 277-290. Springer, Heidelberg (2004)