Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Ji-Jian Chin"'
Autor:
Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Sook-Chin Yip, Terry Shue Chien Lau, Zahari Mahad, Ji-Jian Chin, Choo-Yee Ting
Publikováno v:
Heliyon, Vol 10, Iss 4, Pp e25470- (2024)
In 1999, the Polynomial Reconstruction Problem (PRP) was put forward as a new hard mathematics problem. A univariate PRP scheme by Augot and Finiasz was introduced at Eurocrypt in 2003, and this cryptosystem was fully cryptanalyzed in 2004. In 2013,
Externí odkaz:
https://doaj.org/article/23b139b89183424daf571094d07fe185
Publikováno v:
PLoS ONE, Vol 19, Iss 6, p e0302659 (2024)
Although e-voting scheme and e-cheque scheme are two different applications, they have similarities in the scheme definitions and security properties. This inspires us to establish a relationship between the two schemes by formalising a generic trans
Externí odkaz:
https://doaj.org/article/224f40ea7f88454fb2335289aff8368c
Autor:
Terry Shue Chien Lau, Muhammad Rezal Kamel Ariffin, Sook-Chin Yip, Ji-Jian Chin, Choo-Yee Ting
Publikováno v:
Heliyon, Vol 10, Iss 2, Pp e24185- (2024)
In recent research, Durandal, a signature scheme based on rank metrics following Schnorr's approach, was introduced to conceal secret key information by selectively manipulating the vector subspace of signatures. Later, an enhancement, namely the SHM
Externí odkaz:
https://doaj.org/article/65b21a6b8f4946629b44e8509afe622a
Autor:
Vaishnavi Nagaraja, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nurul Nur Hanisah Adenan, Ji-Jian Chin, Sook-Chin Yip, Timothy Tzen Vun Yap
Publikováno v:
Mathematics, Vol 11, Iss 5, p 1139 (2023)
The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity to another party (the verifier) without revealing the secret key to the verifier. One can apply the Fiat–Shamir transformation to conv
Externí odkaz:
https://doaj.org/article/f017742270784ba48a1614fea5d86bf1
Autor:
Jason Chia, Ji-Jian Chin
Publikováno v:
IEEE Access, Vol 8, Pp 61711-61725 (2020)
Identification schemes are used by machines to securely authenticate the identity of other machines or their users over computer networks. As conventional public key schemes require a trusted third party (TTP) or a public file to ensure the correspon
Externí odkaz:
https://doaj.org/article/2dc35678cef544b8944644532499d913
Publikováno v:
F1000Research, Vol 10 (2021)
Digital signature schemes (DSS) are ubiquitously used for public authentication in the infrastructure of the internet, in addition to their use as a cryptographic tool to construct even more sophisticated schemes such as those that are identity-based
Externí odkaz:
https://doaj.org/article/70cccab4244a49fba4ac61097bd32068
Publikováno v:
Symmetry, Vol 14, Iss 5, p 858 (2022)
A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting, and hybrid e-voting have been proposed in the literature for better security a
Externí odkaz:
https://doaj.org/article/6d0fe40e794a4fcfa06addc4ad77d361
Publikováno v:
Symmetry, Vol 13, Iss 9, p 1640 (2021)
Public Key Infrastructure (PKI) is the fundamental of secure digital communications. It provides a secure means to authenticate identities over the Internet. Symmetric or asymmetric encryption schemes are widely used in identity authentication in any
Externí odkaz:
https://doaj.org/article/445254f3615645d6a9f2b74355420295
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1535 (2021)
Public key infrastructure (PKI) plays a fundamental role in securing the infrastructure of the Internet through the certification of public keys used in asymmetric encryption. It is an industry standard used by both public and private entities that c
Externí odkaz:
https://doaj.org/article/70993770d4154168a9a2f81d85f3d956
Publikováno v:
Symmetry, Vol 13, Iss 8, p 1330 (2021)
The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction i
Externí odkaz:
https://doaj.org/article/6c841015f6df4681bf4f0bc4540e78b5