Security without identification: transaction systems to make big brother obsolete
Communications of the ACM
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Security reconsideration of the Huang-Wang nominative signature
Information Sciences: an International Journal
An efficient one-move Nominative Signature scheme
International Journal of Applied Cryptography
Provably Secure Convertible Nominative Signature Scheme
Information Security and Cryptology
Nominative signature from ring signature
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Formal definition and construction of nominative signature
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Universal designated verifier signature proof (or how to efficiently prove knowledge of a signature)
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On the security of nominative signatures
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
One-Move convertible nominative signature in the standard model
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |
While standard signatures provide an efficient mechanism for information certification, the lack of privacy protecting measures makes them unsuitable if sensitive or confidential information is being certified. In this paper, we revisit nominative signatures, first introduced by Kim, Park and Won, which provides the functionality and security guarantees required to implement a certification system allowing the user (and not the authority) to control the verifiability of an obtained certificate. Unlike systems based on related primitives, the use of nominative signatures protects the user against authority information leaks and impersonation attacks based on these. We refine the security model of nominative signatures, and propose a new efficient scheme which is provably secure based on the computational Diffie-Hellman problem and the decisional linear problem. To the best of our knowledge, this is the first nominative signature scheme which is provably secure in the standard model. Furthermore, unlike the previous schemes, the proposed scheme provides signatures which hide both the signer and user identity. Hence, through our nominative signature scheme, we achieve an efficient nontransferable user certification scheme with strong security guarantees.