Formal security proofs with minimal fuss: Implicit computational complexity at work

We show how implicit computational complexity can be used in order to increase confidence in game-based security proofs in cryptography. For this purpose we extend CSLR, a probabilistic lambda-calculus with a type system that guarantees the existence of a probabilistic polynomial-time bound on compu...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 241; pp. 96 - 113
Main Authors:	Nowak, David, Zhang, Yu
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.04.2015 Elsevier
Subjects:	Computational Complexity Computer Science Cryptography Cryptography and Security Lambda-calculus Logic in Computer Science Probabilistic computation Programming Languages Safe recursion Probabilistic computation Cryptography Safe recursion Lambda-calculus cryptography safe recursion lambda-calculus probabilistic computation
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!