His primary scientific interests are in Cryptography, Public-key cryptography, Computer security, Digital signature and Theoretical computer science. His Cryptography study incorporates themes from Key, Discrete logarithm, Key size and Key encapsulation. His Public-key cryptography research is multidisciplinary, incorporating elements of Challenge-Handshake Authentication Protocol, Signature and Arithmetic.
His Computer security study frequently links to adjacent areas such as Verifiable secret sharing. The various areas that he examines in his Digital signature study include Cryptographic hash function and Computer network, Authentication. His Theoretical computer science research includes themes of Discrete mathematics, Finite field, XTR, Encryption and Key distribution.
Lein Harn spends much of his time researching Computer security, Cryptography, Secret sharing, Computer network and Theoretical computer science. His Cryptography study integrates concerns from other disciplines, such as Signature and Discrete logarithm, Encryption, Public-key cryptography. His biological study deals with issues like Digital signature, which deal with fields such as Algorithm.
His Secret sharing study combines topics from a wide range of disciplines, such as Secure multi-party computation, Verifiable secret sharing, Group key and Key distribution. The concepts of his Computer network study are interwoven with issues in Key distribution in wireless sensor networks, Key and Distributed computing. His studies in Theoretical computer science integrate themes in fields like Polynomial and Group.
Lein Harn mainly investigates Computer network, Cryptography, Secret sharing, Group key and Theoretical computer science. His Computer network research includes elements of Key distribution in wireless sensor networks, Key establishment and Key. The Cryptography study combines topics in areas such as Field-programmable gate array, Arbiter, Scalability and Authentication.
His Secret sharing research entails a greater understanding of Computer security. His Theoretical computer science study combines topics in areas such as Bivariate polynomials, Verifiable secret sharing, Group and Communications system. Lein Harn works mostly in the field of Node, limiting it down to topics relating to Homomorphic encryption and, in certain cases, Public-key cryptography.
His main research concerns Computer security, Information security, Secret sharing, Computer network and Key distribution. Lein Harn has researched Computer security in several fields, including Certificate, Bounded function and Formal proof. His work carried out in the field of Information security brings together such families of science as Ontology, Cryptographic protocol, Secrecy, Robustness and Big data.
His Computer network research is multidisciplinary, relying on both Probabilistic logic and Polynomial. The Wireless sensor network study combines topics in areas such as Key management, Overhead, Secure communication and Routing protocol. His study in Group key is interdisciplinary in nature, drawing from both Trusted third party, Communication in small groups, Server and Channel.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Group-oriented (t, n) threshold digital signature scheme and digital multisignature
L. Harn.
IEE Proceedings - Computers and Digital Techniques (1994)
Location-aware key management scheme for wireless sensor networks
Dijiang Huang;Manish Mehta;Deep Medhi;Lein Harn.
security of ad hoc and sensor networks (2004)
Refereed article: A cryptographic key generation scheme for multilevel data security
Lein Harn;Hung-Yu Lin.
Computers & Security (1990)
Efficient sharing (broadcasting) of multiple secrets
L. Harn.
IEE Proceedings - Computers and Digital Techniques (1995)
New digital signature scheme based on discrete logarithm
L. Harn.
Electronics Letters (1994)
Design of generalised ElGamal type digital signature schemes based on discrete logarithm
L. Harn;Y. Xu.
Electronics Letters (1994)
Public-key cryptosystems based on cubic finite field extensions
Guang Gong;Lein Harn.
IEEE Transactions on Information Theory (1999)
Public-key cryptosystem design based on factoring and discrete logarithms
L. Harn.
IEE Proceedings - Computers and Digital Techniques (1994)
Group Authentication
L. Harn.
IEEE Transactions on Computers (2013)
Strong (n,t,n) verifiable secret sharing scheme
Lein Harn;Changlu Lin.
Information Sciences (2010)
If you think any of the details on this page are incorrect, let us know.
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:
Feng Chia University
National Dong Hwa University
Arizona State University
University of Waterloo
Fujian Normal University
Chuo University
National Cheng Kung University
University of Wollongong
University of Nebraska–Lincoln
Khalifa University
Grenoble Alpes University
University of Florence
University of California, San Diego
Tianjin University
University of Bristol
Jaume I University
Woods Hole Research Center
Oslo University Hospital
University of Copenhagen
University of Bologna
INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement
University of Pavia
National Institutes of Health
Hofstra University
University of Milan
Indiana University