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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information and computation Ročník 241; s. 96 - 113
Hlavní autori: Nowak, David, Zhang, Yu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.04.2015
Elsevier
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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 computations. This allows us to define cryptographic constructions, feasible adversaries, security notions, computational assumptions, game transformations, and game-based security proofs in a unified framework. We also show that the standard practice of cryptographers, ignoring that polynomial-time Turing machines cannot generate all uniform distributions, is actually sound. We illustrate our calculus on cryptographic constructions for public-key encryption and pseudorandom bit generation.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2014.10.008