Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

Author： Yuen Tsz Hon   Liu Joseph K.   Au Man Ho   Susilo Willy   Zhou Jianying  

Publisher： Oxford University Press

ISSN： 1460-2067

Source： Computer Journal, Vol.56, Iss.4, 2013-04, pp. : 407-421

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

A new signature scheme without random oracles

By Tan Chik How  

International Journal of Security and Networks, Vol. 1, Iss. 3-4, 2006-12 ,pp. : 237-242

Inderscience Publishers

Access to resources Recommend Favorite

A systematic method to design strong designated verifier signature without random oracles

By Tian Haibo   Jiang Zhengtao   Liu Yi   Wei Baodian  

Cluster Computing, Vol. 16, Iss. 4, 2013-12 ,pp. : 817-827

Springer Publishing Company

Access to resources Recommend Favorite

Dynamic attribute-based signcryption without random oracles

By Emura Keita  

International Journal of Applied Cryptography, Vol. 2, Iss. 3, 2012-02 ,pp. : 199-211

Inderscience Publishers

Access to resources Recommend Favorite

Strongly unforgeable ID-based signatures without random oracles

By Sato Chifumi  

International Journal of Applied Cryptography, Vol. 2, Iss. 1, 2010-07 ,pp. : 35-45

Inderscience Publishers

Access to resources Recommend Favorite

Random lattices, threshold phenomena and efficient reduction algorithms

By Akhavi A.  

Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. : 359-385

Elsevier

Access to resources Recommend Favorite