How to prove yourself: Practical solutions to identification and signature problems
发表信息
作者
- Amos Fiat
- Adi Shamir
笔记
In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.
在本文中，我们描述了简单的身份识别和签名方案，这些方案使任何用户能够在没有共享密钥或公钥的情况下，向其他用户证明其身份和消息的真实性。这些方案在因数分解困难的情况下，能够被证明对任何已知或选择消息攻击是安全的，且典型实现所需的模乘法运算仅为RSA方案所需运算的1%到4%。由于其简单性、安全性和速度，这些方案非常适合用于基于微处理器的设备，如智能卡、个人计算机和遥控系统。