Sciweavers

55 search results - page 3 / 11
» Design Validations for Discrete Logarithm Based Signature Sc...
Sort
View
ISPEC
2009
Springer
14 years 4 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
JOC
2006
116views more  JOC 2006»
13 years 9 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
SCN
2010
Springer
116views Communications» more  SCN 2010»
13 years 8 months ago
Provably Secure Convertible Undeniable Signatures with Unambiguity
Abstract. This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model an...
Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata
DCC
2001
IEEE
14 years 9 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler
ACNS
2003
Springer
80views Cryptology» more  ACNS 2003»
14 years 1 months ago
A Threshold GQ Signature Scheme
We proposed the first threshold GQ signature scheme. The scheme is unforgeable and robust against any adaptive adversary if the base GQ signature scheme is unforgeable under the c...
Li-Shan Liu, Cheng-Kang Chu, Wen-Guey Tzeng