Information-Theoretic Cryptography and Steganography
A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".
Deadline for manuscript submissions: closed (15 March 2024) | Viewed by 1594
Special Issue Editor
2. Department of Information Technologies, Novosibirsk State University, 630090 Novosibirsk, Russia
Interests: information theory; cryptography and steganography; mathematical statistics and prediction; complexity of algorithms and mathematical biology
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
In the mid-twentieth century, Claude Shannon published two papers, "Mathematical Theory of Communication" and "Communication Theory of Secret Systems", which gave rise to information theory and modern cryptography respectively. In the following years, numerous results were obtained at the intersection of both fields, as well as computer science, and a new scientific field emerged, which is now called information-theoretic cryptography.
The main goal of information-theoretic cryptography is to achieve security in the presence of computationally unbounded adversaries. The so-called information-theoretic steganography has a similar goal: to achieve undetectable data hiding against a computationally unconstrained steganalyser.
Currently, hundreds of researchers are working in the field of information-theoretic cryptography and steganography, presenting their results in dozens of journals and conferences. But, despite numerous interesting results, many problems in the field of information-theoretic cryptography and steganography have not been solved, including those related to ciphers with secret keys, random number generators with proven properties, as well as various protocols for information security systems.
This Special Issue will publish high-quality, original research papers dealing with topics such as:
- Secure multi-party computation
- Information-theoretic reductions
- Information theoretic proof systems
- Information theoretic steganography
- Idealized models (e.g., ideal channels, random oracle)
- Bounded storage models
- Secret sharing
- Authentication codes and non-malleable codes
- Randomness extraction and privacy amplification
- Private information retrieval and locally decodable code
This special issue is intended to be a forum for new presentations of results in the field of information-theoretic cryptography and steganography. In addition, new ideas for the development of information theory and computer science may be discovered.
Prof. Dr. Boris Ryabko
Guest Editor
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- cryptography
- information theory
- steganography
- computationally unbounded adversary
