3333 search results - page 268 / 667 » Abstract Proof Search |
169
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
160
click to vote
ASIAN
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
175
click to vote
CIE
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
163
click to vote
CSL
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
166
click to vote
EUROCRYPT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Multiparty signature protocols need protection against roguekey attacks, made possible whenever an adversary can choose its public key(s) arbitrarily. For many schemes, p...