ID-based Cryptography from Composite Degree Residuosity

Man Ho Au; Victor K.  Wei

Paper 2004/164

ID-based Cryptography from Composite Degree Residuosity

Man Ho Au and Victor K. Wei

Abstract

We present identity-based identification (resp. encryption, signature, blind signature,ring signature) from composite degree residuosity (CDR). Constructions of identifications and signatures motivated by several existing CDR-based bandwidth-efficient encryption schemes are presented. Their securities are proven equivalent to famous hard problems, in the random oracle model. Motivated by Cocks,we construct an identity-based encryption from CDR. Its security is proven equivalent to a new problem, the JSR (Jacobi Symbol of Roots of two quadratic polynomials) Problem. We prove JSR is at least as hard as QRP (Quadratic Residuosity Problem). Furthermore, we present the first two-way equivalence reduction of the security of Cocks' IBE, to the JSR Problem.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: ID-based Cryptography
Contact author(s): mhau3 @ ie cuhk edu hk
History: 2004-07-14: received
Short URL: https://ia.cr/2004/164
License: CC BY

BibTeX

@misc{cryptoeprint:2004/164,
      author = {Man Ho Au and Victor K.  Wei},
      title = {{ID}-based Cryptography from Composite Degree Residuosity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/164},
      year = {2004},
      url = {https://eprint.iacr.org/2004/164}
}