On the gold standard for security of universal steganography

DOI10.1007/978-3-319-78381-9_2zbMATH Open1423.94122arXiv1801.08154OpenAlexW2784812226MaRDI QIDQ1648780FDOQ1648780

Authors: Sebastian Berndt, Maciej Liśkiewicz 

Publication date: 9 July 2018

Abstract: 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.

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

Recommendations

• Automata, Languages and Programming
• On the universal steganography of optimal rate
• Theory of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 6861949

zbMATH Keywords

public-key steganographysecurity of universal steganography

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• New directions in cryptography
• Efficiency of a Good But Not Linear Set Union Algorithm
• Nonmalleable Cryptography
• Probability and Computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
• Enhancements of trapdoor permutations
• Advances in Cryptology - CRYPTO 2003
• Upper and lower bounds on black-box steganography
• Grey-box steganography
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Theory of Cryptography
• Automata, Languages and Programming
• Public Key Cryptography - PKC 2006
• An information-theoretic model for steganography
• Introduction to modern cryptography
• Adaptive trapdoor functions and chosen-ciphertext security
• Constructing perfect steganographic systems
• Domain specific high-level constraints for user interface layout
• Standard security does not imply indistinguishability under selective opening
• Security of symmetric encryption against mass surveillance
• Salembier's min-tree algorithm turned into breadth first search
• A more cautious approach to security against mass surveillance
• Inf-structuring functions: a unifying theory of connections and connected operators
• Tiling algebra for constraint-based layout editing
• A one-time stegosystem and applications to efficient covert communication
• Efficient Concurrent Covert Computation of String Equality and Set Intersection
• Viscous-hyperconnected attribute filters: a first algorithm
• Hyperconnectivity, Attribute-Space Connectivity and Path Openings: Theoretical Relationships
• A Comparative Review of Component Tree Computation Algorithms
• Provably Secure Steganography
• Connected morphological attribute filters on distributed memory parallel machines
• Broadcast steganography

Cited In (6)

• On the universal steganography of optimal rate
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
• Automata, Languages and Programming
• CCA security and trapdoor functions via key-dependent-message security
• Theory of Cryptography
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: On the gold standard for security of universal steganography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648780)