Institutional Repository
| the computational slr: a logic for reasoning about computational indistinguishability | |
| Zhang Yu | |
| 2009 | |
| Conference Name | 9th International Conference on Typed Lambda Calculi and Applications |
| Source | Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications |
| Pages | 401-415 |
| Conference Date | JUL 01-03, |
| Conference Place | Brasilia, BRAZIL |
| Indexed Type | istp,acm,sci |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS |
| ISSN | 0302-9743 |
| ISBN | 978-3-642-02272-2 |
| Department | CAS, Inst Software, Comp Sci Lab, Beijing, Peoples R China. |
| English Abstract | Computational indistinguishability is a notion in complexity-theoretic cryptography and is used to define many security criteria. However, in traditional cryptography, proving computational indistinguishability is usually informal and becomes error-prone when cryptographic constructions are complex. This paper presents a formal proof system based on an extension of Hofmanns SLR language, which can capture probabilistic polynomial-time computations through typing and is sufficient for expressing cryptographic constructions. We in particular define rules that justify directly the computational indistinguishability between programs and prove that these rules are sound with respect to the set-theoretic semantics, hence the standard definition of security. We also show that it is applicable in cryptography by verifying, in our proof system, Goldreich and Micalis construction of pseudorandom generator. |
| Sponsorship | Univ Brasilia, Brazilian Counsel Technol & Sci Dept, CNPq, Brazilian Coordinat Improvement Higher Educ Personnel, CAPES, Fed District Res Fdn, FAPDF |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8320 |
| Collection | 2009年期刊/会议论文 |
| Recommended Citation GB/T 7714 | Zhang Yu. the computational slr: a logic for reasoning about computational indistinguishability[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS,2009:401-415. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment