a calculus for game-based security proofs

ISCAS OpenIR > 2010软件所会议论文

	a calculus for game-based security proofs
	Nowak David; Zhang Yu
	2010
会议名称	4th International Conference on Provable Security, ProvSec 2010
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	35-52
会议日期	40829
会议地点	Malacca, Malaysia
收录类别	ei,acm
出版地	Germany
ISSN	3029743
ISBN	3642162797
部门归属	(1) Research Center for Information Security, AIST, Japan; (2) Institute of Software, Chinese Academy of Sciences, China
摘要	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.
关键词	Calculations Differentiation (Calculus) Polynomial Approximation Public Key Cryptography
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8572
专题	2010软件所会议论文
推荐引用方式 GB/T 7714	Nowak David,Zhang Yu. a calculus for game-based security proofs[C]. Germany,2010:35-52.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
a calculus for game-（349KB）			限制开放	--	请求全文