Sciweavers

ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
13 years 9 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers