You are looking at a specific version 20200430:124217 of this paper. See the latest version.

Paper 2019/1232

Efficient Construction of Nominative Signature Secure under Symmetric Key Primitives and Standard Assumptions on Lattice

Meenakshi Kansal and Ratna Dutta and Sourav Mukhopadhyay

Abstract

Nominative signature is a cryptographic primitive where two parties collude to produce a signature. It is a user certification system and has applications in variety of sectors where nominee cannot trust heavily on the nominator to validate nominee’s certificate and only targeted entities are allowed to verify signature on sensitive data. We provide a new construction for nominative signature from standard assumptions on lattice. Our construction relies on collision resistant preimage sampleable function and symmetric key primitives like collision resistant pseudorandom function and zero knowledge proof system ZKB++ for Boolean circuits. We provide a detailed security analysis and show that our construction achieves security under unforgeability, invisibility, impersonation and non-repudiation in existing model. Furthermore, our construction exhibits non-transferability. The security under non-repudiation is achieved in the quantum random oracle model using Unruh transform to ZKB++.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Nominative signatureUser certification systemZero knowledge proofUnruh transform.
Contact author(s)
kansal @ maths iitkgp ernet in
ratna @ maths iitkgp ernet in
sourav @ maths iitkgp ernet in
History
2020-04-30: revised
2019-10-21: received
See all versions
Short URL
https://ia.cr/2019/1232
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.