Sciweavers

133 search results - page 11 / 27
» Fair Blind Signatures
Sort
View
JISE
2002
86views more  JISE 2002»
13 years 7 months ago
Provably Secure Blind Threshold Signatures Based on Discrete Logarithm
Chin-Laung Lei, Wen-Shenq Juang, Pei-Ling Yu
DRM
2003
Springer
14 years 23 days ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
CSFW
2005
IEEE
14 years 1 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
ICMCS
1999
IEEE
117views Multimedia» more  ICMCS 1999»
13 years 12 months ago
Fractal Transform Based Large Digital Watermark Embedding and Robust Full Blind Extraction
The aim of this demonstration is to present the ongoing performance of our R. and D. watermarking scheme software. The proposed illustrations cover a large panel of original image...
Jean-Luc Dugelay, S. Roche
TIFS
2010
186views more  TIFS 2010»
13 years 5 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang