Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures
暂无分享,去创建一个
[1] Ramarathnam Venkatesan,et al. Progress in Cryptology - INDOCRYPT 2005, 6th International Conference on Cryptology in India, Bangalore, India, December 10-12, 2005, Proceedings , 2005, INDOCRYPT.
[2] Ronald Cramer,et al. Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings , 2005, EUROCRYPT.
[3] Tsz Hon Yuen,et al. (Convertible) Undeniable Signatures Without Random Oracles , 2007, ICICS.
[4] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[5] Silvio Micali,et al. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design , 1986, CRYPTO.
[6] Andrew Odlyzko,et al. Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.
[7] David Chaum,et al. Convertible Undeniable Signatures , 1990, CRYPTO.
[8] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[9] D. Boneh,et al. Short Signatures from the Weil Pairing , 2001, Journal of Cryptology.
[10] Robert H. Deng,et al. Public Key Cryptography – PKC 2004 , 2004, Lecture Notes in Computer Science.
[11] Fabien Laguillaumie,et al. Short Undeniable Signatures Without Random Oracles: The Missing Link , 2005, INDOCRYPT.
[12] Aggelos Kiayias,et al. Traceable Signatures , 2004, EUROCRYPT.
[13] Bart Preneel,et al. Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .
[14] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[15] Jacques Stern,et al. Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.
[16] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[17] Reihaneh Safavi-Naini,et al. An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.
[18] Jan Camenisch,et al. Confirmer Signature Schemes Secure against Adaptive Adversaries , 2000, EUROCRYPT.
[19] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.
[20] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[21] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[22] Joan Feigenbaum,et al. Advances in Cryptology-Crypto 91 , 1992 .
[23] Ernest F. Brickell,et al. Advances in Cryptology — CRYPTO’ 92 , 2001, Lecture Notes in Computer Science.
[24] Javier Herranz,et al. KEM/DEM: Necessary and Sufficient Conditions for Secure Hybrid Encryption , 2006 .
[25] David Chaum,et al. Undeniable Signatures , 1989, CRYPTO.
[26] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[27] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.