Formal security proofs with minimal fuss: Implicit computational complexity at work-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Formal security proofs with minimal fuss: Implicit computational complexity at work

Published:2015-04 Issue: Volume:241 Page:96-113
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Nowak David,Zhang Yu

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference36 articles.

1. Certifying assembly with formal cryptographic proofs: the case of BBS;Affeldt;Sci. Comput. Program.,2012

2. A formal language for cryptographic pseudocode;Backes,2008

3. Computational indistinguishability logic;Barthe,2010

4. Computer-aided security proofs for the working cryptographer;Barthe,2011

5. Formal certification of code-based cryptographic proofs;Barthe,2009

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A multistage protocol for aggregated queries in distributed cloud databases with privacy protection;Future Generation Computer Systems;2019-01

2. Paths-based criteria and application to linear logic subsystems characterizing polynomial time;Information and Computation;2018-08

3. Formal proof of polynomial-time complexity with quasi-interpretations;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs;2018-01-08

4. Formal proof of polynomial-time complexity with quasi-interpretations;Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP