![](bg8.png)
existing MPKC based IBS in terms of master secret
key size, master public key size and user secret key
size with a trade-off in signature size. Moreover,
our scheme does not claim it security theoretically
or experimentally as opposed to most of the MPKC
schemes in the literature. Rather, it achieves EUF-
CMA security in the random oracle model under the
hardness of the IP problem which is known to be
harder than Graph Isomorphism problem. Extending
our work to achieve security in the standard model
and reducing the signature size while retaining simi-
lar key sizes is an interesting open problem and our
future direction of work.
REFERENCES
Alagic, G., Alperin-Sheriff, J., Apon, D., Cooper, D., Dang,
Q., Kelsey, J., Liu, Y.-K., Miller, C., Moody, D., Per-
alta, R., et al. (2020). Status report on the second
round of the nist post-quantum cryptography stan-
dardization process. US Department of Commerce,
NIST.
Barreto, P. S., Libert, B., McCullagh, N., and Quisquater,
J.-J. (2005). Efficient and provably-secure identity-
based signatures and signcryption from bilinear maps.
In International conference on the theory and appli-
cation of cryptology and information security, pages
515–532. Springer.
Chen, J., Ling, J., Ning, J., and Ding, J. (2019). Identity-
based signature schemes for multivariate public key
cryptosystems. The Computer Journal, 62(8):1132–
1147.
Choon, J. C. and Cheon, J. H. (2003). An identity-based
signature from gap diffie-hellman groups. In Inter-
national workshop on public key cryptography, pages
18–30. Springer.
Debiao, H., Jianhua, C., and Jin, H. (2011). An id-
based proxy signature schemes without bilinear pair-
ings. Annals of telecommunications-annales des
t
´
el
´
ecommunications, 66(11-12):657–662.
Ding, J. and Schmidt, D. (2005). Rainbow, a new mul-
tivariable polynomial signature scheme. In Interna-
tional Conference on Applied Cryptography and Net-
work Security, pages 164–175. Springer.
Ducas, L., Lyubashevsky, V., and Prest, T. (2014). Efficient
identity-based encryption over ntru lattices. In Inter-
national Conference on the Theory and Application
of Cryptology and Information Security, pages 22–41.
Springer.
Huang, Y.-J., Liu, F.-H., and Yang, B.-Y. (2012). Public-
key cryptography from new multivariate quadratic as-
sumptions. In International Workshop on Public Key
Cryptography, pages 190–205. Springer.
Hung, Y.-H., Tseng, Y.-M., and Huang, S.-S. (2017). Revo-
cable id-based signature with short size over lattices.
Security and Communication Networks, 2017.
Kipnis, A., Patarin, J., and Goubin, L. (1999). Unbalanced
oil and vinegar signature schemes. In International
Conference on the Theory and Applications of Cryp-
tographic Techniques, pages 206–222. Springer.
Kravitz, D. W. (1993). Digital signature algorithm. US
Patent 5,231,668.
Luyen, L. V. et al. (2019). An improved identity-based mul-
tivariate signature scheme based on rainbow. Cryptog-
raphy, 3(1):8.
Matsumoto, T. and Imai, H. (1988). Public quadratic
polynomial-tuples for efficient signature-verification
and message-encryption. In Workshop on the The-
ory and Application of of Cryptographic Techniques,
pages 419–453. Springer.
Patarin, J. (1996). Hidden fields equations (hfe) and iso-
morphisms of polynomials (ip): Two new families
of asymmetric algorithms. In International Confer-
ence on the Theory and Applications of Cryptographic
Techniques, pages 33–48. Springer.
Patarin, J. (1997). The oil and vinegar signature scheme.
In Dagstuhl Workshop on Cryptography September,
1997.
Paterson, K. G. and Schuldt, J. C. (2006). Efficient identity-
based signatures secure in the standard model. In Aus-
tralasian Conference on Information Security and Pri-
vacy, pages 207–222. Springer.
Rivest, R. L., Shamir, A., and Adleman, L. (1978). A
method for obtaining digital signatures and public-
key cryptosystems. Communications of the ACM,
21(2):120–126.
R
¨
uckert, M. (2010). Strongly unforgeable signatures
and hierarchical identity-based signatures from lat-
tices without random oracles. In International Work-
shop on Post-Quantum Cryptography, pages 182–200.
Springer.
Sakumoto, K., Shirai, T., and Hiwatari, H. (2011). On prov-
able security of uov and hfe signature schemes against
chosen-message attack. In International Workshop on
Post-Quantum Cryptography, pages 68–82. Springer.
Shamir, A. (1984). Identity-based cryptosystems and sig-
nature schemes. In Workshop on the theory and ap-
plication of cryptographic techniques, pages 47–53.
Springer.
Shen, W., Tang, S., and Xu, L. (2013). Ibuov, a prov-
ably secure identity-based uov signature scheme. In
2013 IEEE 16th International Conference on Com-
putational Science and Engineering, pages 388–395.
IEEE.
Shor, P. W. (1999). Polynomial-time algorithms for prime
factorization and discrete logarithms on a quantum
computer. SIAM review, 41(2):303–332.
Wang, Z., Chen, X., and Wang, P. (2017). Adaptive-id se-
cure identity-based signature scheme from lattices in
the standard model. IEEE Access, 5:20791–20799.
Xie, C., Weng, J., Weng, J., and Hou, L. (2020). Scalable
revocable identity-based signature over lattices in the
standard model. Information Sciences, 518:29–38.
Xinyin, X. (2015). Adaptive secure revocable identity-
based signature scheme over lattices. Computer En-
gineering, 10:25.
Yang, G., Tang, S., and Yang, L. (2011). A novel group sig-
nature scheme based on mpkc. In International Con-
ference on Information Security Practice and Experi-
ence, pages 181–195. Springer.
Zhang, Y., Hu, Y., Gan, Y., Yin, Y., and Jia, H. (2019). Ef-
ficient fuzzy identity-based signature from lattices for
identities in a small (or large) universe. Journal of
Information Security and Applications, 47:86–93.
SECRYPT 2021 - 18th International Conference on Security and Cryptography
602