743 search results - page 6 / 149 » Secure Signature Schemes based on Interactive Protocols |
ESORICS
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. An oblivious signature with n keys (or messages) is a signature that the recipient can choose one of n keys (or messages) to get signed while the signer cannot find out o...
ISPEC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control ...
CTRSA
2005
Springer
14 years 1 months ago
2005
Springer
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
ESORICS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
IACR
2011
12 years 7 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...