2492 search results - page 8 / 499 » On the General Signature Trees |
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
COMCOM
1999
13 years 7 months ago
1999
Undeniable signature is an intriguing concept introduced by Chaum and Antwerpen at Crypto'89. In 1999, Lee and Hwang presented two group-oriented undeniable signature schemes ...
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
FOSSACS
2001
Springer
13 years 12 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
ISW
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...