Sciweavers

236 search results - page 7 / 48
» From Weak to Strong Watermarking
Sort
View
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 9 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
INFOCOM
2008
IEEE
14 years 4 months ago
Diagnosing Wireless Packet Losses in 802.11: Separating Collision from Weak Signal
—It is well known that a packet loss in 802.11 can happen either due to collision or an insufficiently strong signal. However, discerning the exact cause of a packet loss, once ...
Shravan K. Rayanchu, Arunesh Mishra, Dheeraj Agraw...
FOCS
2009
IEEE
14 years 1 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
ICALP
1997
Springer
14 years 2 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
13 years 11 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige