Loading...
Please wait, while we are loading the content...
Similar Documents
Node authentication in networks using zero-knowledge proofs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Norville, Richard S. Namuduri, Kameswara Rao Pendse, Ravi |
| Copyright Year | 2007 |
| Abstract | Zero-knowledge proof (ZKP) based authentication protocols provide a smart way to prove an identity of a node without giving away any information about the secret of that identity. There are many advantages as well as disadvantages to using this protocol over other authentication schemes, and challenges to overcome in order to make it practical for general use. This chapter examines the viability of ZKPs for use in authentication protocols in networks. It is concluded that nodes in a network can achieve a desired level of security by trading off key size, interactivity, and other parameters of the authentication protocol. This chapter also provides data analysis that can be useful in determining expected authentication times based on device capabilities. Pseudocode is provided for implementing a graph-based ZKP on small or limited processing devices. IGI PUBLISHING This paper appears in the publication, Web Services Security and E-Business edited by G. Radhaman & G. S. V. Radha Krishna Rao © 2007, IGI Global 701 E. Chocolate Avenue, Suite 200, Hershey PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.igi-pub.com ITB14878 |
| Starting Page | 142 |
| Ending Page | 164 |
| Page Count | 23 |
| File Format | PDF HTM / HTML |
| DOI | 10.4018/978-1-59904-168-1.ch008 |
| Alternate Webpage(s) | http://www.irma-international.org/viewtitle/31225/ |
| Alternate Webpage(s) | https://doi.org/10.4018/978-1-59904-168-1.ch008 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |