How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A logic for reasoning about probabilities
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A calculus for cryptographic protocols
Information and Computation
Practice-Oriented Provable Security
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
Adaptive security of symbolic encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Towards mechanized correctness proofs for cryptographic algorithms
Science of Computer Programming
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Computational indistinguishability logic
Proceedings of the 17th ACM conference on Computer and communications security
The computational slr: A logic for reasoning about computational indistinguishability
Mathematical Structures in Computer Science
A calculus for game-based security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
On the equality of probabilistic terms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Proving the security of ElGamal encryption via indistinguishability logic
Proceedings of the 2011 ACM Symposium on Applied Computing
Axiomatizing resource bounds for measure
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A computational indistinguishability logic for the bounded storage model
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Computational soundness of coinductive symbolic security under active attacks
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Fully automated analysis of padding-based encryption in the computational model
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We present two logical systems for reasoning about cryptographic constructions which are sound with respect to standard cryptographic definitions of security. Soundness of the first system is proved using techniques from non-standard models of arithmetic. Soundness of the second system is proved by an interpretation into the first system. We also present examples of how these systems may be used to formally prove the correctness of some elementary cryptographic constructions.