Simple Search:

A new arbitrated signing scheme based on BFHP


Citation

Abd Ghafar, Amir Hamzah and Kamel Ariffin, Muhammad Rezal (2014) A new arbitrated signing scheme based on BFHP. In: 4th International Cryptology and Information Security Conference 2014 (CRYPTOLOGY2014), 24-26 June 2014, Putrajaya, Malaysia. (pp. 77-85).

Abstract / Synopsis

Digital signing is commonly used in any electronic authentication. It preserves data integrity while maintaining non-repudiation value for signer and verifier involved. As digital world strives towards paperless operation, a derivative of digital signing known as arbitrated digital signing fills the need to use a trusted third party (TTP) to monitor the signing and verification process. In this paper, a new arbitrated digital signing scheme based on Bivariate Function Hard Problem (BFHP) is discussed.


Download File

[img] PDF
Cryptology2014-2.pdf
Restricted to Repository staff only

Download (430kB)

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Keywords: Bivariate function hard problem; Digital signing scheme
Depositing User: Nabilah Mustapa
Date Deposited: 04 Mar 2019 07:54
Last Modified: 04 Mar 2019 07:54
URI: http://psasir.upm.edu.my/id/eprint/66481
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item