| Title | Digital Signature Scheme over Lattices |
| Publication Type | Conference Paper |
| Year of Publication | 2021 |
| Authors | Chand, Ravinesh, Valluri, Maheswara Rao, Khan, MGM |
| Conference Name | 2021 25th International Conference on Circuits, Systems, Communications and Computers (CSCC) |
| Keywords | composability, Computers, cryptography, digital signature, Forgery, Human Behavior, Information security, information technology, key generation, Lattices, Metrics, pubcrawl, Receivers, Repudiation, Resiliency, Signing, verification |
| 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. |
| DOI | 10.1109/CSCC53858.2021.00021 |
| Citation Key | chand_digital_2021 |
Digital Signature Scheme over Lattices