摘要: We define a Universal One-Way Hash Function family, new primitive which enables the compression of elements in function domain. The main property this is that given an element x. prove constructively universal one-way hash functions exist if any 1-1 exist.Among various applications based Secure Digital Signature Scheme, system on existence Functions and secure against most general attack known. Previously, all provably signature schemes were stronger mathematical assumption trapdoor exist.
acm.org
core.ac.uk
sci-hub.se 参考文章(24)
Ivan Bjerre Damgård, Collision free hash functions and public key signature schemes theory and application of cryptographic techniques. ,vol. 304, pp. 203- 216 ,(1987) , 10.1007/3-540-39118-5_19
Ralph Charles Merkle, Secrecy, authentication, and public key systems ,(1979)
M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION MIT Laboratory for Computer Science. ,(1979)
Ralph C. Merkle, A Certified Digital Signature international cryptology conference. pp. 218- 238 ,(1989) , 10.1007/0-387-34805-0_21
Amos Fiat, Adi Shamir, How to prove yourself: practical solutions to identification and signature problems international cryptology conference. ,vol. 263, pp. 186- 194 ,(1987) , 10.1007/3-540-47721-7_12
Ralph C. Merkle, A Digital Signature Based on a Conventional Encryption Function international cryptology conference. pp. 369- 378 ,(1987) , 10.1007/3-540-48184-2_32
Mihir Bellare, Silvio Micali, How To Sign Given Any Trapdoor Function international cryptology conference. pp. 200- 215 ,(1988) , 10.1007/0-387-34799-2_15
Mark N. Wegman, J.Lawrence Carter, New hash functions and their use in authentication and set equality Journal of Computer and System Sciences. ,vol. 22, pp. 265- 279 ,(1981) , 10.1016/0022-0000(81)90033-7
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 44- 61 ,(1989) , 10.1145/73007.73012