Optimization of the MOVA undeniable signature scheme

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

Volumn 3715 LNCS, Issue , 2005, Pages 196-209

  Monnerat, Jean ^a   Oswald, Yvonne Anne ^b   Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

Optimization; Undeniable signatures

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; OPTIMIZATION; SECURITY OF DATA;

HOMOMORPHISMS; QUARTIC RESIDUE SYMBOL; UNDENIABLE SIGNATURES;

CRYPTOGRAPHY;

EID: 33646186049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_14     Document Type: Conference Paper

References (18)

1. D. Chaum and H. van Antwerpen, Undeniable Signatures, Advances in Cryptology - Crypto '89, LNCS 435, pp. 212-217, Springer, 1989.
2. I.B. Damgård and G.S. Frandsen, Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers, FCT '03, LNCS 2751, pp. 109-117, Springer, 2003.
3. H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics 138, Springer, 2000.
4. S. Garg, How to optimize C/C++ Source - Performance Programming, 2002, http://bdn.borland.com/article/0,1410,28278,00.html.
5. R. Gennaro, T. Rabin, and H. Krawczyk, RSA-Based Undeniable Signatures, Journal of Cryptology, 13(4), pp. 397-416, Springer, 2000.
6. The GNU Multiple Precision Arithmetic Library, http://www.swox.com/gmp/.
7. K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory: Second Edition, Graduate Texts in Mathematics 84, Springer, 1990.
8. M.E. Lee, Optimization of Computer Programs in C, 2001, http://vision.eng.shu.ac.uk/bala/c/c/optimisation/1/optimization.html.
9. V. Lefèvre, Entiers de Gauss (sujet d'étude XU'), 1993, http://www.vine17.org/math/index.fr.html.
10. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
11. S.M. Meyer and J.P. Sorendson, Efficient Algorithms for Computing the Jacobi Symbol, Journal of Symbolic Computation 26(4), pp. 509-523, 1998.
12. 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.
13. J. Monnerat and S. Vaudenay, Generic Homomorphic Undeniable Signatures, Advances in Cryptology - Asiacrypt '04, LNCS 3329, pp. 354-371, Springer, 2004.
14. 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(2), pp. 120-126, 1978.
15. V. Stinner, 2003, frequence_cpu.h, frequence_cpu.c, http://www.haypocal. com/.
16. A. Weilert, (1+i)-ary GCD Computation in Z[i] is an analogue to the Binary GCD Algorithm, Journal of Symbolic Computation 30(5), pp. 605-617, 2000.
17. A. Weilert, Asymptotically fast GCD Computation in Z[i], Algorithmic Number Theory, LNCS 1838, pp. 595-613, Springer, 2000.
18. A. Weilert, Fast Computation of the Biquadratic Residue Symbol, Journal of Number Theory 96, pp. 133-151, 2002.