82 search results - page 11 / 17 » Inductive Proofs of Computational Secrecy |
102
Voted
CADE
1990
Springer
15 years 4 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
115
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
148
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
175
Voted
SLOGICA
2011
14 years 7 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
107
click to vote
AIML
2008
15 years 1 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...