World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
40
Citations
7072
World Ranking
9283
National Ranking
3950

Overview

Lein Harn is affiliated with the University of Missouri-Kansas City in the United States. Their research primarily spans the field of Computer Science, with significant contributions in several subfields including Artificial Intelligence, Computer Networks and Communications, Information Systems, Computer Vision and Pattern Recognition, and Electrical and Electronic Engineering.

The scientist's work covers a broad range of topics, notably:

  • Cryptography and Data Security
  • Security in Wireless Sensor Networks
  • Advanced Authentication Protocols Security
  • User Authentication and Security Systems
  • Chaos-based Image/Signal Encryption
  • Physical Unclonable Functions (PUFs) and Hardware Security
  • Privacy-Preserving Technologies in Data

Lein Harn has published extensively, with notable papers including:

  • "A Highly Reliable Arbiter PUF With Improved Uniqueness in FPGA Implementation Using Bit-Self-Test," 2020, IEEE Access
  • "Three-Factor Anonymous Authentication and Key Agreement Based on Fuzzy Biological Extraction for Industrial Internet of Things," 2023, IEEE Transactions on Services Computing
  • "PRLAP-IoD: A PUF-based Robust and Lightweight Authentication Protocol for Internet of Drones," 2023, Computer Networks
  • "Secret sharing with secure secret reconstruction," 2020, Information Sciences
  • "Lightweight Aggregated Data Encryption for Wireless Sensor Networks (WSNs)," 2021, IEEE Sensors Letters

Frequently, Lein Harn collaborates with several colleagues, including:

  • Ching-Fang Hsu
  • Zhe Xia
  • Zhuo Zhao
  • Jianqun Cui
  • Man Ho Au

The scientist publishes in journals and venues such as:

  • IEEE Access
  • IET Communications
  • The Computer Journal
  • Security and Communication Networks
  • Information Sciences

Best Publications

  • Group-oriented (t, n) threshold digital signature scheme and digital multisignature

    L. Harn

  • Location-aware key management scheme for wireless sensor networks

    Dijiang Huang;Manish Mehta;Deep Medhi;Lein Harn

  • Refereed article: A cryptographic key generation scheme for multilevel data security

    Lein Harn;Hung-Yu Lin

  • Efficient sharing (broadcasting) of multiple secrets

    L. Harn

  • New digital signature scheme based on discrete logarithm

    L. Harn

  • Design of generalised ElGamal type digital signature schemes based on discrete logarithm

    L. Harn;Y. Xu

  • Group Authentication

    L. Harn

  • Public-key cryptosystem design based on factoring and discrete logarithms

    L. Harn

  • Public-key cryptosystems based on cubic finite field extensions

    Guang Gong;Lein Harn

  • Strong (n,t,n) verifiable secret sharing scheme

    Lein Harn;Changlu Lin

  • Comment: Multistage secret sharing based on one-way function

    L. Harn

  • New scheme for digital multisignatures

    L. Harn;T. Kresler

  • Detection and identification of cheaters in (t, n) secret sharing scheme

    Lein Harn;Changlu Lin

  • Generalized Digital Certificate for User Authentication and Key Establishment for Secure Communications

    L. Harn;Jian Ren

  • Batch verifying multiple RSA digital signatures

    L. Harn

  • Steganography and authentication in image sharing without parity bits

    Ching-Nung Yang;Jin-Fwu Ouyang;Lein Harn

  • Authenticated key agreement without using one-way hash functions

    L. Harn;H.-Y. Lin

  • Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space

    Chi-Sung Laih;Lein Harn;Jau-Yien Lee;Tzonelih Hwang

  • Cryptanalysis of the blind signatures based on the discrete logarithm problem

    L. Harn

  • Authentication protocols for personal communication systems

    Hung-Yu Lin;Lein Harn

Frequent Co-Authors

Chin-Chen Chang
Chin-Chen Chang Feng Chia University
Ching-Nung Yang
Ching-Nung Yang National Dong Hwa University
Guang Gong
Guang Gong University of Waterloo
Dijiang Huang
Dijiang Huang Arizona State University
Deep Medhi
Deep Medhi National Science Foundation
Yi Mu
Yi Mu Fujian Normal University
Willy Susilo
Willy Susilo University of Wollongong
Hideki Imai
Hideki Imai Chuo University
Marc J. Schniederjans
Marc J. Schniederjans University of Nebraska–Lincoln
Weizhi Meng
Weizhi Meng Lancaster University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring career options in computer science opens up several flexible pathways. Many students are drawn to easy online degrees that pay well, which can be completed faster than traditional programs and lead to lucrative careers in tech fields.

With the rapid growth of artificial intelligence, earning an ai degree online is becoming increasingly popular. These programs allow you to build sought-after skills without the need to relocate, offering both affordability and flexibility.

Choosing the right major is another key step in aligning your studies with your career goals. Review the best options by browsing the list of majors that offer strong job prospects and industry relevance in today’s market.

If you’re considering postgraduate education, there are several paths that balance value, workload, and opportunity. You can discover the easiest master degree to get online, if you want to upskill efficiently and advance your career quickly.

Best Scientists Citing Lein Harn

Trending Scientists