Generic homomorphic undeniable signatures

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

Volumn 3329, Issue , 2004, Pages 354-371

  Monnerat, Jean ^a   Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTHENTICATION; CRYPTOGRAPHY; INTERPOLATION; SECURITY OF DATA;

COMPUTATIONAL PROBLEM; CRYPTOGRAPHIC PROBLEMS; DISCRETE LOGARITHMS; INTERPOLATION PROBLEMS; PROVABLY SECURE; RANDOM ORACLE MODEL; UNDENIABLE SIGNATURE; UNDENIABLE SIGNATURE SCHEME;

NETWORK SECURITY;

EID: 35048904095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30539-2_25     Document Type: Article

References (21)

1. R. Andersen, S. Vaudenay, B. Preneel, K. Nyberg, The Newton Channel, Proc. First International Workshop on Information Hiding, Cambridge, UK, LNCS 1174, pp. 151-156, Springer, 1996.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 14-23, 1992.
3. L. Babai, L. Fortnow, L. Levin and M. Szegedy, Checking Computations in Polylogarithmic Time, Proc. 23rd ACM Symp. on Theory of Computing, pp. 21-31, 1991.
4. I. Biehl, S. Paulus and T. Takagi, Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders, Conference on The Mathematics of Public-Key Cryptography, Toronto, 1999.
5. J. Boyar, D. Chaum, I. Damgård and T. Pedersen, Convertible Undeniable Signatures, Advances in Cryptology - Crypto '90, LNCS 537, pp. 189-205, Springer, 1990.
6. E. Bresson, D. Catalane and D. Pointcheval, A Simple Public-Key Cryptosytem with a Double Trapdoor Decryption Mechanism and Its applications, Advances in Cryptology - Asiacrypt '03, LNCS 2894, pp. 37-54, Springer, 2003.
7. D. Chaum, Zero-Knowledge Undeniable Signatures, Advances in Cryptology - Eurocrypt '90, LNCS 473, pp. 458-464, Springer, 1990.
8. D. Chaum, Designated Confirmer Signatures, Advances in Cryptology - Eurocrypt '94, LNCS 950, pp. 86-91, Springer, 1994.
9. D. Chaum and H. van Antwerpen, Undeniable Signatures, Advances in Cryptology - Crypto '89, LNCS 435, pp. 212-217, Springer, 1989.
10. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, Mc-Graw Hill, 1990.
11. I. Damgard and T. Pedersen, New Convertible Undeniable Signatures Schemes, Advances in Cryptology - Eurocrypt '96, LNCS 1070, pp. 372-386, Springer, 1996.
12. Y. Desmedt and M. Yung, Weaknesses of Undeniable Signature Schemes, Advances in Cryptology - Crypto '91, LNCS 576, pp. 205-220, Springer, 1991.
13. W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. IT-22, pp. 644-654, 1976.
14. A. Fiat, A. Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology - Crypto '86, LNCS 263, pp. 186-194, Springer, 1987.
15. R. Gennaro, T. Rabin and H. Krawczyk, RSA-Based Undeniable Signatures, Journal of Cryptology, 13, pp. 397-416, Springer, 2000.
16. S. Goldwasser and S. Micali, Probabilistic Encryption, Journal of Computer and System Sciences, 28, pp. 270-299, 1984.
17. M. Jakobsson, K. Sako and R. Impagliazzo, Designated Verifier Proofs and Their Applications, Advances in Cryptology - Eurocrypt '96, LNCS 1070, pp. 143-154, 1996.
18. B. Libert and J.-J. Quisquater, Identity Based Undeniable Signatures, Proc. RSA Crypto Track '04, LNCS 2964, pp. 112-125, Springer, 2004.
19. J. Monnerat and S. Vaudenay, Undeniable Signatures Based on Characters: How to Sign with One Bit, PKC '04, LNCS 2947, pp. 69-85, Springer, 2004.
20. P. Paillier, Public-Key Cryptosystems Based on Composite Degree 'Residuosity Classes, Advances in Cryptology - Eurocrypt '99, LNCS 1592, pp. 223-238, Springer, 1999.
21. R. L. Rivest, A. Shamir and L. M. Adleman, A Method for Obtaining Digital Signatures and Public-key Cryptosystem, Communications of the ACM, vol. 21, pp. 120-126, 1978.