Search Results

Now showing 1 - 4 of 4

Some of the metrics are blocked by your
consent settings
Blockchain-based Learning Credential Revision and Revocation Method
(2020-10-07)
San, Aye Mi
;
Chotikakamthorn, Nopporn
;
Sathitwiriyawong, Chanboon
Many blockchain-based learning credential systems have been proposed to reduce fraud and improve verification efficiency. In addition to a method for issuing and verifying credentials, a solution is needed to support the revision and revocation of an issued credential record. For the case of learning credentials, depending on how a revocation policy affects credential use that occurred before the revocation date, an additional mechanism may be needed for credential revision. Current digital learning credential methods offer only a revocation mechanism. So they do not fully meet such unique requirement in the education context. In this paper, a blockchain-based method for learning credential revision and revocation is proposed. It makes use of the revision and revocation addresses assigned to each batch of issuing credentials. To revise (revoke) one or more credentials, the proposed method stores the revision (revocation) list as a message in the OP_RETURN field of the revision (revocation) transaction, with the revision (revocation) address as one of its outputs. The concept of a local credential id has been introduced to allow a revision (revocation) list to be efficiently stored on a blockchain system. It is based entirely on a blockchain system and does not require any centralized authority. It is also applicable to most blockchain systems. A comparative study of the proposed method against existing credential revocation methods is also provided.
Some of the metrics are blocked by your
consent settings
Blockchain-based Learning Credential Verification System with Recipient Privacy Control
(2019-12-01)
San, Aye Mi
;
Chotikakamthorn, Nopporn
;
Sathitwiriyawong, Chanboon
Various forms of learning credentials play an important role in society. For example, a degree certificate is usually required to apply for many jobs. Currently, paper-based learning credentials such as diploma or degree certificates are still widely used. However, proof of such credentials' authenticity has become increasingly more difficult in recently years due to availability of low-cost desktop publishing tools. Recently, a blockchain-based digital certificate issuing and verification system has been proposed to address these problems. However, existing blockchain-based certification verification solutions have a few shortcomings in common. One of them is the lack of mechanism to control the amount of information and anonymity exposed during the verification process. This paper proposed a blockchain-based learning credential verification system, where a} {credential recipient can control the amount of credential-related information to be exposed during the verification process. The proposed solution makes use of a Merkle tree to encode causal relationship among pieces of information the credential is composed of. The abstract data model built on top of the binary Merkle tree has been proposed so that a recipient can choose to disclose part of the credential information, including the recipient profile. This means it is possible for credential verification to be performed anonymously. This can be achieved without increasing blockchain transaction cost and complexity. Example of use case scenarios that require such anonymous verification are described.
Some of the metrics are blocked by your
consent settings
Privacy-Preserving offline mobile payment protocol based on NFC
(2017-02-21)
San, Aye Mi
;
Sathitwiriyawong, Chanboon
Nowadays, more and more people use mobile phones as payment devices. Mobile payments are making the way of life more convenient. However, when they decide to use mobile phones for payment, their privacy concerns can outweigh benefits. This paper proposes a new privacy-preserving offline mobile payment protocol based on NFC. In our scheme, a group signature is employed to provide unlinkability of transactions. Compared with ACJT group signature scheme, our scheme is more secure and efficient. Since there are fewer computations at the payment phase, the efficiency of the group signature is improved. Moreover, ACJT scheme is not secure enough. In ACJT scheme, the forgery group signature can be verified by the verifier but the group manager cannot open the group signature to know who signs the message. Our scheme is well designed to accomplish all security and privacy requirements encompassing anonymity, unlinkability, unforgeability, and the prevention of replay attacks.
Some of the metrics are blocked by your
consent settings
Efficient offline micropayment protocol for multi-vendor
(2017-02-21)
San, Aye Mi
;
Sathitwiriyawong, Chanboon
With the rapid development of e-commerce, online services have become a usual part of our lives, such as online gaming, music or software downloads, pay-per-view content, and membership fees. But the amount of money spent for these services often is only a few multiple of the smallest currency unit. These kinds of payments are called micropayment. Therefore, in the field of electronic payment, micropayment is one of the most popular researches. The earliest and still most popular micropayment scheme is PayWord. But in the meanwhile, some problems still exist in the PayWord protocol, such as security, fairness, anonymity, and customer credibility. Moreover, PayWord is designed for a single vendor and is not efficient for multi-vendor purchasing. In this paper, an efficient offline micropayment scheme for multi-vendor is proposed. Compared with other micropayment schemes, our scheme not only improves its efficiency since no public key operations are needed, but also provides security, fairness, anonymity, and multi-vendor support.

KMITL

Browse

Filters

Settings

Sort By

Results per page

Search Results