Multiuser online system is useful, but the administrator must be nervous at security problem. To solve this problem, the authors propose applying signature verification to multiuser online system. At the authors＇ res...Multiuser online system is useful, but the administrator must be nervous at security problem. To solve this problem, the authors propose applying signature verification to multiuser online system. At the authors＇ research, they attempt adding signature verification function based on DP （Dynamic Programming） matching to existing multiuser online kanji learning system. In this paper, the authors propose the construction of the advance system and methods of signature verification, and evaluate performance of those signature verification methods that difference is combination of using features. From signature verification＇s experimental results, the authors adopted to use writing velocity and writing speed differential as using feature to verify the writer for the system. By using signature database which is construct with 20 genuine signatures and 20 forged signatures with 40 writers and written mostly by English or Chinese literal, experimental results of signature verification records 12.71% as maximum EER （Equal Error Rate）, 6.00% as minimum EER, and 8.22% as average EER. From mentioned above, the authors realized to advance the reliability and usefulness of the multiuser online kanji learning system.展开更多
Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and cons...Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and construct a low-computation certificateless hybrid signcryption scheme. In the random oracle model, this scheme is proven to have indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the elliptic-curve computation Diffie-Hellman assumption. Also, it has a strong existential unforgeability against adaptive chosen-message attacks （sUF-CMA） under the elliptic-curve discrete logarithm assumption. Analysis shows that the cryptographic algorithm does not rely on pairing operations and is much more etticient than other algorithms. In addition, it suits well to applications in environments where resources are constrained, such as wireless sensor networks and ad hoc networks.展开更多
文摘Multiuser online system is useful, but the administrator must be nervous at security problem. To solve this problem, the authors propose applying signature verification to multiuser online system. At the authors＇ research, they attempt adding signature verification function based on DP （Dynamic Programming） matching to existing multiuser online kanji learning system. In this paper, the authors propose the construction of the advance system and methods of signature verification, and evaluate performance of those signature verification methods that difference is combination of using features. From signature verification＇s experimental results, the authors adopted to use writing velocity and writing speed differential as using feature to verify the writer for the system. By using signature database which is construct with 20 genuine signatures and 20 forged signatures with 40 writers and written mostly by English or Chinese literal, experimental results of signature verification records 12.71% as maximum EER （Equal Error Rate）, 6.00% as minimum EER, and 8.22% as average EER. From mentioned above, the authors realized to advance the reliability and usefulness of the multiuser online kanji learning system.
基金the National Natural Science Foundation of China （Nos. 61572303, 61363080, and 61272436）, the Foundation of State Key Laboratory of Information Security （No. 2015-MS-10）, and the Foundation of Basic Research of Qinghai Province, China （No. 2016-ZJ-776）
文摘Hybrid signcryption is an important technique signcrypting bulk data using symmetric encryption. In this paper, we apply the technique of certificateless hybrid signcryption to an elliptic-curve cryptosystem, and construct a low-computation certificateless hybrid signcryption scheme. In the random oracle model, this scheme is proven to have indistinguishability against adaptive chosen-ciphertext attacks （IND-CCA2） under the elliptic-curve computation Diffie-Hellman assumption. Also, it has a strong existential unforgeability against adaptive chosen-message attacks （sUF-CMA） under the elliptic-curve discrete logarithm assumption. Analysis shows that the cryptographic algorithm does not rely on pairing operations and is much more etticient than other algorithms. In addition, it suits well to applications in environments where resources are constrained, such as wireless sensor networks and ad hoc networks.
