Practical Proven Secure Authentication with Arbitration
暂无分享,去创建一个
[1] Silvio Micali,et al. How to sign given any trapdoor permutation , 1992, JACM.
[2] Mihir Bellare,et al. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.
[3] Moti Yung,et al. Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract) , 1990, CRYPTO.
[4] Ernest F. Brickell,et al. Authentication Codes with Multiple Arbiters (Extended Abstract) , 1988, EUROCRYPT.
[5] Moti Yung,et al. Systematic Design of Two-Party Authentication Protocols , 1991, CRYPTO.
[6] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[7] Adi Shamir,et al. The discrete log is very discreet , 1990, STOC '90.
[8] Silvio Micali,et al. How To Sign Given Any Trapdoor Function , 1988, CRYPTO.
[9] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[10] Stephen M. Matyas,et al. Cryptography: A New Dimension in Computer Data Security--A Guide for the Design and Implementation of Secure Systems , 1982 .
[11] Abraham Bookstein,et al. Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .
[12] Richard J. Lipton,et al. Foundations of Secure Computation , 1978 .
[13] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[14] Fred Piper,et al. Stream Ciphers , 1982, EUROCRYPT.