2432 search results - page 139 / 487 » Cryptographic logical relations |
103
Voted
ISSTA
2004
ACM
15 years 6 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
96
Voted
EUROCRYPT
2007
Springer
15 years 6 months ago
2007
Springer
Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing “cryptographically strong” permutations...
95
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
104
Voted
POPL
2000
ACM
15 years 5 months ago
2000
ACM
Adopting a programming-language perspective, we study the problem of implementing authentication in a distributed system. We define a process calculus with constructs for authent...
100
click to vote
IH
1998
Springer
15 years 4 months ago
1998
Springer
In the last few years, a large number of schemes have been proposed for hiding copyright marks and other information in digital pictures, video, audio and other multimedia objects....