Pith. Sign in

RECORD

Secure list decoding and its application to bit-string commitment

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Masahito Hayashi

Information Theory · Submitted 22 Mar 2021

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We show that the combination of hash function and secure list decoding yields the conventional bit-string commitment.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2103.11548 (version 2)
Pith IDS4HH54F3, Pith's permanent record of this paper and its review
CitationMasahito Hayashi. "Secure list decoding and its application to bit-string commitment." arXiv:2103.11548 (2021). https://pith.science/paper/S4HH54F3
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 7,366 input tokens.

What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.19 · human participants 0.02 · controlled comparison 0.07 · randomized assignment 0.01 · states quantitative result 0.27 · compares with prior results 0.55 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

We propose a new concept of secure list decoding, which is related to bit-string commitment. While the conventional list decoding requires that the list contains the transmitted message, secure list decoding requires the following additional security conditions to work as a modification of bit-string commitment. The first additional security condition is the receiver's uncertainty for the transmitted message, which is stronger than the impossibility of the correct decoding, even though the transmitted message is contained in the list. The other additional security condition is the impossibility for the sender to estimate another element of the decoded list except for the transmitted message. The first condition is evaluated by the equivocation rate. The asymptotic property is evaluated by three parameters, the rates of the message and list sizes, and the equivocation rate. We derive the capacity region of this problem. We show that the combination of hash function and secure list decoding yields the conventional bit-string commitment. Our results hold even when the input and output systems are general probability spaces including continuous systems. When the input system is a general probability space, we formulate the abilities of the honest sender and the dishonest sender in a different way.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We propose a new concept of secure list decoding, which is related to bit-string commitment. contribution 1.00 0.93 0.13 asserted 1.00
s1 While the conventional list decoding requires that the list contains the transmitted message, secure list decoding requires the following additional security conditions to work as a modification of bit-string commitment. background 0.73 0.09 0.05 asserted 1.00
s2 The first additional security condition is the receiver's uncertainty for the transmitted message, which is stronger than the impossibility of the correct decoding, even though the transmitted message is contained in the list. contribution 0.86 0.25 0.06 asserted 1.00
s3 The other additional security condition is the impossibility for the sender to estimate another element of the decoded list except for the transmitted message. contribution 0.84 0.24 0.05 asserted 1.00
s4 The first condition is evaluated by the equivocation rate. method 0.89 0.57 0.03 asserted 1.00
s5 The asymptotic property is evaluated by three parameters, the rates of the message and list sizes, and the equivocation rate. method 0.69 0.75 0.06 asserted 1.00
s6 We derive the capacity region of this problem. result 0.75 0.97 0.34 asserted 1.00
s7 We show that the combination of hash function and secure list decoding yields the conventional bit-string commitment. result 0.79 0.92 0.33 asserted 1.00
s8 Our results hold even when the input and output systems are general probability spaces including continuous systems. result 0.88 0.80 0.06 asserted 1.00
s9 When the input system is a general probability space, we formulate the abilities of the honest sender and the dishonest sender in a different way. contribution 0.51 0.86 0.05 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.83 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We propose a new concept of secure list decoding, which is related to bit-string commitment. While the conventional list decoding requires that the list contains the transmitted message, secure list decoding requires the following additional security conditions to work as a modification of bit-string commitment. The first additional security condition is the receiver's uncertainty for the transmitted message, which is stronger than the impossibility of the correct decoding, even though the transmitted message is contained in the list. The other additional security condition is the impossibility for the sender to estimate another element of the decoded list except for the transmitted message. The first condition is evaluated by the equivocation rate. The asymptotic property is evaluated by three parameters, the rates of the message and list sizes, and the equivocation rate. We derive the capacity region of this problem. We show that the combination of hash function and secure list decoding yields the conventional bit-string commitment. Our results hold even when the input and output systems are general probability spaces including continuous systems. When the input system is a general probability space, we formulate the abilities of the honest sender and the dishonest sender in a different way.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

2 arXiv papers cite this in 11 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 5 sentences without a confident label

Builds on it 1 paper
Uses its method or tool 1 paper
Compares with it 1 paper
Cites it as background 1 paper

What it cites · 3 sentences without a confident label

Uses the method or tool of 1 paper
Compares with 1 paper
  • In this sense, the content of this paper is different from that of [ref] .].

    Secure list decoding · Introduction · 0.98

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.