1302 search results - page 152 / 261 » Free-Style Theorem Proving |
IJNSEC
2006
13 years 10 months ago
2006
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
IPL
2006
13 years 10 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...
JCT
2006
13 years 10 months ago
2006
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletio...
ENTCS
2007
13 years 10 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...