Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Sook-Chin Yip"'
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
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:
Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nur Raidah Salim, Sook-Chin Yip, Timothy Tzen Vun Yap
Publikováno v:
Axioms, Vol 12, Iss 3, p 304 (2023)
The Polynomial Reconstruction Problem (PRP) was introduced in 1999 as a new hard problem in post-quantum cryptography. Augot and Finiasz were the first to design a cryptographic system based on a univariate PRP, which was published at Eurocrypt 2003
Externí odkaz:
https://doaj.org/article/5deb407a58a04eaab4d1fea16d60461b
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
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 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
Autor:
Nurul Nur Hanisah Adenan, MUHAMMAD REZAL KAMEL ARIFFIN, Sook Chin Yip, Ji-Jian Chin, Vaishnavi Nagaraja, Timothy Tzen Vun Yap, Terry Shue Chien Lau
Publikováno v:
Mathematics
Volume 11
Issue 5
Pages: 1139
Volume 11
Issue 5
Pages: 1139
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::9758eba826f7f5faa15cd8a6de51b9a6
Publikováno v:
International Journal of Electrical Power & Energy Systems. 148:108984
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::260ca4310516cabba175e94d1338497f
https://doi.org/10.1016/j.ijepes.2023.108984
https://doi.org/10.1016/j.ijepes.2023.108984
Publikováno v:
Provable and Practical Security ISBN: 9783030904012
ProvSec
ProvSec
Tightening the security reduction of a cryptosystem involves reducing the advantage of an adversary breaking the cryptosystem to a security assumption as closely as possible. Tighter security on a cryptosystem shows a clearer picture of its security,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c658273112b55964334943115204f13a
https://doi.org/10.1007/978-3-030-90402-9_7
https://doi.org/10.1007/978-3-030-90402-9_7
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811680588
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2f8c1cd0b378f045ba1d655ac6697d2
https://doi.org/10.1007/978-981-16-8059-5_10
https://doi.org/10.1007/978-981-16-8059-5_10