66 search results - page 1 / 14 » Secure Network Coding over the Integers |
PKC
2010
Springer
14 years 2 months ago
2010
Springer
PKC
2011
Springer
13 years 1 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
TIT
2008
13 years 10 months ago
2008
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver n packets from s...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...