Results 1  10
of
13
On secret sharing systems
 IEEE Transactions on Information Theory
, 1983
"... time for all neighbors m of j and hence Zj will become (S + 1). Since j has no nodes at hopdistance (S + l), (7) will hold and this completes the proof of the lemma. Lemma MH1 a) and Lemma MH2 a), b) are exactly Theorem MH1 and this completes the proof of the theorem. REFERENCES [ 1] R. G. Gall ..."
Abstract

Cited by 112 (0 self)
 Add to MetaCart
time for all neighbors m of j and hence Zj will become (S + 1). Since j has no nodes at hopdistance (S + l), (7) will hold and this completes the proof of the lemma. Lemma MH1 a) and Lemma MH2 a), b) are exactly Theorem MH1 and this completes the proof of the theorem. REFERENCES [ 1] R. G. Gallager, “A shortest path routing algorithm with automatic resynch, ” unpublished note, March 1976. [2] A. Segall, P. M. Merlin, and R. G. Gallager, “A recoverable protocol for loopfree distributed routing, ” Proc. ICC, June 1978. [3] S. G. Finn, “Resynch procedures and a failsafe network protocol
Secure communication over fading channels
 In Proc. Annu. Allerton Conf. Communication, Control and Computing
, 2006
"... The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from rec ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential information needs to be kept as secret as possible from receiver 2. The broadcast channel from the source node to receivers 1 and 2 is corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information (CSI) is assumed to be known at both the transmitter and the receivers. The parallel BCC with independent subchannels is first studied, which serves as an informationtheoretic model for the fading BCC. The secrecy capacity region of the parallel BCC is established. This result is then specialized to give the secrecy capacity region of the parallel BCC with degraded subchannels. The secrecy capacity region is then established for the parallel Gaussian BCC, and the optimal source power allocations that achieve the boundary of the secrecy capacity region are derived. In particular, the secrecy capacity region is established for the basic Gaussian BCC. The secrecy capacity results are then
The Gaussian Multiple Access Wiretap Channel
 IEEE TRANSACTION ON INFORMATION THEORY
, 2008
"... We consider the Gaussian multiple access wiretap channel (GMACWT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wiretapper who receives a degraded version of the signal at the receiver. We define suitable security measures ..."
Abstract

Cited by 60 (8 self)
 Add to MetaCart
