Non-repudiation without public-key
暂无分享,去创建一个
[1] Gilles Brassard,et al. A note on the complexity of cryptography (Corresp.) , 1979, IEEE Trans. Inf. Theory.
[2] Yacov Yacobi,et al. Cryptocomplexity and NP-Completeness , 1980, ICALP.
[3] Eric Bach,et al. Intractable Problems in Number Theory , 1988, CRYPTO.
[4] Gustavus J. Simmons,et al. Message Authentication with Arbitration of Transmitter/Receiver Disputes , 1987, EUROCRYPT.
[5] Thomas Johansson,et al. On the Construction of Perfect Authentication Codes that Permit Arbitration , 1993, CRYPTO.
[6] Thomas Johansson,et al. On A²-Codes Including Arbiter's Attacks , 1994, EUROCRYPT.
[7] Richard Taylor,et al. Near Optimal Unconditionally Secure Authentication , 1994, EUROCRYPT.
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Douglas R. Stinson. Universal Hashing and Authentication Codes , 1991, CRYPTO.
[10] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[11] Kaoru Kurosawa,et al. New Bound on Authentication Code with Arbitration , 1994, CRYPTO.
[12] Rolf Blom,et al. An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.
[13] Thomas Johansson,et al. On Families of Hash Functions via Geometric Codes and Concatenation , 1993, CRYPTO.
[14] Hans-Joachim Knobloch,et al. A Smart Card Implementation of the Fiat-Shamir Identification Scheme , 1988, EUROCRYPT.
[15] Moti Yung,et al. Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract) , 1990, CRYPTO.