Sciweavers

6 search results - page 2 / 2
» Computationally Sound Symbolic Secrecy in the Presence of Ha...
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
13 years 4 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...