Practical Yet Provably Secure Public-Key Primitives

实用且可证明安全的公钥原语

• 批准号: 0310297
• 负责人: Victor Shoup
• 金额: $ 30万
• 依托单位: New York University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-08-15 至 2007-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0310297&HistoricalAwards=false
• 关键词: Practical; Yet; Provably; Secure; Public

NSF Proposal 0310297Practical yet Provably Secure Public-Key PrimitivesVictor ShoupThis research addresses the fundamental building blocks, or primitives, ofpublic-key cryptography, and attempts to design and analyze new primitivesthat improve the state of the art, either through increased efficiency orincreased security. The objectives are to design new primitives suitable forpublication in academic journals, as well as for submission to relevantstandards bodies. The methods used include (1) the "reductionist" approach ofmodern cryptography, whereby the security of a scheme is formally reduced tothe presumed intractability of well-studied mathematical problems (e.g.,factoring), and (2) algorithmic techniques from number theory and algebra. Public-key cryptography plays an essential role in securing computers andcommunication networks. The two basic public-key primitives are public-keyencryption and digital signatures. The first primitive allows a sender tosecretly transmit a message to a receiver, where the sender only needs to knowa public key (known to everyone), while only the receiver needs to know the corresponding secret key. The second primitive allows a signer, using a secretkey, to generate a digital signature on a message so that the signature canlater be verified by any party using a corresponding public key.Although substantial progress has been made in recent years on these problems, there is still more work to do, in terms of improving the efficiency of theschemes, reducing the strength of the intractability assumptions, improvingthe quality of the security reductions, and in developing practical distributedversions of these schemes so as to avoid a single point of failure. These arethe specific tasks taken on by this research.

NSF提案0310297实用但可证明安全的公钥原语victor shoup本研究解决了公钥密码学的基本构建块或原语，并试图设计和分析新的原语，通过提高效率或提高安全性来提高技术水平。目标是设计适合在学术期刊上发表的新原语，以及提交给相关标准机构。使用的方法包括(1)现代密码学的“简化”方法，其中方案的安全性被正式地简化为对充分研究的数学问题（例如，因子分解）的假定难解性，以及(2)数论和代数的算法技术。公钥密码学在保护计算机和通信网络安全方面起着至关重要的作用。两个基本的公钥原语是公钥加密和数字签名。第一个原语允许发送方秘密地向接收方发送消息，其中发送方只需要知道一个公钥（每个人都知道），而接收方只需要知道相应的秘密密钥。第二个原语允许签名者使用秘钥在消息上生成数字签名，以便任何一方可以使用相应的公钥验证签名。尽管近年来在这些问题上取得了实质性进展，但在提高这些方案的效率、降低难处理假设的强度、提高安全缩减的质量以及开发这些方案的实际分布式版本以避免单点故障方面，仍有更多的工作要做。这些都是本研究的具体任务。