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!

Buďte prvý, kto okomentuje tento záznam!