Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders

Author： Biehl Ingrid   Paulus Sacher   Takagi Tsuyoshi  

Publisher： Springer Publishing Company

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.31, Iss.2, 2004-02, pp. : 99-123

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

RSA-Based Undeniable Signatures

By Gennaro Rosario  

Journal of Cryptology, Vol. 20, Iss. 3, 2007-07 ,pp. : 394-394

Springer Publishing Company

Access to resources Recommend Favorite

Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem

By Nyberg Kaisa   Rueppel Rainer A.  

Designs, Codes and Cryptography, Vol. 7, Iss. 1-2, 1996-01 ,pp. : 61-81

Springer Publishing Company

Access to resources Recommend Favorite

On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order

By Girault Marc  

Journal of Cryptology, Vol. 19, Iss. 4, 2006-10 ,pp. : 463-487

Springer Publishing Company

Access to resources Recommend Favorite

Analysis on arithmetic schemes. II

By  

Journal of K-Theory, Vol. 5, Iss. 3, 2010-06 ,pp. : 437-557

Cambridge University Press

Access to resources Recommend Favorite

Short Undeniable Signatures Based on Group Homomorphisms

By Monnerat Jean  

Journal of Cryptology, Vol. 24, Iss. 3, 2011-07 ,pp. : 545-587

Springer Publishing Company

Access to resources Recommend Favorite