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.
Filters
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
[article]
2014
arXiv
pre-print
Preserved Fulltext
Other Versions
We also show how to boost the computational and communication efficiency of any list decoder to become near linear. ...
Such interactive coding schemes simulate any n-round interactive protocol using N rounds over an adversarial channel that corrupts up to ρ N transmissions. ...
In particular, in Section 3.4, we explain how to transform (efficient) list-decoding interactive coding schemes to (efficient) unique-decoding coding schemes with almost the same performance measures for ...
arXiv:1312.1763v2
fatcat:irtzizcmkbe3zd5zd2sid2mowq
Post-Quantum Secure Cryptographic Algorithms
[article]
2018
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
The basic idea of a code-based crypto system is to choose a linear code with fast decoding algorithm and disguise it as a general linear code. ...
key is an (n, k)-linear error correcting code represented by a generator matrix G, with a known efficient decoding algorithm. ...
arXiv:1809.00371v2
fatcat:nholvlircjavza5trvkx2iqdym
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
2014
2014 IEEE 55th Annual Symposium on Foundations of 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 2014; you can also visit the original URL.
The file type is application/pdf.
This simpler cryptographic setting provides valuable insights and reveals intimate connections between list decodable interactive coding schemes and the standard unique decoding requirement. ...
In fact, all our results are obtained by first taking an inefficient list decodable coding scheme, then boosting its efficiency, and lastly applying a new generic reduction to the particular unique decoding ...
[8] and [7] and to build an efficient list decoder. ...
doi:10.1109/focs.2014.49
dblp:conf/focs/GhaffariH14
fatcat:zj64pjr2q5cpxa366ka23p6xni
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.
Error correction and message authentication are well studied in the literature, and various efficient solutions have been suggested and analyzed. ...
In a recent paper, Braverman and Rao [STOC 2011] show that any function of two inputs has a constant-rate interactive protocol for two users that withstands a noise rate up to 1/4. ...
We assume that all the randomness comes from R and that for a fixed R the protocols are deterministic. Tree Codes. ...
doi:10.1007/978-3-642-40084-1_15
fatcat:ednvxg7lbvdmzgehrbgvbwxeye
Coding for interactive computation: Progress and challenges
2012
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
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.
We highlight some recent progress and challenges in the area of interactive coding and information complexity. * Partially supported by an Alfred P. ...
Sloan Fellowship, an NSF CAREER award, and a Turing Centenary Fellowship. ...
Acknowledgments I would like to thank Ankit Garg, Sreeram Kannan, Denis Pankratov, Anup Rao, Pramod Viswanath, and Omri Weinstein for enlightening discussions. ...
doi:10.1109/allerton.2012.6483456
dblp:conf/allerton/Braverman12
fatcat:diltfli64jcq7hrshj66m7un2u
Optimal error rates for interactive coding I
2014
Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14
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.
We believe this hypothesis to be a powerful guideline for the design of simple, natural, and efficient coding schemes and for understanding the (im)possibilities of coding for interactive communications ...
While time-coding strategies do not seem to lead to very efficient algorithms they would prevent strong lower bounds which show that even over an unbounded number of rounds no meaningful communication ...
We remark that using efficiently decodable tree codes, such as the ones described in the postscript to [10] on Schulman's webpage, one can also obtain a computationally efficient coding scheme at the ...
doi:10.1145/2591796.2591872
dblp:conf/stoc/GhaffariHS14
fatcat:zxr7cho3zje5ni2gb5bfkw35gi
Black-Box Trace&Revoke Codes
2012
Algorithmica
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.
Contributions and paper outline. Section 2 formalizes the notion of revocable codes, and efficient conjunction revocable codes in particular. ...
We note that, in collusion-secure codes, a word in the feasible set is also associated to a perfect decoder and in order to deal with smarter pirate decoders, one should use a collusion-secure code with ...
Black-box Traceability and Decoders' Strategies So far, we have defined traceable codes and specified how to obtain efficiently traceable 1-conjunction codes from disjunct matrices. ...
doi:10.1007/s00453-012-9702-y
fatcat:avrfohqgkrbc5gdpefmahjrv4m
Optimal Coding for Streaming Authentication and Interactive Communication
2015
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 2018; you can also visit the original URL.
The file type is application/pdf.
Error correction and message authentication are well studied in the literature, and various efficient solutions have been suggested and analyzed. ...
In a recent paper, Braverman and Rao [STOC 2011] show that any function of two inputs has a constant-rate interactive protocol for two users that withstands a noise rate up to 1/4. ...
We assume that all the randomness comes from R and that for a fixed R the protocols are deterministic. Tree codes. ...
doi:10.1109/tit.2014.2367094
fatcat:4gj4f5vk6fb4pbvve3s5wfo6uu
Coding structure optimization for interactive multiview streaming in virtual world observation
2008
2008 IEEE 10th Workshop on Multimedia Signal 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 2017; you can also visit the original URL.
The file type is application/pdf.
While most multiview coding techniques focus on compressing all frames in a multiview video sequence in a ratedistortion optimal manner, in this paper we address the problem of interactive multiview streaming ...
We show that our proposed redundant representation can reduce the transmission cost of interactive multiview streaming by up to 65% as compared to a good non-redundant representation for the same storage ...
F and (sub-)trees stemming from F . ...
doi:10.1109/mmsp.2008.4665121
dblp:conf/mmsp/CheungOS08
fatcat:e5densz2mbeo7n54pnztivzsdm
Page 3734 of Mathematical Reviews Vol. , Issue 81I
[page]
1981
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
batch and interactive jobs. ...
Majster and A. Reiser, An efficient on-line position tree construction algorithm (pp. 190-198); Kurt Mehl- horn, Sorting presorted files (pp. 199-212); Th. Ottmann, A. L. Rosenberg, H. W. Six and D. ...
Forward Error Correction Convolutional Codes for RTAs' Networks: An Overview
2014
International Journal of Computer Network and Information Security
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 more than half a century, Forward Error Correction Convolutional Codes (FEC-CC) have been in use to provide reliable data communication over various communication networks. ...
The recent high increase of mobile communication services that require both bandwidth intensive and interactive Real Time Applications (RTAs) impose an increased demand for fast and reliable wireless communication ...
[18] , decoding of error correction codes is a Non-deterministic Polynomial-time hard problem (NP-Hard problem). Therefore, the quality of a decoder highly depends on industrial requests. ...
doi:10.5815/ijcnis.2014.07.03
fatcat:nw4qffi6i5grdm5yp6jt5rzrl4
Non-Malleable Codes for Space-Bounded Tampering
[chapter]
2017
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.
Non-malleable codes-introduced by Dziembowski, Pietrzak and Wichs at ICS 2010are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries ...
To circumvent this obstacle, the majority of past research focused on designing non-malleable codes for various tampering classes, albeit assuming that the adversary is unable to decode. ...
(ii) The (randomized) encoding algorithm Encode takes as input hard-wired public parameters ω ∈ {0, 1} * and a value x ∈ {0, 1} k , and returns a codeword c ∈ {0, 1} n ; (iii) The (deterministic) decoding ...
doi:10.1007/978-3-319-63715-0_4
fatcat:r2bgcran5rauhjthyao7ixfj5e
Multi-collision resistance: a paradigm for keyless hash functions
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
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.
We show how to replace collision resistance with multi-collision resistance in several foundational applications. ...
study the notion of multi-collision resistance of hash functions -a natural relaxation of collisionresistance that only guarantees the intractability of finding many (rather than two) inputs that map to ...
We are grateful to Oded Goldreich for valuable discussions and suggestions regarding the presentation of our results. ...
doi:10.1145/3188745.3188870
dblp:conf/stoc/BitanskyKP18
fatcat:wkozeczwgvhz7cmwj6ev4nmuki
Software synthesis of CAL actors for the MPEG reconfigurable Video Coding framework
2008
2008 15th IEEE International Conference on Image 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 2011; you can also visit the original URL.
The file type is application/pdf.
In this framework, a decoder is modularly built as a configuration of video coding tools taken from the MPEG toolbox library. The elements of the library are specified using the CAL Actor Language. ...
CAL is a dataflow based language providing computation models that are concurrent and modular. This paper presents a synthesis tool that from a CAL specification generates multithread C code. ...
Nodes and edges respectively represent states and actions. This actor adds the prediction error (from the texture decoder) to the prediction (from the motion compensation decoder). ...
doi:10.1109/icip.2008.4712028
dblp:conf/icip/RoquierWRND08
fatcat:pqwjux236vfxfpehp5dloshzjm
Revocable Identity-Based Encryption from Codes with Rank Metric
[chapter]
2018
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.
Our revocable IBE scheme from codes with rank metric makes use of a binary tree data structure to reduce the amount of work in terms of key updates for the key authority. ...
In this paper, we present an identity-based encryption scheme from codes with efficient key revocation. ...
Its security is based on indistinguishability of Goppa codes from random codes and the inherent complexity of decoding a random linear code, which is considered to be NP-complete [7] . ...
doi:10.1007/978-3-319-76953-0_23
fatcat:feppnvzs4vh2dixqswhwlggcqa
« Previous
Showing results 1 — 15 out of 4,269 results