Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2501.00281

Help | Advanced Search

Computer Science > Information Theory

arXiv:2501.00281 (cs)
[Submitted on 31 Dec 2024 (v1) , last revised 24 Aug 2025 (this version, v2)]

Title: String commitment from unstructured noise

Title: 从无结构噪声中的字符串承诺

Authors:Jiawei Wu, Masahito Hayashi, Marco Tomamichel
Abstract: Noisy channels are a foundational resource for constructing cryptographic primitives such as string commitment and oblivious transfer. The noisy channel model has been extended to unfair noisy channels, where adversaries can influence the parameters of a memoryless channel. In this work, we introduce the unstructured noisy channel model as a generalization of the unfair noisy channel model to allow the adversary to manipulate the channel arbitrarily subject to certain entropic constraints. We present a string commitment protocol with established security and derive its achievable commitment rate, demonstrating the feasibility of commitment against this stronger class of adversaries. Furthermore, we show that the entropic constraints in the unstructured noisy channel model can be derived from physical assumptions such as noisy quantum storage. Our work thus connects two distinct approaches to commitment, i.e., the noisy channel and physical limitations.
Abstract: 噪声信道是构建密码学原语(如字符串承诺和不经意传输)的基础资源。 噪声信道模型已被扩展为不公平噪声信道,其中对手可以影响无记忆信道的参数。 在本工作中,我们引入了非结构化噪声信道模型,作为不公平噪声信道模型的推广,以允许对手在某些熵约束下任意操纵信道。 我们提出了一种具有已建立安全性的字符串承诺协议,并推导了其可行的承诺速率,证明了对抗这种更强对手类别的可行性。 此外,我们表明非结构化噪声信道模型中的熵约束可以从物理假设(如噪声量子存储)中得出。 因此,我们的工作将两种不同的承诺方法联系起来,即噪声信道和物理限制。
Comments: 19 pages, 2 figures
Subjects: Information Theory (cs.IT) ; Cryptography and Security (cs.CR)
Cite as: arXiv:2501.00281 [cs.IT]
  (or arXiv:2501.00281v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2501.00281
arXiv-issued DOI via DataCite

Submission history

From: Jiawei Wu [view email]
[v1] Tue, 31 Dec 2024 05:28:05 UTC (1,469 KB)
[v2] Sun, 24 Aug 2025 16:35:43 UTC (340 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-01
Change to browse by:
cs
cs.CR
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号