Broadcast Steganography

Fazio, Nelly; Nicolosi, Antonio; Perera, Irippuge Milinda

doi:10.1007/978-3-319-04852-9_4

Cited by 8 publications

(6 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They showed that an atomic private broadcast encryption scheme with fully anonymous must have a ciphertext size of Ω(n · k), where n is the number of broadcast set and k is the security parameter. Recently, Fazio, Nicolosi and Perera [13] studied the broadcast steganography and introduced a new construction called outsider-anonymous broadcast encryption with pseudorandom ciphertexts, which achieves sublinear ciphertext size and is secure without random oracles.…”

Section: Related Workmentioning

confidence: 99%

Anonymous Identity-Based Broadcast Encryption with Revocation for File Sharing

Lai

Guo

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

Traditionally, a ciphertext from an identity-based broadcast encryption can be distributed to a group of receivers whose identities are included in the ciphertext. Once the ciphertext has been created, it is not possible to remove any intended receivers from it without conducting decryption. In this paper, we consider an interesting question: how to remove target designated receivers from a ciphertext generated by an anonymous identity-based broadcast encryption? The solution to this question is found applicable to file sharing with revocation. In this work, we found an affirmative answer to this question. We construct an anonymous identity-based broadcast encryption, which offers the user revocation of ciphertext and the revocation process does not reveal any information of the plaintext and receiver identity. In our proposed scheme, the group of receiver identities are anonymous and only known by the encryptor. We prove that our scheme is semantically secure in the random oracle model. Abstract. Traditionally, a ciphertext from an identity-based broadcast encryption can be distributed to a group of receivers whose identities are included in the ciphertext. Once the ciphertext has been created, it is not possible to remove any intended receivers from it without conducting decryption. In this paper, we consider an interesting question: how to remove target designated receivers from a ciphertext generated by an anonymous identity-based broadcast encryption? The solution to this question is found applicable to file sharing with revocation. In this work, we found an affirmative answer to this question. We construct an anonymous identity-based broadcast encryption, which offers the user revocation of ciphertext and the revocation process does not reveal any information of the plaintext and receiver identity. In our proposed scheme, the group of receiver identities are anonymous and only known by the encryptor. We prove that our scheme is semantically secure in the random oracle model.

show abstract

Section: Related Workmentioning

confidence: 99%

Anonymous Identity-Based Broadcast Encryption with Revocation for File Sharing

Lai

Guo

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

show abstract

“…An example opposite to that mentioned in [10] is when one sender shares information over a steganographic channel with multiple recipients. This approach was named Broadcast Steganography and presented in [11]. In [11] the authors additionally used encryption to make the hidden message readable only to the authenticated users.…”

Section: • Knowledge Management Use -When Individual Unitsmentioning

confidence: 99%

StegFog: Distributed Steganography Applied to Cyber Resiliency in Multi Node Environments

2022

View full text Add to dashboard Cite

This paper presents a new study about the communication system named StegFog. It is based on applying distributed steganography linked with the concept of cyberfog security. The idea of cyberfog is to secure data by splitting it into numerous fragments and spreading them to end-user devices. The design of StegFog combines steganographic methods previously investigated by the Authors -StegHash and SocialSteg Disc. The reference design of the system is proposed and analyzed in terms of security, reliability, performance and timing. To prove the feasibility of the proposed solution, the prototype of StegFog was implemented, consisting of steganographic nodes operating over BitTorrent P2P networks with a hidden communication channel established by the multimedia files shared within it. Experiments were conducted for the implemented prototype to understand the basic features of the system, such as operational aspects of the address generator constructed using the modified StegHash method, timing of the basic methods within the system -reading, writing and notifying, steganographic rate of the system and overall security provided by the system. The presented results show how system such as StegFog aligned with the cyberfog security concept could be considered as the practical protection measure for secure network communications. The challenges and research directions to extend the concept are also discussed.

show abstract

“…Hopper [21] posed as a challenging open problem to show the (non)existence of a universal SS-CCA-secure stegosystem. Since more than a decade, public key steganography has been used as a tool in different contexts (e. g. broadcast steganography [17] and private computation [9,11]), but this fundamental question remained open.…”

Section: Introductionmentioning

confidence: 99%

“…This strengthens the need for universal stegosystems, as even tiny approximation errors of the channel distribution may lead to huge changes with regard to the security of the system. Fazio, Nicolosi and Perera [17] extended public-key steganography to the multi-recipient setting, where a single sender communicates with a dynamically set of receivers. Their system is designed such that no outside party and no unauthorized user is able to detect the presence of these broadcast communication.…”

Section: Introductionmentioning

confidence: 99%

On the Gold Standard for Security of Universal Steganography

Berndt

Liśkiewicz

2018

Advances in Cryptology – EUROCRYPT 2018

View full text Add to dashboard Cite

While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key counterpart resist persistent attempts to solve them. The computational model for public-key steganography was proposed by von Ahn and Hopper in EUROCRYPT 2004. At TCC 2005, Backes and Cachin gave the first universal public-key stegosystem -i. e. one that works on all channels -achieving security against replayable chosen-covertext attacks (SS-RCCA) and asked whether security against non-replayable chosen-covertext attacks (SS-CCA) is achievable. Later, Hopper (ICALP 2005) provided such a stegosystem for every efficiently sampleable channel, but did not achieve universality. He posed the question whether universality and SS-CCA-security can be achieved simultaneously. No progress on this question has been achieved since more than a decade. In our work we solve Hopper's problem in a somehow complete manner: As our main positive result we design an SS-CCA-secure stegosystem that works for every memoryless channel. On the other hand, we prove that this result is the best possible in the context of universal steganography. We provide a family of 0-memoryless channels -where the already sent documents have only marginal influence on the current distribution -and prove that no SS-CCA-secure steganography for this family exists in the standard non-look-ahead model.

show abstract

Broadcast Steganography

Cited by 8 publications

References 36 publications

Anonymous Identity-Based Broadcast Encryption with Revocation for File Sharing

Anonymous Identity-Based Broadcast Encryption with Revocation for File Sharing

StegFog: Distributed Steganography Applied to Cyber Resiliency in Multi Node Environments

On the Gold Standard for Security of Universal Steganography

Contact Info

Product

Resources

About