An identity-based signature from gap Diffie-Hellman groups
JC Choon, J Hee Cheon - Public Key Cryptography—PKC 2003: 6th …, 2002 - Springer
In this paper we propose an identity (ID)-based signature scheme using gap Diffie-Hellman
(GDH) groups. Our scheme is proved secure against existential forgery on adaptively …
(GDH) groups. Our scheme is proved secure against existential forgery on adaptively …
An efficient signature scheme from bilinear pairings and its applications
Abstract In Asiacrypt2001, Boneh, Lynn, and Shacham [8] proposed a short signature
scheme (BLS scheme) using bilinear pairing on certain elliptic and hyperelliptic curves …
scheme (BLS scheme) using bilinear pairing on certain elliptic and hyperelliptic curves …
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
H Du, Q Wen - Computer Standards & Interfaces, 2009 - Elsevier
Certificateless public key cryptography is a recently proposed attractive paradigm which
combines advantages of both certificate-based and ID-based public key cryptosystems as it …
combines advantages of both certificate-based and ID-based public key cryptosystems as it …
A new ID-based signature with batch verification
An identity (ID)-based signature scheme allows any pair of users to communicate securely
and to verify each other's signatures without exchanging public key certificates. We have …
and to verify each other's signatures without exchanging public key certificates. We have …
Secret Exponent Attacks on RSA-type Schemes with Moduli N=p r q
A May - Public Key Cryptography–PKC 2004: 7th International …, 2004 - Springer
We consider RSA-type schemes with modulus N= prq for r≥ 2. We present two new attacks
for small secret exponent d. Both approaches are applications of Coppersmith's method for …
for small secret exponent d. Both approaches are applications of Coppersmith's method for …
Method and system for authenticated login using static or dynamic codes
A Ebrahimi, G Khot, V Reshetnikov… - US Patent 11,134,075, 2021 - Google Patents
Method of authentication including sending a login web page to a first device of a user
including a scannable code having an envelope ID and a login challenge. The envelope ID …
including a scannable code having an envelope ID and a login challenge. The envelope ID …
An efficient identity-based short signature scheme from bilinear pairings
H Du, Q Wen - … on Computational Intelligence and Security (CIS …, 2007 - ieeexplore.ieee.org
In this paper, we present an ID-based signature scheme that is proved to be secure in the
random oracle model under the hardness assumption of k-CAA problem. The proposed …
random oracle model under the hardness assumption of k-CAA problem. The proposed …
Algorithms and approaches of proxy signature: A survey
arXiv:cs/0612098v1 [cs.CR] 20 Dec 2006 Page 1 arXiv:cs/0612098v1 [cs.CR] 20 Dec 2006
Algorithms and Approaches of Proxy Signature: A Survey MANIK LAL DAS Dhirubhai Ambani …
Algorithms and Approaches of Proxy Signature: A Survey MANIK LAL DAS Dhirubhai Ambani …
Time-selective convertible undeniable signatures
F Laguillaumie, D Vergnaud - Topics in Cryptology–CT-RSA 2005: The …, 2005 - Springer
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the
self-authenticating property of digital signatures. An extended concept–the convertible …
self-authenticating property of digital signatures. An extended concept–the convertible …
Short undeniable signatures without random oracles: The missing link
F Laguillaumie, D Vergnaud - International Conference on Cryptology in …, 2005 - Springer
We introduce a new undeniable signature scheme which is existentially unforgeable and
anonymous under chosen message attacks in the standard model. The scheme is an …
anonymous under chosen message attacks in the standard model. The scheme is an …