A Fuzzy ID-Based Encryption Efficient When Error Rate Is Low

  • Authors:
  • Jun Furukawa;Nuttapong Attrapadung;Ryuichi Sakai;Goichiro Hanaoka

  • Affiliations:
  • NEC Corporation, Japan;AIST, Japan;Osaka Electro-Communication University, Japan;AIST, Japan

  • Venue:
  • INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fuzzy identity-based encryption schemes are attribute-basedencryption schemes such that each party with the private key for anattribute set $\mathcal{S}$ is allowed to decrypt ciphertextsencrypted by an attribute set $\mathcal{S}'$, if and only if thetwo sets $\mathcal{S}$ and $\mathcal{S}'$ are close to each otheras measured by the set-overlap-distance metric. That is, there is athreshold t and, if t out of n attributes of $\mathcal{S}$ are also included in $\mathcal{S}'$,the receivers can decrypt the ciphertexts. In previous schemes,this threshold t is fixed when private keys are generatedand the length of ciphertexts are linear to n . In thispaper, we propose a novel fuzzy identity-based encryption schemewhere the threshold t is flexible by nature and the lengthof ciphertexts are linear to n - t . The latterproperty makes the scheme short if it allows receivers to decryptciphertexts when error rate n - t , i.e., distancebetween the two attribute sets, is low.