A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials

Akleylek, Sedat; Soysaldi, Meryem

doi:10.3906/mat-1803-92

Cited by 9 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, we do not have numeric parameters for any security level. However, the comparison is provided by identification schemes based on multivariate quadratic or cubic polynomials presented in [19,21,23] with curve-based cryptoGPS [26]. In Table 2, for 80-bit security level, the comparison is given by considering security attacks against quantum attacks, impersonation probability and parameter set including secret key, challenge and response sizes.…”

Section: A Novel Methods For Polar Form Of Multivariate Polynomialsmentioning

confidence: 99%

“…In addition, all identification schemes based on multivariate polynomials were compared in view of memory requirements, communication length, and computation time. In [23], a new identification scheme based on multivariate quadratic polynomials was presented by using a different dividing technique of the secret key. Then, the proposed identification scheme was transformed to the signature scheme.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Method for Polar Form of Any Degree of Multivariate Polynomials with Applications in IoT

Akleylek

Soysaldi

Boubiche

et al. 2019

Sensors

Self Cite

View full text Add to dashboard Cite

Identification schemes based on multivariate polynomials have been receiving attraction in different areas due to the quantum secure property. Identification is one of the most important elements for the IoT to achieve communication between objects, gather and share information with each other. Thus, identification schemes which are post-quantum secure are significant for Internet-of-Things (IoT) devices. Various polar forms of multivariate quadratic and cubic polynomial systems have been proposed for these identification schemes. There is a need to define polar form for multivariate dth degree polynomials, where d ≥ 4 . In this paper, we propose a solution to this need by defining constructions for multivariate polynomials of degree d ≥ 4 . We give a generic framework to construct the identification scheme for IoT and RFID applications. In addition, we compare identification schemes and curve-based cryptoGPS which is currently used in RFID applications.

show abstract

Section: A Novel Methods For Polar Form Of Multivariate Polynomialsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Novel Method for Polar Form of Any Degree of Multivariate Polynomials with Applications in IoT

Akleylek

Soysaldi

Boubiche

et al. 2019

Sensors

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to be consistent with (27), we optimally choose v 1 ≤ 1.3 ⋅ o 2 . Plugging each m min = 34, 44, 68, 94 into (21), (22), and (23) and requires that they are larger than 2 100 , 2 128 , 2 192 and 2 256 , respectively, we optimally obtain log(q) = 5.…”

Section: Choice Of Subfield and Parametersmentioning

confidence: 99%

“…However, the soundness error of that 3-pass ID is 2/3, which is large and hence one needs to repeat the protocol many times to reach a desized security level, which results in a large signature. There have been several improvements in 3-pass ID such as [21,22] which reduce the soundness error to 1/2. However, the communication of the protocols is also increased, which make the resulting signature still large.…”

Section: Introductionmentioning

confidence: 99%

Choosing subfields for LUOV and lifting fields for rainbow

Duong

Luyen

Tran³

2020

IET Information Security

View full text Add to dashboard Cite

© The Institution of Engineering and Technology 2019 Multivariate public key cryptography is one of the main candidates for post-quantum cryptography. Rainbow, an improved (multi-layer) version of unbalanced oil and vinegar (UOV), is one of the most famous multivariate signature schemes that is a promising candidate for NIST standardisation. At INDOCRYPT 2017, Beullens and Preneel introduced a new variant LUOV of UOV. Their idea is to generate a UOV scheme over the binary field L = F2 and then lift it into a bigger field K = F2r and hence dramatically reduce the public key size. In this study, the authors first theoretically deduce the choice for the subfield L (which is different from F2) which results in smaller signature sizes (up to 40%). Moreover, they extend the idea to Rainbow and theoretically yield the optimal choice for the subfield L over which a Rainbow is generated before being lifted to K. As a result, they can reduce the public key size of the obtained Rainbow scheme up to at least 36%.

show abstract

“…MPKC has high computational efficiency and can realize strong secure communication on low-end devices. Signature and encryption schemes based on MPKC are widely studied [15]- [18]. At present, there is no certificateless broadcast multisignature scheme based on MPKC.…”

Section: Introductionmentioning

confidence: 99%

Certificateless Broadcast Multisignature Scheme Based on MPKC

Liu

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Broadcast multisignature allows multiple signers to sign the same message, which can be used in many areas, such as electronic contract signing, educational administration management system and grade management system. At present, the security of most broadcast multisignature schemes mainly depends on the intractability of large integer factoring (LIF) or discrete logarithm (DL) problem. Thus, broadcast multisignature schemes will suffer from the potential threat of the quantum computing attacks. Hence, it is an important problem how to solve the quantum computing attacks in traditional broadcast multisignature. In this paper, we construct the first certificateless broadcast multisignature scheme based on multivariate public key cryptosystem (MPKC-CLBMSS), whose security is based on the hardness of the isomorphism of polynomials (IP) problem. MPKC-CLBMSS not only solves the problem of quantum computing attacks, but also avoids the key escrow issue in IB-PKC along with the certificate management problem in traditional PKI. In MPKC-CLBMSS, the signature length is as same as that of the partial signature, regardless of the number of signers; the verification time of signature is as same as for a partial signature. MPKC-CLBMSS has higher computational efficiency than the existing broadcast multisignature scheme. Moreover, the security proof shows that MPKC-CLBMSS satisfies the unforgeability in the random oracle model. INDEX TERMSMultivariate public key cryptosystem, certificateless public key technique, broadcast multisignature, post-quantum cryptography.

show abstract

A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials

Cited by 9 publications

References 10 publications

A Novel Method for Polar Form of Any Degree of Multivariate Polynomials with Applications in IoT

A Novel Method for Polar Form of Any Degree of Multivariate Polynomials with Applications in IoT

Choosing subfields for LUOV and lifting fields for rainbow

Certificateless Broadcast Multisignature Scheme Based on MPKC

Contact Info

Product

Resources

About