Automata, Languages and Programming
From MaRDI portal
Publication:5716784
DOI10.1007/11523468zbMath1082.94521OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716784
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (7)
On the gold standard for security of universal steganography ⋮ Security levels in steganography -- insecurity does not imply detectability ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ Grey-box steganography ⋮ Efficient construction of provably secure steganography under ordinary covert channels ⋮ Grey-Box Public-Key Steganography ⋮ CCA security and trapdoor functions via key-dependent-message security
This page was built for publication: Automata, Languages and Programming
