Sciweavers

2601 search results - page 246 / 521
» Secure Rewarding Schemes
Sort
View
IJSN
2007
94views more  IJSN 2007»
15 years 3 months ago
On security proof of McCullagh?Barreto's key agreement protocol and its variants
: McCullagh and Barreto presented an identity-based authenticated key agreement protocol in CT-RSA 2005. Their protocol was found to be vulnerable to a key-compromise impersonation...
Zhaohui Cheng, Liqun Chen
ICIP
2004
IEEE
16 years 5 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...
109
Voted
IWDW
2005
Springer
15 years 9 months ago
A Survey of Watermarking Security
Digital watermarking studies have always been driven by the improvement of robustness. Most of articles of this field deal with this criterion, presenting more and more impressive...
Teddy Furon
CRYPTO
1999
Springer
103views Cryptology» more  CRYPTO 1999»
15 years 8 months ago
Information Theoretically Secure Communication in the Limited Storage Space Model
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
Yonatan Aumann, Michael O. Rabin
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
15 years 7 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart