Sciweavers

8 search results - page 1 / 2
» Provably Secure Universal Steganographic Systems
Sort
View
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 4 months ago
Provably Secure Universal Steganographic Systems
Boris Ryabko, Daniil Ryabko
IH
1998
Springer
13 years 9 months ago
An Information-Theoretic Model for Steganography
An information-theoretic model for steganography with passive adversaries is proposed. The adversary's task of distinguishing between an innocent cover message C and a modi e...
Christian Cachin
ESORICS
2007
Springer
13 years 11 months ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...
ISW
2004
Springer
13 years 10 months ago
Universally Composable Secure Mobile Agent Computation
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...
Ke Xu, Stephen R. Tate
INFORMATIKTAGE
2008
13 years 6 months ago
Practical Secure Function Evaluation
: This thesis focuses on the practical aspects of general two-party Secure Function Evaluation (SFE). A new SFE protocol that allows free evaluation of XOR gates and is provably se...
Thomas Schneider 0003