1401 search results - page 58 / 281 » Randomness in Interactive Proofs |
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract? In this paper we present an LSB steganalysis technique that can detect the existence of hidden messages that are randomly embedded in the least significant bits of natura...
112
click to vote
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we formally prove that padding the plaintext with a random bit-string provides the semantic security against chosen plaintext attack (IND-CPA) for the McEliece (and ...
SEFM
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
PKC
2007
Springer
15 years 3 months ago
2007
Springer
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...