Sciweavers

346 search results - page 21 / 70
» The Secret Santa Problem
Sort
View
COCOON
2008
Springer
14 years 22 days 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
ENTCS
2006
103views more  ENTCS 2006»
13 years 11 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
ICIP
2003
IEEE
15 years 16 days ago
Halftone visual cryptography
This paper considers the problem of encoding a secret binary image SI into n shares of meaningful halftone images within the scheme of visual cryptography (VC). Secret pixels enco...
Z. Zhou, Gonzalo R. Arce, Giovanni Di Crescenzo
SDMW
2004
Springer
14 years 4 months ago
Identifying Sensitive Associations in Databases for Release Control
In a database system, authorization-based access-control is generally the first line of defense, preventing unauthorized accesses to secret or sensitive data. However, this mechan...
Claudio Bettini, Xiaoyang Sean Wang, Sushil Jajodi...
FC
2004
Springer
94views Cryptology» more  FC 2004»
14 years 4 months ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman