A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Notions of computation and monads
Information and Computation
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Stochastic lambda calculus and monads of probability distributions
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Formal Approach to Probabilistic Termination
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Logics for reasoning about cryptographic constructions
Journal of Computer and System Sciences - Special issue on FOCS 2003
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Towards automated proofs for asymmetric encryption schemes in the random oracle model
Proceedings of the 15th ACM conference on Computer and communications security
Formal certification of code-based cryptographic proofs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Formal Language for Cryptographic Pseudocode
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Formal Verification of Arithmetic-Based Cryptographic Primitives
Information Security and Cryptology --- ICISC 2008
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A framework for game-based security proofs
ICICS'07 Proceedings of the 9th international conference on Information and communications security
A probabilistic hoare-style logic for game-based cryptographic proofs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Automated security proofs with sequences of games
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The computational slr: A logic for reasoning about computational indistinguishability
Mathematical Structures in Computer Science
Proving the security of ElGamal encryption via indistinguishability logic
Proceedings of the 2011 ACM Symposium on Applied Computing
A formalization of polytime functions
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
| Hi-index | 0.00 |
The game-based approach to security proofs in cryptography is a widely-used methodology for writing proofs rigorously. However a unifying language for writing games is still missing. In this paper we show how CSLR, a probabilistic lambda-calculus with a type system that guarantees that computations are probabilistic polynomial time, can be equipped with a notion of game indistinguishability. This allows us to define cryptographic constructions, effective adversaries, security notions, computational assumptions, game transformations, and game-based security proofs in the unified framework provided by CSLR. Our code for cryptographic constructions is close to implementation in the sense that we do not assume arbitrary uniform distributions but use a realistic algorithm to approximate them. We illustrate our calculus on cryptographic constructions for public-key encryption and pseudorandom bit generation.