Sciweavers

2601 search results - page 312 / 521
» Secure Rewarding Schemes
Sort
View
CRV
2006
IEEE
128views Robotics» more  CRV 2006»
15 years 8 months ago
Expert Knowledge Based Automatic Regions-of-Interest (ROI) Selection in Scanned Documents for Digital Image Encryption
Conventional image-oriented cryptographic techniques lack the flexibility needed for content-specific security features such as the concealment of confidential information within ...
Alexander Wong, William Bishop
AFRICACRYPT
2008
Springer
15 years 6 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
ESORICS
2010
Springer
15 years 5 months ago
Efficient Multi-dimensional Key Management in Broadcast Services
The prevalent nature of Internet makes it a well suitable medium for many new types of services such as location-based services and streaming content. Subscribers to such services ...
Marina Blanton, Keith B. Frikken
IVC
2006
156views more  IVC 2006»
15 years 4 months ago
Image encryption using chaotic logistic map
In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques.Inthis communication,weproposea ...
Narendra K. Pareek, Vinod Patidar, Krishan K. Sud
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
15 years 10 months ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen