Md Tanvir Arafin
ABSTRACT
In this era of Internet of Things (IoT), connectivity exists everywhere, among everything (including people) at all times. Therefore, security, trust, and privacy become crucial to the design and implementation of IoT devices [12]. However, it is challenging to build security into IoT devices because most of them are constrained by extremely limited resources such as the battery, memory, and computation power etc. Inspired by the concept of visual cryptography [4] that requires the least amount of computation and a recent work on pure hardware-based single-user authentication [6], we present a novel solution to the secret sharing and multi-user authentication problem. Our solution is built on the observation that non-volatile resistive memories display nice monotonic and additive properties during resistive state transitions. We demonstrate how to design a hardware dependent multi-user authentication protocol using resistive random access memory (RRAM)-based hardware and provide the necessary circuits for the application. Finally, we simulate the proposed circuit to understand the nature of the operation and practical problems that these designs encounter during operation.
- Shamir, Adi. "How to share a secret." Communications of the ACM 22.11 (1979): 612--613. Google Scholar
Digital Library
- Blakley, George Robert. "Safeguarding cryptographic keys." AFIPS. IEEE, 1979.Google Scholar
- Stinson, Douglas R. "An explication of secret sharing schemes." Designs, Codes and Cryptography 2.4 (1992): 357--390. Google ScholarDigital Library
- Naor, Moni, et al. "Visual cryptography." Advances in Cryptology-EUROCRYPT'94. Springer Berlin/Heidelberg, 1995.Google Scholar
- Arafin, M. T., et al. "A survey on memristor modeling and security applications." Quality Electronic Design (ISQED), 2015 16th International Symposium on. IEEE, 2015.Google Scholar
- Arafin, Md Tanvir, and Gang Qu. "RRAM based lightweight user authentication." Computer-Aided Design (ICCAD), 2015 IEEE/ACM International Conference on. IEEE, 2015. Google ScholarDigital Library
- Verheul, Eric R., and Henk CA Van Tilborg. "Constructions and properties of k out of n visual secret sharing schemes." Designs, Codes and Cryptography 11.2 (1997): 179--196. Google ScholarDigital Library
- Predictive technology model (PTM), http://ptm.asu.edu/Google Scholar
- Guan, Ximeng, et al. "A SPICE compact model of metal oxide resistive switching memory with variations." IEEE electron device letters 33.10 (2012): 1405--1407.Google Scholar
- Wong, H-S. Philip, et al. "Metal-oxide RRAM." Proceedings of the IEEE 100.6 (2012): 1951--1970.Google ScholarCross Ref
- Naor, Moni, and Benny Pinkas. "Visual authentication and identification." Advances in Cryptology-CRYPTO'97. Springer Berlin Heidelberg, 1997. 322--336. Google ScholarDigital Library
- Qu, Gang, and Lin Yuan. "Design THINGS for the Internet of Things-An EDA perspective." Computer-Aided Design (ICCAD), 2014 IEEE/ACM International Conference on. IEEE, 2014. Google ScholarDigital Library
- "Two-person integrity" available online at http://informationtechniciantraining.tpub.com/14222/css/14222_85.htm, pp. 3--9 & 3--10Google Scholar
- "How the NSA is preventing another Snowden (and why you should do the same) ", Computer World, Jan. 7, 2014. Available online at http://www.computerworld.com/article/2474270/cybercrime-hacking/how-the-nsa-is-preventing-another-snowden-and-why-you-should-do-the-same-.htmlGoogle Scholar
Index Terms
- Secret Sharing and Multi-user Authentication: From Visual Cryptography to RRAM Circuits
Recommendations
Cryptanalysis on a Secret-Sharing Based Conditional Proxy Re-Encryption Scheme
Condition proxy re-encryption is a promising security primitive for pervasive data sharing in such settings as cloud-based social networks and collaborations. However, it is challenging to create a secure condition proxy re-encryption scheme that is ...
Paillier-based publicly verifiable (non-interactive) secret sharing
A verifiable secret sharing is a secret sharing scheme with an untrusted dealer that allows participants to verify validity of their own shares. A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme that allows a third ...
Public Verifiability from Pairings in Secret Sharing Schemes
Selected Areas in CryptographyIn this paper we propose a new publicly verifiable secret sharing scheme using pairings with close relations to Shoenmakers' scheme. This scheme is efficient, multiplicatively homomorphic and with unconditional verifiability in the standard model. We ...
Comments