154 search results - page 4 / 31 » Cryptographically Sound Theorem Proving |
FASE
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
CSFW
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
EUROCRYPT
2010
Springer
14 years 13 days ago
2010
Springer
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
CCS
2009
ACM
14 years 2 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...