Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Information disclosure in the framework of Kolmogorov complexity

From MaRDI portal
Publication:2699959
Jump to:navigation, search

DOI10.1016/j.tcs.2022.10.001OpenAlexW3192609948MaRDI QIDQ2699959

Nikolai K. Vereshchagin

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.01685

zbMATH Keywords

cryptographyKolmogorov complexityinformation transmissioninformation disclosure


Mathematics Subject Classification ID

Theory of computing (68Qxx)




Cites Work

  • Unnamed Item
  • On joint conditional complexity (entropy)
  • Kolmogorov complexity and cryptography
  • Kolmogorov Complexity and Algorithmic Randomness
  • Information distance
  • An Operational Characterization of Mutual Information in Algorithmic Information Theory
  • Theory and Applications of Models of Computation
  • Conditional complexity and codes
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2699959&oldid=15550657"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 12:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki