[2606.30261] Robust secret storage in networks

Skip to main content

arXiv is now an independent nonprofit!<br>Learn more<br>&times;

Search arXiv

Press Enter to search &middot; Advanced search

-->

Condensed Matter > Statistical Mechanics

arXiv:2606.30261 (cond-mat)

[Submitted on 29 Jun 2026]

Title:Robust secret storage in networks

Authors:Vinko Zlatić<br>View a PDF of the paper titled Robust secret storage in networks, by Vinko Zlati\'c

View PDF<br>HTML (experimental)

Abstract:The problem of storing secure information on a network is studied. A formal framework for distributed secret storage is introduced, and possible applications in technological and social systems are discussed. The problem is formulated as the optimization of a robustness functional in which two competing requirements are balanced: survivability under network-degrading processes and resistance to adversarial compromise. An exact representation of survivability is derived in terms of minimal information-carrying subgraphs (MICS), which provide a reduced description of the reconstruction events relevant to the stored information. This representation is then used to construct semi-local optimization methods whose dynamics do not require global knowledge of the network structure. Finally, it is shown that, in a limiting case, the robustness functional can be mapped naturally to an effective spin Hamiltonian.

Comments:<br>14 pages, 7 figures, 2 tables

Subjects:

Statistical Mechanics (cond-mat.stat-mech); Cryptography and Security (cs.CR); Physics and Society (physics.soc-ph)

ACM classes:<br>H.3.5; E.3

Cite as:<br>arXiv:2606.30261 [cond-mat.stat-mech]

(or<br>arXiv:2606.30261v1 [cond-mat.stat-mech] for this version)

https://doi.org/10.48550/arXiv.2606.30261

Focus to learn more

arXiv-issued DOI via DataCite

Submission history<br>From: Vinko Zlatić [view email]<br>[v1]<br>Mon, 29 Jun 2026 13:09:25 UTC (1,085 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Robust secret storage in networks, by Vinko Zlati\'c<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cond-mat.stat-mech

next >

new<br>recent<br>| 2026-06

Change to browse by:

cond-mat<br>cs<br>cs.CR<br>physics<br>physics.soc-ph

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender<br>(What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

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? |<br>Disable MathJax (What is MathJax?)

Major funding support from