239 search results - page 3 / 48 » Proof Techniques for Cryptographic Processes |
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
CSFW
2009
IEEE
14 years 3 days ago
2009
IEEE
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
WEA
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...
CDB
2004
Springer
13 years 10 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....