An efficient identification scheme in standard model based on the diophantine equation hard problem

QR Code

An efficient identification scheme in standard model based on the diophantine equation hard problem

Recently the Diophantine Equation Hard Problem (DEHP) was proposed. It is utilized to design a standard identification scheme model. Since the computation involves only simple addition and multiplication steps, the efficiency and the time cost are greatly improved as compared to the existing identif...

Full description

Bibliographic Details
Main Authors:	Tea, Boon Chian, Kamel Ariffin, Muhammad Rezal, Chin, Ji Jian
Format:	Article
Language:	English
Published:	Institute for Mathematical Research, Universiti Putra Malaysia 2013
Online Access:	http://psasir.upm.edu.my/id/eprint/30256/ http://psasir.upm.edu.my/id/eprint/30256/1/30256.pdf

Similar Items

Efficient identification scheme in standard model based on bivariate function hard problem
by: Tea, Boon Chian
Published: (2014)

An identification scheme based on bivariate function hard problem
by: Tea, Boon Chian, et al.
Published: (2014)

The diophantine equation hard problem (DEHP) as an asymmetric primitive - is it possible?
by: Kamel Ariffin, Muhammad Rezal
Published: (2013)

An efficient identification scheme based on Bivariate function hard problem
by: Boon, Chian Tea, et al.
Published: (2022)

On the Diophantine equation
by: Zahari, N. M., et al.
Published: (2012)

New simultaneous Diophantine attacks on generalized RSA key equations
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2024)

An efficient and provable secure identity-based identification scheme in the standard model
by: Ji-Jian, Chin, et al.
Published: (2008)

Identity-based encryption schemes - a review
by: Tea, Boon Chian, et al.
Published: (2019)

On the diophantine equation x² + 4.7ᵇ = y²ʳ
by: Yow, Kai Siong, et al.
Published: (2013)

On the integral solutions of the diophantine equation x4 + y4 = z3
by: Ismail, S., et al.
Published: (2013)

Bound on some Diophantine equation
by: Amalulhair, N. H., et al.
Published: (2022)

On the exponential diophantine equations of degree three
by: Amalul Hair, Nur Hidayah, et al.
Published: (2019)

On the diophantine equation Px + Qy = z²
by: Japar, Izzati Izyani, et al.
Published: (2024)

Gaussian integer solutions of the Diophantine equation x⁴ + y⁴ = z³ for x‰ y
by: Ismail, Shahrina, et al.
Published: (2023)

On the diophantine equation p ͯ +qᵐnᵞ = z²
by: Bakar, Halimatun Saadiah
Published: (2018)

Rank AGS identification scheme and signature scheme
by: Nagaraja, Vaishnavi, et al.
Published: (2023)

A new simultaneous diophantine attack upon RSA moduli N = pq
by: Abubakar, Saidu Isah, et al.
Published: (2018)

Study On Identity-Based Identification Schemes
by: Chin, Ji Jian
Published: (2008)

On The Diophantine Equation:Jesmanowicz Conjecture And Selected Special Cases
by: Ahmed Balfaqih, Abdulrahman Hamed
Published: (2020)

The development of deniable authentication protocol based on the bivariate function hard problem
by: Nek Abdul Rahman, Normahirah, et al.
Published: (2016)

The development of deniable authentication protocol based on the bivariate function hard problem
by: Nek Abd Rahman, Normahirah, et al.
Published: (2014)

On the diophantine equation x²+2ª .zb= y³n
by: Amalul Hair, Nur Hidayah
Published: (2020)

On The Solvability Of Some Diophantine Equations Of The Form ax+by = z2
by: Elshahed, Amr Moustafa Mohamed Aly Elsayed
Published: (2022)

A new efficient Rabin-like signature scheme
by: Mahad, Zahari, et al.
Published: (2016)

On the Diophantine Equation 5 x + p mn y = z 2
by: Bakar, H. S., et al.
Published: (2019)

On The Theory Of Diophantine Approximations.
by: Haili, Hailiza Kamarul, et al.
Published: (2005)

Efficient schemes on solving fractional integro-differential equations
by: Loh, Jian Rong
Published: (2018)

Solution of diophantine equation x⁴ + y⁴= pᵏz³ for primes 2 ≤ p ≤ 13.
by: Ismail, Shahrina
Published: (2011)

On the diophantine equation x^2 + 5^a 47^b = y^n
by: Jamal, N. S., et al.
Published: (2023)

Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis
by: Wan Mohd Ruzai, Wan Nur Aqlili, et al.
Published: (2022)

Cryptanalysis of the SHMW signature scheme
by: Lau, Terry Shue Chien, et al.
Published: (2024)

On the underlying hard lattice problems of GGH encryption scheme
by: Mandangan, Arif, et al.
Published: (2018)

Some solutions of diophantine equation x3+y3=pk z3
by: See, Kok Leong
Published: (2011)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014)

On The Theory Of Diophantine Approximations And Continued Fractions Expansion.
by: Haili, Hailiza Kamarul, et al.
Published: (2005)

Further results on the Diophantine equation x^2+16·7^b = y^n when n is even
by: Yow, Kai Siong, et al.
Published: (2024)

A new arbitrated signing scheme based on BFHP
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2015)

A new arbitrated signing scheme based on BFHP
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2014)

A new hybrid non-standard finite difference-adomian scheme for solution of nonlinear equations
by: Moaddy .K,, et al.
Published: (2011)