HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS
复制标题
DOI：
10.1007/3-540-47721-7_12
复制
发表时间：
1987-01-01
期刊：
影响因子：
--
通讯作者：
SHAMIR, A
中科院分区：
文献类型：
--
作者：
FIAT, A;SHAMIR, A
在本文中，我们描述了简单的识别和签名方案，使任何用户证明他的身份和他的消息的真实性，任何其他用户没有共享或公钥。如果分解是困难的，这些方案可以证明是安全的，可以抵抗任何已知的或选择的消息攻击，并且典型的实现只需要RSA方案所需的模乘数量的1%到4%。由于它们的简单性、安全性和速度，这些方案非常适合于基于微处理器的设备，如智能卡、个人计算机和远程控制系统。
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.