Sciweavers

95 search results - page 14 / 19
» Data Compression Using Encrypted Text
Sort
View
CISS
2008
IEEE
14 years 1 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 10 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
FOCS
2000
IEEE
13 years 11 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
IJACTAICIT
2010
361views more  IJACTAICIT 2010»
13 years 4 months ago
A Proposed Technique for Information Hiding Based on DCT
The aim of this work is to design an algorithm which combines between steganography and cryptography that can hide a text in an image in a way that prevents, as much as possible, ...
Fadhil Salman Abed, Nada Abdul Aziz Mustafa
ACMSE
2009
ACM
13 years 4 months ago
A secure unidirectional proxy re-encryption using identity and secret key exchange
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
Edna Milgo