Sciweavers

133 search results - page 5 / 27
» Fair Blind Signatures
Sort
View
EUROCRYPT
2010
Springer
13 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
IJACT
2008
102views more  IJACT 2008»
13 years 7 months ago
An optimistic fair exchange protocol and its security in the universal composability framework
: Fair exchange protocols allow both or neither of two parties to obtain the other's items, and this property is essential in e-commerce. In this paper, we construct an optimi...
Yusuke Okada, Yoshifumi Manabe, Tatsuaki Okamoto
ICICS
2001
Springer
13 years 12 months ago
Fair Electronic Cash Based on a Group Signature Scheme
Several new group signature schemes have been proposed in recent years. In addition, several applications for group signatures (including electronic cash) have been suggested. A ne...
Greg Maitland, Colin Boyd
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 1 months ago
Light-Weight Fair-Dealing Infrastructures (FADIS) for M-Commerce
Abstract— An important issue in mobile commerce (mcommerce) is to exchange digital data between two distributed parties in an efficient and fair manner. In this paper, a lightwe...
Huafei Zhu, Feng Bao
TIT
1998
121views more  TIT 1998»
13 years 7 months ago
Blind Multiuser Detection: A Subspace Approach
—A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimummean-...
Xiaodong Wang, H. Vincent Poor