The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Efficient Codes for Limited View Adversarial Channels
[article]
2013
arXiv
pre-print
Preserved Fulltext
We introduce randomized Limited View (LV) adversary codes that provide protection against an adversary that uses their partial view of the communication to construct an adversarial error vector to be added ...
An (N, q^RN,δ)-limited view adversary code ensures that the success chance of the adversary in making decoder fail, is bounded by δ when the information rate of the code is at least R. ...
In Section 4, we present an efficient construction for randomized limited view adversary code. Section 5 discusses our results, open problems and future works.
II. ...
arXiv:1303.2735v1
fatcat:lxhfozbujjc7dix7ilszfl2ysy
A Model for Adversarial Wiretap Channels and its Applications
2015
Journal of Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We consider a coding-theoretic model for wiretap channels with active adversaries who can choose their view of the communication channel and also add adversarial noise to the channel. ...
In Wyner's model, the adversary is passive. ...
The adversarial channel was called limited view adversarial channels (LV adversary channel) and the codes that provide reliable communication were referred to as limited view adversary codes (LV-code). ...
doi:10.2197/ipsjjip.23.554
fatcat:fuudrnzbjvhdxiuchts6ps5bgm
A Model for Adversarial Wiretap Channel
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Second, we give an explicit construction for a capacity achieving AWTP code family, and prove its security and efficiency properties. ...
AWTP codes provide secrecy and reliability for communication over these channels. ...
An adversarial channel closely related to this work is limited view (LV) adversary channel [50] , [51] . ...
arXiv:1312.6457v3
fatcat:yecptfdpzfbu7lqjri67hte3je
Optimal Error Correction Against Computationally Bounded Noise
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capability is much greater ...
In addition, our techniques can potentially be used to construct coding schemes that have information rates approaching the Shannon limit. ...
We also thank the anonymous reviewers for their helpful and thorough comments. ...
doi:10.1007/978-3-540-30576-7_1
fatcat:n4xuw3hkabaphcfpfznn647idu
Information-theoretically Secure Key Agreement over Partially Corrupted Channels
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we consider this problem when the adversary can "partially" control the channel. ...
We motivate these adversaries by considering adversarial corruptions at the physical layer of communication, give a definition of adversaries that can "partially" eavesdrop and "partially" corrupt the ...
An (n, k, δ)-Limited-View Adversary Code (or (n, k, δ)-LV adversary code) for a (ρ r , ρ w )-AWTP channel, is a code of dimension k and length n. ...
arXiv:1604.03824v1
fatcat:yaqxobqxqnadtnkrhlknl3tdhe
Efficient Codes for Adversarial Wiretap Channels
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we give the first efficient construction of a capacity achieving code family that provides perfect secrecy for this channel. ...
In [13] we proposed a (ρ_r , ρ_w )-adversarial wiretap channel model (AWTP) in which the adversary can adaptively choose to see a fraction ρ_r of the codeword sent over the channel, and modify a fraction ...
In [14] we proposed a model for adversarial channel called limited view adversarial channel (LVAC), which is the same as the adversarial channel considered here. ...
arXiv:1401.4633v1
fatcat:ri2foji6w5bbzjjireb2abguu4
Single-Shot Security for One-Time Memories in the Isolated Qubits Model
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
These results use Wiesner's idea of conjugate coding, combined with error-correcting codes that approach the capacity of the q-ary symmetric channel, and a high-order entropic uncertainty relation, which ...
of the (smoothed) min-entropy; they are proven secure against adversaries who can perform arbitrary local operations and classical communication (LOCC); and they are efficiently implementable. ...
Acknowledgements: It is a pleasure to thank Serge Fehr, Stephen Jordan, Maris Ozols, Rene Peralta, Eren Sasoglu, Christian Schaffner, Barbara Terhal, Alexander Vardy, and several anonymous reviewers, for ...
doi:10.1007/978-3-662-44381-1_2
fatcat:ojggb4rnffbvfhmfd5hc3jk56m
Codes against Online Adversaries
[article]
2008
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The codes we construct to attain the optimal rate for each scenario are computationally efficient. ...
,x_n symbol-by-symbol over a communication channel. The adversarial jammer can view the transmitted symbols x_i one at a time, and can change up to a p-fraction of them. ...
As one can efficiently communicate over an erasure channel with rate 1 − p, e.g., [3] , we obtain the same rate for our online channel. ...
arXiv:0811.2850v1
fatcat:vejev4flzjdmbetc4wys7gnxvu
Secure Two-Party Computation over a Z-Channel
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We provide coding schemes that can further increase the efficiency of the protocol for probabilities distant from the range mentioned above, and also allow the use of a Z-channel with an error probability ...
The protocol proves to be particularly efficient for a large range of error probabilities p (e.g., for 0.17 ≤ p ≤ 0.29 when a security parameter ε = 10 −9 is chosen), where it requires a limited amount ...
This particular characteristic eliminates the need for error correction codes, which, in other constructions, limit considerably the range of error probabilities acceptable for secure computation. ...
doi:10.1007/978-3-642-24316-5_3
fatcat:d45sclmugjfx3c44aqs3oj7qby
Combating side-channel attacks using key management
2009
2009 IEEE International Symposium on Parallel & Distributed Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
This technique leverages the bandwidth limitation of side channels and employs an effective updating mechanism to prevent the keying materials from being exposed. ...
However, recent studies have shown that adversaries can effectively extract the sensitive data from tamper-resistant modules by launching semi-invasive side-channel attacks such as power analysis and laser ...
We thus prefer a small b for high efficiency. ...
doi:10.1109/ipdps.2009.5161248
dblp:conf/ipps/LiuD09
fatcat:q2kblj2vl5etdc7fhq7n6tuq3e
Optimal Error Correction for Computationally Bounded Noise
2010
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose errorcorrection capability is much greater ...
Our results for large alphabets are actually optimal, since the "computationally bounded but adversarial channel" can simulate the behavior of the q-ary symmetric channel, where q denotes the size of the ...
Let C be a (ρ, L) efficiently list decodable code for some polynomially growing function L(k). ...
doi:10.1109/tit.2010.2070370
fatcat:alp6fnrparen5jhxsfyw6cjpxe
Public Key Locally Decodable Codes with Short Keys
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The computationally bounded channel model, introduced by Lipton in 1994, views the channel as an adversary which is restricted to polynomial-time computation. ...
This work considers locally decodable codes in the computationally bounded channel model. ...
In this model, like in Hamming's model, we view the channel as an adversary who is attempting to cause a decoding error. ...
doi:10.1007/978-3-642-22935-0_51
fatcat:7a74aztvprfvvaoxrsq2ydrvza
Optimal Coding for Streaming Authentication and Interactive Communication
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this work we suggest a constant-rate error-correction scheme and an efficient authentication scheme for data streams over a noisy channel (one-way communication, no feedback) in the shared-randomness ...
is efficient. ...
Langberg [16] considers private codes for adversarial channels that approach Shannon's bound and require only O(log n) randomness for block size n, as well as an Ω(log n) lower bound for the needed randomness ...
doi:10.1007/978-3-642-40084-1_15
fatcat:ednvxg7lbvdmzgehrbgvbwxeye
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries
2013
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The adversarial jammer can view the transmitted bits x_i one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in a causal manner. ...
,x_n) bit-by-bit over a communication channel. The sender and the receiver do not share common randomness. ...
communication scenario models jamming by an adversary who is limited in his jamming capability (perhaps due to limited transmit energy) and is causal. ...
doi:10.1109/tit.2013.2245721
fatcat:5txt4vta3jephfn6apic7hvs2i
SBVLC: Secure Barcode-Based Visible Light Communication for Smartphones
2016
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Short-range smartphone communication, key exchange, secure VLC, 2D barcode streaming, QR codes. ! 2 view angles and leveraging user-induced motions. ...
We formally analyze the security of SBVLC based on geometric models and propose physical security enhancement mechanisms for barcode communication by manipulating screen view angles and leveraging user-induced ...
It serves as a milestone for further development in secure VLC systems for smartphones. ...
doi:10.1109/tmc.2015.2413791
fatcat:ltbawcurljeddfauzuwmizwedq
« Previous
Showing results 1 — 15 out of 25,997 results