We consider the Gaussian multiple access wiretap channel (GMACWT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wiretapper who receives a degraded version of the signal at the receiver. We define suitable security measures for this multiaccess environment. Using codebooks generated randomly according to a Gaussian distribution, achievable secrecy rate regions are identified using superposition coding and timedivision multiple access (TDMA) coding schemes. An upper bound for the secrecy sumrate is derived, and our coding schemes are shown to achieve the sum capacity. Numerical results are presented showing the new rate region and comparing it with the capacity region of the Gaussian multipleaccess channel (GMAC) with no secrecy constraints, which quantifies the price paid for secrecy.
The general Gaussian multiple access and twoway wiretap channels: Achievable rates and cooperative jamming
 IEEE Trans. Inf. Theory
, 2008
"... We consider the General Gaussian Multiple Access WireTap Channel (GGMACWT) and the Gaussian TwoWay WireTap Channel (GTWWT) which are commonly found in multiuser wireless communication scenarios and serve as building blocks for adhoc networks. In the GGMACWT, multiple users communicate with a ..."
Abstract

Cited by 50 (24 self)
 Add to MetaCart
We consider the General Gaussian Multiple Access WireTap Channel (GGMACWT) and the Gaussian TwoWay WireTap Channel (GTWWT) which are commonly found in multiuser wireless communication scenarios and serve as building blocks for adhoc networks. In the GGMACWT, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper who receives their signals through another GMAC. In the GTWWT, two users communicate with each other with an eavesdropper listening through a GMAC. We consider a secrecy measure that is suitable for this multiterminal environment, and identify achievable such secrecy regions for both channels using Gaussian codebooks. In the special case where the GGMACWT is degraded, we show that Gaussian codewords achieve the strong secret key sumcapacity. For both GGMACWT and GTWWT, we find the power allocations that maximize the achievable secrecy sumrate, and find that the optimum policy may prevent some terminals from transmission in order to preserve the secrecy of the system. Inspired by this construct, we next propose a new scheme which we call cooperative jamming, where users who are not transmitting according to the sumrate maximizing power allocation can help the remaining users by “jamming ” the eavesdropper. This scheme is shown to increase the achievable secrecy sumrate, and in some cases allow a previously nontransmitting terminal to be able to transmit with secrecy. Overall,
The General Gaussian MultipleAccess and TwoWay Wiretap Channels: Achievable Rates and Cooperative Jamming
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2008
"... The general Gaussian multipleaccess wiretap channel (GGMACWT) and the Gaussian twoway wiretap channel (GTWWT) are considered. In the GGMACWT, multiple users communicate with an intended receiver in the presence of an eavesdropper who receives their signals through another GMAC. In the GTWWT, ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
The general Gaussian multipleaccess wiretap channel (GGMACWT) and the Gaussian twoway wiretap channel (GTWWT) are considered. In the GGMACWT, multiple users communicate with an intended receiver in the presence of an eavesdropper who receives their signals through another GMAC. In the GTWWT, two users communicate with each other over a common Gaussian channel, with an eavesdropper listening through a GMAC. A secrecy measure that is suitable for this multiterminal environment is defined, and achievable secrecy rate regions are found for both channels. For both cases, the power allocations maximizing the achievable secrecy sum rate are determined. It is seen that the optimum policy may prevent some terminals from transmission in order to preserve the secrecy of the system. Inspired by this construct, a new scheme cooperative jamming is proposed, where users who are prevented from transmitting according to the secrecy sum rate maximizing power allocation policy “jam ” the eavesdropper, thereby helping the remaining users. This scheme is shown to increase the achievable secrecy sum rate. Overall, our results show that in multipleaccess scenarios, users can help each other to collectively achieve positive secrecy rates. In other words, cooperation among users can be invaluable for achieving secrecy for the system.
An extension of the Shannon theory approach to cryptography
 IEEE Transactions on Information Theory
, 1977
"... AbstractShannon’s informationtheoretic approach to cryptography is reviewed and extended. It is shown that Shannon’s random cipher model is conservative in that a randomly chosen cipher is essentially the worst possible. This is in contrast with errorcorrecting codes where a randomly chosen code ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
AbstractShannon’s informationtheoretic approach to cryptography is reviewed and extended. It is shown that Shannon’s random cipher model is conservative in that a randomly chosen cipher is essentially the worst possible. This is in contrast with errorcorrecting codes where a randomly chosen code is essentially the best possible. The concepts of matching a cipher to a language and of the tradeoff between local and global uncertainty are also developed. I
On secure signaling for the Gaussian multiple access wiretap channel
 in Proc. 39th Annu. Asilomar Conf. Signals, Syst., Comput
, 2005
"... Abstract — We consider the Gaussian Multiple Access WireTap Channel (GMACWT) where multiple users communicate with the intended receiver in the presence of an intelligent and informed wiretapper (eavesdropper). The wiretapper receives a degraded version of the signal at the receiver. We assume t ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
Abstract — We consider the Gaussian Multiple Access WireTap Channel (GMACWT) where multiple users communicate with the intended receiver in the presence of an intelligent and informed wiretapper (eavesdropper). The wiretapper receives a degraded version of the signal at the receiver. We assume that the wiretapper is as capable as the intended receiver, and there is no other shared secret key. We consider two different secure communication scenarios: (i) keeping the wiretapper totally ignorant of the message of any group of users even if the remaining users are compromised, (ii) using the secrecy of the other users to ensure secrecy for a group of users. We first derive the outer bounds for the secure rate region. Next, using Gaussian codebooks, we show the achievability of a secure rate region for each measure in which the wiretapper is kept perfectly ignorant of the messages. We also find the power allocations that yield the maximum sum rate, and show that upper bound on the secure sum rate can be achieved by a TDMA scheme. We present numerical results showing the new rate region and compare it with that of the Gaussian MultipleAccess Channel (GMAC) with no secrecy constraints. I.
Really fast syndromebased hashing
 URL: http://eprint.iacr.org/2011/074. Citations in this document
, 2011
"... Abstract. The FSB (fast syndromebased) hash function was submitted to the SHA3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs proposed in 2003, 2005, and 2007. Many FSB parameter choices were broken by Coron and Joux in 2004, Saarinen in 2007, and F ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The FSB (fast syndromebased) hash function was submitted to the SHA3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs proposed in 2003, 2005, and 2007. Many FSB parameter choices were broken by Coron and Joux in 2004, Saarinen in 2007, and Fouque and Leurent in 2008, but the basic FSB idea appears to be secure, and the FSB submission remains unbroken. On the other hand, the FSB submission is also quite slow, and was not selected for the second round of the competition. This paper introduces RFSB, an enhancement to FSB. In particular, this paper introduces the RFSB509 compression function, RFSB with a particular set of parameters. RFSB509, like the FSB256 compression function, is designed to be used inside a 256bit collisionresistant hash function: all known attack strategies cost more than 2 128 to find collisions in RFSB509. However, RFSB509 is an order of magnitude faster than FSB256. On a single core of a Core 2 Quad Q9550 CPU, RFSB509 runs at 10.67 cycles/byte: faster than SHA256, faster than 7 of the 14 secondround SHA3 candidates, and faster than 3 of the 5 SHA3 finalists. Key words: compression functions, collision resistance, linearization, generalized birthday attacks, informationset decoding, tight reduction to L1 cache. 1
Faster 2regular informationset decoding
"... Abstract. Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2regulardecoding problem is to find a nonzero codeword consisting of w lengthB blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndromebased) hash function a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Fix positive integers B and w. Let C be a linear code over F2 of length Bw. The 2regulardecoding problem is to find a nonzero codeword consisting of w lengthB blocks, each of which has Hamming weight 0 or 2. This problem appears in attacks on the FSB (fast syndromebased) hash function and related proposals. This problem differs from the usual informationsetdecoding problems in that (1) the target codeword is required to have a very regular structure and (2) the target weight can be rather high, so that there are many possible codewords of that weight. Augot, Finiasz, and Sendrier, in the paper that introduced FSB, presented a variant of informationset decoding tuned for 2regular decoding. This paper improves the Augot–Finiasz–Sendrier algorithm in a way that is analogous to Stern’s improvement upon basic informationset decoding. The resulting algorithm achieves an exponential speedup over the previous algorithm. Keywords: Informationset decoding, 2regular decoding, FSB, binary codes.
unknown title
"... For centuries, cryptography has been a valuable asset of the military and diplomatic communities. Indeed, it is so valuable that its practice has usually been shrouded in secrecyand mystery. ..."
Abstract
 Add to MetaCart
For centuries, cryptography has been a valuable asset of the military and diplomatic communities. Indeed, it is so valuable that its practice has usually been shrouded in secrecyand mystery.