Chand, Ravinesh and Valluri, Maheswara R. and Khan, Mohammad G.M. (2021) Digital signature scheme over lattices. [Conference Proceedings]
Full text not available from this repository.Abstract
With the rapid advancements in information technology, data security has become an indispensable component. Cryptography performs a significant role in establishing information security. Computational problems have been utilized extensively by cryptographers to construct digital signature schemes. Digital signature schemes offer security services such as confidentiality, authenticity, integrity, and non-repudiation of a message. This paper proposes a modification of the Dilithium signature scheme that is secure against unforgeability attack based on the hardness of lattice problems such as Learning With Errors and Short Integer Solution over lattices. Using the rejection sampling technique, data is sampled from a uniform distribution to generate keys that are expanded into a matrix. The keys are hashed and signed by the sender to generate a message, which is then accepted by the receiver upon verification. Finally, the security analysis for the proposed signature scheme is provided with a strong emphasis on the security of the secret key. We prove that the attacker cannot forge a signature on a message, and recommended parameters are proposed.
| Item Type: | Conference Proceedings |
|---|---|
| Additional Information: | DOI: 10.1109/CSCC53858.2021.00021 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > T Technology (General) |
| Divisions: | School of Information Technology, Engineering, Mathematics and Physics (STEMP) |
| Depositing User: | Ms Shalni Sanjana |
| Date Deposited: | 16 Jan 2022 22:50 |
| Last Modified: | 16 Jan 2022 22:50 |
| URI: | https://repository.usp.ac.fj/id/eprint/13191 |
Actions (login required)
 |
View Item |