Sciweavers

101 search results - page 3 / 21
» Extended visual cryptography schemes
Sort
View
COCOON
2008
Springer
13 years 7 months ago
Visual Cryptography on Graphs
In this paper, we consider a new visual cryptography scheme that allows for sharing of multiple secret images on graphs: we are given an arbitrary graph (V, E) where every node an...
Steve Lu, Daniel Manchala, Rafail Ostrovsky
ICMCS
2006
IEEE
121views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Real-time video watermarking based on extended m-sequences
This paper presents an oblivious real-time video watermarking scheme in which extended m-sequences is selected as watermark pattern. The good balance property of extended m-sequen...
Fuhao Zou, Zhengding Lu, Hefei Ling, Yanwei Yu
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 1 days ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 2 days ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 3 days ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
Marc Joye