Sciweavers

41 search results - page 6 / 9
» On extracting common random bits from correlated sources
Sort
View
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 6 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 9 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
IJCNN
2008
IEEE
14 years 3 months ago
Learning to select relevant perspective in a dynamic environment
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...
Zhihui Luo, David A. Bell, Barry McCollum, Qingxia...
ICHIT
2009
Springer
14 years 3 months ago
An improved camera identification method based on the texture complexity and the image restoration
The identification of source camera is useful to improve the capability of evidence in the digital image such as distinguish the photographer taking illegal images and adopting di...
Kazuya Matsushita, Hitoshi Kitazawa
IH
2005
Springer
14 years 2 months ago
Embedding Covert Channels into TCP/IP
It is commonly believed that steganography within TCP/IP is easily achieved by embedding data in header fields seemingly filled with “random” data, such as the IP identifier...
Steven J. Murdoch, Stephen Lewis