• A One-Time Stegosystem and App...

Treffer: A One-Time Stegosystem and Applications to Efficient Covert Communication

Title:
A One-Time Stegosystem and Applications to Efficient Covert Communication
Authors:
KIAYIAS, Aggelos, RAEKOW, Yona, RUSSELL, Alexander, SHASHIDHAR, Narasimha
Source:
Journal of cryptology. 27(1):23-44
Publisher Information:
New York, NY: Springer, 2014.
Publication Year:
2014
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Théorie du signal et des communications, Signal and communications theory, Cryptographie, Cryptography, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Secret, Transmission et modulation (techniques et équipements), Transmission and modulation (techniques and equipments), Entropie, Entropy, Entropía, Méthode combinatoire, Combinatorial method, Método combinatorio, Protection information, Information protection, Protección información, Stéganalyse, Steganalysis, Estaganalisis, Stéganographie, Stéganography, Esteganografía, Sécurité télécommunication, Telecommunication security, Théorie information, Information theory, Teoría información, Transmission message, Message transmission, Transmisión mensaje, Covert communication, Data hiding, Information hiding, Steganography
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, United States
Fraunhofer Institute for Algorithms and Scientific Computing, St. Augustin, Germany
Department of Computer Science, Sam Houston State University, Huntsville, TX, United States
ISSN:
0933-2790
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=28569686
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.28569686
Database:
PASCAL Archive

Weitere Informationen

We present the first information-theoretic steganographic protocol with an asymptotically optimal ratio of key length to message length that operates on arbitrary covertext distributions with constant min-entropy. Our results are also applicable to the computational setting: our stegosystem can be composed over a pseudorandom generator to send longer messages in a computationally secure fashion. In this respect our scheme offers a significant improvement in terms of the number of pseudorandom bits generated by the two parties in comparison to previous results known in the computational setting. Central to our approach for improving the overhead for general distributions is the use of combinatorial constructions that have been found to be useful in other contexts for derandomization: almost t-wise independent function families.