Sciweavers

266 search results - page 22 / 54
» Tracing-by-Linking Group Signatures
Sort
View
INDOCRYPT
2005
Springer
14 years 4 months ago
Short Undeniable Signatures Without Random Oracles: The Missing Link
Abstract. We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embed...
Fabien Laguillaumie, Damien Vergnaud
JNW
2006
149views more  JNW 2006»
13 years 11 months ago
Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
Shidi Xu, Yi Mu, Willy Susilo
INDOCRYPT
2005
Springer
14 years 4 months ago
A Universally Composable Scheme for Electronic Cash
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
Mårten Trolin
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
CANS
2009
Springer
105views Cryptology» more  CANS 2009»
14 years 5 months ago
Transferable Constant-Size Fair E-Cash
We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a ce...
Georg Fuchsbauer, David Pointcheval, Damien Vergna...