a calculus for game-based security proofs
文献类型：会议论文
| 作者 | Nowak David ; Zhang Yu |
| 出版日期 | 2010 |
| 会议名称 | 4th International Conference on Provable Security, ProvSec 2010 |
| 会议日期 | 40829 |
| 会议地点 | Malacca, Malaysia |
| 关键词 | Calculations Differentiation (calculus) Polynomial approximation Public key cryptography |
| 页码 | 35-52 |
| 英文摘要 | 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. © 2010 Springer-Verlag. |
| 收录类别 | EI,ACM |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 3642162797 |
| 源URL | [http://124.16.136.157/handle/311060/8572]  |
| 专题 | 软件研究所_软件所图书馆_2010软件所会议论文 |
| 推荐引用方式 GB/T 7714 | Nowak David,Zhang Yu. a calculus for game-based security proofs[C]. 见:4th International Conference on Provable Security, ProvSec 2010. Malacca, Malaysia. 40829. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。