Quantifying Equivocation for Finite Blocklength Wiretap Codes
This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major result is the development of Monte Carlo strategies for quantifying a code's equivocation, which mirrors techniques use...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Pfister, Jack Gomes, Marco A. C Vilela, Joao P Harrison, Willie K |
| description | This paper presents a new technique for providing the analysis and comparison
of wiretap codes in the small blocklength regime over the binary erasure
wiretap channel. A major result is the development of Monte Carlo strategies
for quantifying a code's equivocation, which mirrors techniques used to analyze
normal error correcting codes. For this paper, we limit our analysis to
coset-based wiretap codes, and make several comparisons of different code
families at small and medium blocklengths. Our results indicate that there are
security advantages to using specific codes when using small to medium
blocklengths. |
| doi_str_mv | 10.48550/arxiv.1701.05484 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1701_05484</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1701_05484</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-8e5b035a582cb59f3edab2dd33a455319b7c980aaabb06be77fa4726c4d98b313</originalsourceid><addsrcrecordid>eNotj81OAjEYAHvxYMAH8GRfYNd22267Bw66ATUhISQkHjdf_6BhbbEUIm9vRE5zm8wg9EhJzZUQ5BnyTzjXVBJaE8EVv0ez9QliCf4S4hbPv0_hnAyUkCL2KeNFiKE4_Domsx9d3JYd_gzZFTjgPll3nKI7D-PRPdw4QZvFfNO_V8vV20f_sqyglbxSTmjCBAjVGC06z5wF3VjLGHAhGO20NJ0iAKA1abWT0gOXTWu47ZRmlE3Q07_22j8ccviCfBn-PobrB_sFf2xDbA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Quantifying Equivocation for Finite Blocklength Wiretap Codes</title><source>arXiv.org</source><creator>Pfister, Jack ; Gomes, Marco A. C ; Vilela, Joao P ; Harrison, Willie K</creator><creatorcontrib>Pfister, Jack ; Gomes, Marco A. C ; Vilela, Joao P ; Harrison, Willie K</creatorcontrib><description>This paper presents a new technique for providing the analysis and comparison
of wiretap codes in the small blocklength regime over the binary erasure
wiretap channel. A major result is the development of Monte Carlo strategies
for quantifying a code's equivocation, which mirrors techniques used to analyze
normal error correcting codes. For this paper, we limit our analysis to
coset-based wiretap codes, and make several comparisons of different code
families at small and medium blocklengths. Our results indicate that there are
security advantages to using specific codes when using small to medium
blocklengths.</description><identifier>DOI: 10.48550/arxiv.1701.05484</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2017-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1701.05484$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1701.05484$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pfister, Jack</creatorcontrib><creatorcontrib>Gomes, Marco A. C</creatorcontrib><creatorcontrib>Vilela, Joao P</creatorcontrib><creatorcontrib>Harrison, Willie K</creatorcontrib><title>Quantifying Equivocation for Finite Blocklength Wiretap Codes</title><description>This paper presents a new technique for providing the analysis and comparison
of wiretap codes in the small blocklength regime over the binary erasure
wiretap channel. A major result is the development of Monte Carlo strategies
for quantifying a code's equivocation, which mirrors techniques used to analyze
normal error correcting codes. For this paper, we limit our analysis to
coset-based wiretap codes, and make several comparisons of different code
families at small and medium blocklengths. Our results indicate that there are
security advantages to using specific codes when using small to medium
blocklengths.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OAjEYAHvxYMAH8GRfYNd22267Bw66ATUhISQkHjdf_6BhbbEUIm9vRE5zm8wg9EhJzZUQ5BnyTzjXVBJaE8EVv0ez9QliCf4S4hbPv0_hnAyUkCL2KeNFiKE4_Domsx9d3JYd_gzZFTjgPll3nKI7D-PRPdw4QZvFfNO_V8vV20f_sqyglbxSTmjCBAjVGC06z5wF3VjLGHAhGO20NJ0iAKA1abWT0gOXTWu47ZRmlE3Q07_22j8ccviCfBn-PobrB_sFf2xDbA</recordid><startdate>20170119</startdate><enddate>20170119</enddate><creator>Pfister, Jack</creator><creator>Gomes, Marco A. C</creator><creator>Vilela, Joao P</creator><creator>Harrison, Willie K</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20170119</creationdate><title>Quantifying Equivocation for Finite Blocklength Wiretap Codes</title><author>Pfister, Jack ; Gomes, Marco A. C ; Vilela, Joao P ; Harrison, Willie K</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-8e5b035a582cb59f3edab2dd33a455319b7c980aaabb06be77fa4726c4d98b313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Pfister, Jack</creatorcontrib><creatorcontrib>Gomes, Marco A. C</creatorcontrib><creatorcontrib>Vilela, Joao P</creatorcontrib><creatorcontrib>Harrison, Willie K</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pfister, Jack</au><au>Gomes, Marco A. C</au><au>Vilela, Joao P</au><au>Harrison, Willie K</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quantifying Equivocation for Finite Blocklength Wiretap Codes</atitle><date>2017-01-19</date><risdate>2017</risdate><abstract>This paper presents a new technique for providing the analysis and comparison
of wiretap codes in the small blocklength regime over the binary erasure
wiretap channel. A major result is the development of Monte Carlo strategies
for quantifying a code's equivocation, which mirrors techniques used to analyze
normal error correcting codes. For this paper, we limit our analysis to
coset-based wiretap codes, and make several comparisons of different code
families at small and medium blocklengths. Our results indicate that there are
security advantages to using specific codes when using small to medium
blocklengths.</abstract><doi>10.48550/arxiv.1701.05484</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1701.05484 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1701_05484 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | Quantifying Equivocation for Finite Blocklength Wiretap Codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T09%3A09%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quantifying%20Equivocation%20for%20Finite%20Blocklength%20Wiretap%20Codes&rft.au=Pfister,%20Jack&rft.date=2017-01-19&rft_id=info:doi/10.48550/arxiv.1701.05484&rft_dat=%3Carxiv_GOX%3E1701_05484%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |