3228 search results - page 153 / 646 » Computationally Sound Proofs |
182
click to vote
ICSAP
2010
15 years 8 months ago
2010
- This paper describes a novel algorithm designed for tamper proofing of 3D models. Fragile watermarking is a known technique for detecting location of tamper in the artwork. Howev...
187
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
HMAC was proved in [3] to be a PRF assuming that (1) the underlying compression function is a PRF, and (2) the iterated hash function is weakly collision-resistant. However, recent...
170
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
170
click to vote
TCC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
178
click to vote
ICFEM
2003
Springer
15 years 11 months ago
2003
Springer
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...