151 search results - page 9 / 31 » Optimal (2, n) visual cryptographic schemes |
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
VLC
2008
13 years 7 months ago
2008
Image collections are getting larger and larger. To access those collections, systems for managing, searching, and browsing are necessary. Visualization plays an essential role in...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...