Unconditionally Secure Cryptography

无条件安全的密码学

• 批准号: RGPIN-2016-03882
• 负责人: Stinson, Douglas
• 金额: $ 3.93万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=634973
• 关键词: Unconditionally; Secure; Cryptography

Unconditionally secure cryptographic protocols refer to protocols that can be proven secure mathematically without the need for any assumptions regarding the intractability of underlying computational problems. The first example of an unconditionally secure cryptosystem was the one-time pad, which was proven secure by Shannon. There are by now many examples of many such schemes. Examples include certain types of authentication codes, secret sharing schemes, key predistribution schemes, commitment schemes, tracing schemes, broadcast encryption, and even some schemes that are most often studied in the public-key setting, such as signature schemes.

无条件安全加密协议是指可以在数学上证明安全的协议，而不需要对潜在计算问题的难解性进行任何假设。无条件安全密码系统的第一个例子是一次性密码，它被香农证明是安全的。到目前为止，这样的计划有很多例子。示例包括某些类型的身份验证码、秘密共享方案、密钥预分发方案、承诺方案、跟踪方案、广播加密，甚至是在公钥设置中最常研究的一些方案，例如签名方案。