On the Cryptographic Applications of Random Functions
On the Cryptographic Applications of Random Functions
复制标题
DOI：
10.1007/3-540-39568-7_22
复制
发表时间：
1984-08
期刊：
影响因子：
--
通讯作者：
Oded Goldreich;S. Goldwasser;S. Micali
中科院分区：
文献类型：
--
作者：
Oded Goldreich;S. Goldwasser;S. Micali
既然“随机函数”可以有效地构造（[GGM]），我们讨论它们在密码学中的一些可能应用：1）分发不可伪造的ID号，这些ID号可以由仅包含少量存储的站点本地验证。2）动态哈希：即使对手可以根据散列函数已经分配给先前密钥的值来改变密钥分布，他仍然不能强制冲突。3）构造确定性，无记忆认证方案，可证明其对选择消息攻击是安全的。4）构建身份敌友系统。
Now that “random functions” can be efficiently constructed([GGM]), we discuss some of their possible applications to cryptography:1)Distributing unforgable ID numbers which can be locally verified by stations which contain only a small amount of storage.2)Dynamic Hashing: even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the previous keys, still he can not force collisions.3)Constructing deterministic, memoryless authentication schemes which are provably secure against chosen message attack.4)Construction Identity Friend or Foe systems.