Open Access. Powered by Scholars. Published by Universities.®
Science and Technology Studies Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Science and Technology Studies
The Need For Deniability In Identification Schemes, Pairat Thorncharoensri, Qiong Huang, Man Ho Au, Willy Susilo, Guomin Yang, Yi Mu, Duncan Wong
The Need For Deniability In Identification Schemes, Pairat Thorncharoensri, Qiong Huang, Man Ho Au, Willy Susilo, Guomin Yang, Yi Mu, Duncan Wong
Dr Guomin Yang
With the increasing concern on the erosion of privacy in the society, privacy-preserving techniques have become a very essential issue. This paper provides a formal treatment of deniability in identification schemes. In particular, the contributions of this paper are three folds. Firstly, for the first time in the literature, we address the issue of deniability in identification scheme. Deniability ensures the prover's privacy even after the identification protocol completes. With the deniability property, it is assured that the verifier will not be able to convince any other third party that the prover has engaged in the identification protocol with the …
Malicious Kgc Attacks In Certificateless Cryptography, Man Ho Au, Jing Chen, Joseph K. Liu, Yi Mu, Duncan S. Wong, Guomin Yang
Malicious Kgc Attacks In Certificateless Cryptography, Man Ho Au, Jing Chen, Joseph K. Liu, Yi Mu, Duncan S. Wong, Guomin Yang
Dr Guomin Yang
Identity-based cryptosystems have an inherent key escrow issue, that is, the Key Generation Center (KGC) always knows user secret key. If the KGC is malicious, it can always impersonate the user. Certificateless cryptography, introduced by Al-Riyami and Paterson in 2003, is intended to solve this problem. However, in all the previously proposed certificateless schemes, it is always assumed that the malicious KGC starts launching attacks (so-called Type II attacks) only after it has generated a master public/secret key pair honestly. In this paper, we propose new security models that remove this assumption for both certificateless signature and encryption schemes. Under …
(Strong) Multi-Designated Verifiers Signatures Secure Against Rogue Key Attack, Yunmei Zhang, Man Ho Allen Au, Guomin Yang, Willy Susilo
(Strong) Multi-Designated Verifiers Signatures Secure Against Rogue Key Attack, Yunmei Zhang, Man Ho Allen Au, Guomin Yang, Willy Susilo
Dr Guomin Yang
Designated verifier signatures (DVS) allow a signer to create a signature whose validity can only be verified by a specific entity chosen by the signer. In addition, the chosen entity, known as the designated verifier, cannot convince any body that the signature is created by the signer. Multi-designated verifiers signatures (MDVS) are a natural extension of DVS in which the signer can choose multiple designated verifiers. DVS and MDVS are useful primitives in electronic voting and contract signing. In this paper, we investigate various aspects of MDVS and make two contributions. Firstly, we revisit the notion of unforgeability under rogue …