56 search results - page 6 / 12 » Functional Correctness Proofs of Encryption Algorithms |
EUROCRYPT
2004
Springer
14 years 1 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
TKDE
2010
13 years 6 months ago
2010
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
TPHOL
2003
IEEE
14 years 27 days ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
ML
2007
ACM
13 years 7 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...