Sciweavers

1286 search results - page 31 / 258
» A Practical Modelling Notation for Secure Distributed Comput...
Sort
View
MMSEC
2006
ACM
129views Multimedia» more  MMSEC 2006»
14 years 1 months ago
WLAN steganography: a first practical review
Two different approaches for constructing a steganographic channel in an IEEE 802.11 (WLAN) network are introduced in this paper. First test results on the reliability, undetectab...
Christian Krätzer, Jana Dittmann, Andreas Lan...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
PKC
2009
Springer
121views Cryptology» more  PKC 2009»
14 years 8 months ago
On the Theory and Practice of Personal Digital Signatures
We take a step towards a more realistic modeling of personal digital signatures, where a human user, his mobile equipment, his PC and a server are all considered as independent pla...
Gert Læssøe Mikkelsen, Ivan Damg&arin...
JPDC
2007
86views more  JPDC 2007»
13 years 7 months ago
Performance evaluation of a new scheduling algorithm for distributed systems with security heterogeneity
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
Tao Xie 0004, Xiao Qin
ICISC
2008
126views Cryptology» more  ICISC 2008»
13 years 9 months ago
Essentially Optimal Universally Composable Oblivious Transfer
Oblivious transfer is one of the most important cryptographic primitives, both for theoretical and practical reasons and several protocols were proposed during the years. We provid...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...