论文信息 - A "Paradoxical" Solution to the Signature Problem (Extended Abstract)

A "Paradoxical" Solution to the Signature Problem (Extended Abstract)

We present a general signature scheme which uses any pair of trap-door permutations (f0, f1) for which it is infeasible to find any x, y with f0(x) = f1(y). The scheme possesses the novel property of being robust against an adaptive chosen message attack: no adversary who first asks for and then receives sgnatures for messages of his choice (which may depend on previous signatures seen) can later forge the signature of even a singl additional message.

[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[2] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[3] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.

[4] Martin E. Hellman,et al. Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[5] Silvio Micali,et al. Strong signature schemes , 1983, STOC '83.

[6] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.

[7] Adi Shamir,et al. An efficient signature scheme based on quadratic equations , 1984, STOC '84.

[8] Karl J. Lieberherr,et al. Uniform Complexity and Digital Signatures , 1981, Theor. Comput. Sci..

[9] A. Shamir. A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, FOCS 1982.

[10] Hugh C. Williams,et al. A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[11] Manuel Blum,et al. Coin Flipping by Telephone. , 1981, CRYPTO 1981.

[12] Stephen M. Matyas. Digital Signatures - An Overview , 1979, Comput. Networks.

[13] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[14] Gideon Yuval,et al. How to Swindle Rabin , 1979, Cryptologia.