Sciweavers

743 search results - page 15 / 149
» Secure Signature Schemes based on Interactive Protocols
Sort
View
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
14 years 26 days ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
IJNSEC
2008
112views more  IJNSEC 2008»
13 years 7 months ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
ICICS
2005
Springer
14 years 1 months ago
Generic Construction of (Identity-Based) Perfect Concurrent Signatures
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not bindi...
Sherman S. M. Chow, Willy Susilo
ICWE
2005
Springer
14 years 1 months ago
Secure Web Forms with Client-Side Signatures
Abstract. The World Wide Web is evolving from a platform for information access into a platform for interactive services. The interaction of the services is provided by forms. Some...
Mikko Honkala, Petri Vuorimaa
ASIACRYPT
1999
Springer
13 years 11 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan