TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

A stateless blockchain-based public key infrastructure

* ,

* Corresponding author · click or hover a name for details

pp. 849–867Vol. 28Issue 3April 2025DOI: 10.47974/JDMSC-2136 Crossmark XML
Received:
12 Dec 2023
Published Online:
26 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2136
Pages:
849–867

Abstract

Various designs exist for a Public Key Infrastructure (PKI), each with its own inherent security and optimization issues. Certain properties of the Bitcoin blockchain and its derivatives - mainly the safeguards against the manipulation of data once it is stored - solved many of the PKI issues, and various designs for a blockchain-based PKI were proposed. Such blockchain-based PKIs required enormous amounts of storage space as the number of blocks and the number of users increased and thus became less efficient in performing operations such as inclusion, key retrieval, key verification, etc. In this article, we propose a new approach to the blockchain-based PKI, which while being as tamper-proof as the current blockchain-based PKIs, is very efficient in its space requirements and the time taken for key verification.

Keywords

Subject Classifications

11T7114G5094A60

References

[1] M. Myers, R. Ankney, A. Malpani, S. Galperin, and C. M. Adams, “X.509 internet public key infrastructure online certificate status protocol—OCSP,” RFC 2560, pp. 1–23 (1999). [Online]. Available: https://doi.org/https://api.semanticscholar.org/CorpusID:27218601.
[2] C. Fromknecht, D. Velicanu, and S. Yakoubov, “A decentralized public key infrastructure with identity retention,” IACR Cryptol. ePrint Arch., vol. 2014, p. 803 (2014).
[3] A. Yakubov, W. M. Shbair, A. Wallbom, D. Sanda, and R. State, “A blockchain-based PKI management framework,” in Proc. NOMS 2018 – 2018 IEEE/IFIP Network Operations and Management Symposium, pp. 1–6 (2018). [Online]. Available: https://doi.org/10.1109/NOMS.2018.8406325.
[4] L. Axon and M. Goldsmith, “PB-PKI: A privacy-aware blockchain-based PKI,” in Proc. International Conf. Security and Cryptography, pp. 311–318 (2017). [Online]. Available: https://doi.org/10.5220/0006419203110318. [Accessed: Jan. 14, 2025].
[5] S. Nakamoto, “Bitcoin: A peer-to-peer electronic cash system,” [Online]. Available: http://bitcoin.org/bitcoin.pdf. [Accessed: Jan. 14, 2025].
[6] A. J. Joseph Antony and K. Singh, “A blockchain-based public key infrastructure for IoT-based healthcare systems,” The Computer Journal, vol. 79 (2023). [Online]. Available: https://arxiv.org/abs/https://academic.oup.com/comjnl/advance-article-pdf/doi/10.1093/comjnl/bxad079/51023752/bxad079.pdf. [Accessed: Jan. 14, 2025].
[7] A. J. Antony and K. Singh, “Enhancing privacy in a blockchain-based public key infrastructure,” in Proc. 2020 Third ISEA Conf. Security and Privacy (ISEA-ISAP), pp. 87–93 (2020). [Online]. Available: https://doi.org/10.1109/ISEA-ISAP49340.2020.235005. [Accessed: Jan. 14, 2025].
[8] Y. C. Elloh Adja, B. Hammi, A. Serhrouchni, and S. Zeadally, “A blockchain-based certificate revocation management and status verification system,” Computers & Security, vol. 104, p. 102209 (2021). [Online]. Available: https://doi.org/10.1016/j.cose.2021.102209. [Accessed: Jan. 14, 2025].
[9] Z. Zhai, S. Shen, and Y. Mao, “BPKI: A secure and scalable blockchain-based public key infrastructure system for web services,” Journal of Information Security and Applications, vol. 68, p. 103226 (2022). [Online]. Available: https://doi.org/10.1016/j.jisa.2022.103226. [Accessed: Jan. 14, 2025].
[10] A. Panigrahi, A. K. Nayak, and R. Paul, “Smart contract assisted blockchain-based public key infrastructure system,” Trans. Emerging Telecommunication Technologies, vol. 34, no. 1, p. 4655 (2023). [Online]. Available: https://doi.org/10.1002/ett.4655. [Accessed: Jan. 14, 2025].
[11] D. Boneh, B. Bünz, and B. Fisch, “Batching techniques for accumulators with applications to IOPS and stateless blockchains,” LNCS, vol. 11692, pp. 561–586 (2019). [Online]. Available: https://doi.org/10.1007/978-3-030-26948-7_20.
[12] A. Panwar and V. Bhatnagar, “Analyzing the performance of data processing in private blockchain-based distributed ledger,” Journal of Information and Optimization Sciences, vol. 41, pp. 1–12 (2020). [Online]. Available: https://doi.org/10.1080/02522667.2020.1809095.
[13] S. J. M. Muhammed Miah and S. Venkatraman, “Blockchain: At a glance idea for information science researchers,” Journal of Information and Optimization Sciences, vol. 42, no. 7, pp. 1589–1624 (2021). [Online]. Available: https://doi.org/10.1080/02522667.2021.1930644.
[14] S. Goldwasser, S. Micali, and R. L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM J. Comput., vol. 17, no. 2, pp. 281–308 (1988). [Online]. Available: https://doi.org/10.1137/0217017.
[15] M. Bellare and C. Namprempre, “Authenticated encryption: Relations among notions and analysis of the generic composition paradigm,” Cryptology ePrint Archive, Paper 2000/025 (2000). [Online]. Available: https://eprint.iacr.org/2000/025.
[16] J. C. Benaloh and M. de Mare, “One-way accumulators: A decentralized alternative to digital signatures (extended abstract),” in Advances in Cryptology - EUROCRYPT ’93, Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, May 23–27, pp. 274–285 (1993). [Online]. Available: https://doi.org/10.1007/3-540-48285-7_24.
[17] J. Camenisch and A. Lysyanskaya, “Dynamic accumulators and application to efficient revocation of anonymous credentials,” in Advances in Cryptology—CRYPTO 2002, M. Yung, Ed., Berlin, Germany: Springer, pp. 61–76 (2002).
[18] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, Boca Raton, FL, USA: CRC Press (1996). [Online]. Available: http://cacr.math.uwaterloo.ca/hac.
[19] F. Baldimtsi, J. Camenisch, M. Dubovitskaya, A. Lysyanskaya, L. Reyzin, K. Samelin, and S. Yakoubov, “Accumulators with applications to anonymity-preserving revocation,” Cryptology ePrint Archive, Paper 2017/043 (2017). [Online]. Available: https://eprint.iacr.org/2017/043.
[20] H. Lipmaa, “Secure accumulators from Euclidean rings without trusted setup,” in Applied Cryptography and Network Security, F. Bao, P. Samarati, and J. Zhou, Eds., Berlin, Germany: Springer, pp. 224–240 (2012).
[21] P. Todd, “Making UTXO set growth irrelevant with low-latency delayed TXO commitments,” [Online]. Available: https://petertodd.org/2016/delayed-txo-commitments. [Accessed: Jan. 14, 2025].
[22] I. Damgård and M. Koprowski, “Generic lower bounds for root extraction and signature schemes in general groups,” in Advances in Cryptology — EUROCRYPT 2002, L. R. Knudsen, Ed., Berlin, Germany: Springer, pp. 256–271 (2002).
[23] B. Wesolowski, “Efficient verifiable delay functions,” Cryptology ePrint Archive, Paper 2018/623 (2018). [Online]. Available: https://eprint.iacr.org/2018/623. [Accessed: Jan. 14, 2025].
[24] R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” Cryptology ePrint Archive, Report 1999/001 (1999). [Online]. Available: https://ia.cr/1999/001. [Accessed: Jan. 14, 2025].
[25] P.-A. Fouque and M. Tibouchi, “Close to uniform prime number generation with fewer random bits,” in Automata, Languages, and Programming, J. Esparza, P. Fraigniaud, T. Husfeldt, and E. Koutsoupias, Eds., Berlin, Germany: Springer, pp. 991–1002 (2014).
[26] N. Koblitz, “Elliptic curve cryptosystems,” Math. Comp., vol. 48, pp. 243–264 (1987). [Online]. Available: https://doi.org/10.1090/S0025-5718-1987-0866109-5.
[27] J. Groth, “Linear algebra with sub-linear zero-knowledge arguments,” in Advances in Cryptology - C, S. Halevi, Ed., Berlin, Germany: Springer, pp. 192–208 (2009).

Views: 200Downloads: 86Citations: 0