scispace - formally typeset
Open AccessPosted Content

Fuzzy Identity Based Encryption.

Reads0
Chats0
TLDR
In this paper, a new type of identity-based encryption called Fuzzy Identity-Based Encryption (IBE) was introduced, where an identity is viewed as set of descriptive attributes, and a private key for an identity can decrypt a ciphertext encrypted with an identity if and only if the identities are close to each other as measured by the set overlap distance metric.
Abstract
We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we view an identity as set of descriptive attributes. A Fuzzy IBE scheme allows for a private key for an identity, ω, to decrypt a ciphertext encrypted with an identity, ω ′, if and only if the identities ω and ω ′ are close to each other as measured by the “set overlap” distance metric. A Fuzzy IBE scheme can be applied to enable encryption using biometric inputs as identities; the error-tolerance property of a Fuzzy IBE scheme is precisely what allows for the use of biometric identities, which inherently will have some noise each time they are sampled. Additionally, we show that Fuzzy-IBE can be used for a type of application that we term “attribute-based encryption”. In this paper we present two constructions of Fuzzy IBE schemes. Our constructions can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity. Our IBE schemes are both error-tolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the Selective-ID security model.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Design for a secure interoperable cloud-based Personal Health Record service

TL;DR: The design for a secure interoperable cloud-based PHR service based on open standards such as eXtensible Access Control Markup Language, XML Encryption, XML Signature, and XML Key Management Specification is proposed.
Journal ArticleDOI

A ciphertext-policy attribute-based proxy re-encryption scheme for data sharing in public clouds

TL;DR: The new CP‐ABPRE scheme can be proven CCA secure under the decisional q‐parallel bilinear Diffie–Hellman exponent assumption and supports attribute‐based re‐encryption with any monotonic access structures.
Journal ArticleDOI

A ciphertext-policy Attribute based encryption scheme for wireless body area networks based on ECC

TL;DR: This paper has proposed a secure framework for WBAN using Elliptic Curve Cryptography based Ciphertext-Policy Attribute Based Encryption (CPABE) without bilinear pairing operations and shows that the scheme outperforms the existing schemes forWBAN in terms of keys-ciphertext size and computation overhead.
Journal Article

Attribute Based Group Key Management

TL;DR: Novel key management schemes that allow users whose attributes satisfy a certain access control policy to derive the group key are proposed that efficiently support rekeying operations when the group changes due to joins or leaves of group members.

Towards Trustworthy Identity and Access Management for the Future Internet

TL;DR: This paper sketches the foundations of a novel identity and access management approach that is tailored for the Future Internet and provides mechanisms for flexible modeling and description of digital user identities with support to transaction-based privacy protection, access to personal data, flexible third party accountability and end-to-end secure communication.
References
More filters
Journal ArticleDOI

How to share a secret

TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Book ChapterDOI

Identity-based cryptosystems and signature schemes

TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Journal ArticleDOI

Identity-Based Encryption from the Weil Pairing

TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
Book ChapterDOI

Efficient identity-based encryption without random oracles

TL;DR: This work first presents their IBE construction and reduces the security of the scheme to the decisional Bilinear Diffie-Hellman (BDH) problem, and shows that their techniques can be used to build a new signature scheme that is secure under the computational Diffie -Hellman assumption without random oracles.
Book ChapterDOI

Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles

TL;DR: The first secure IBE scheme without random oracles was presented in this article, where the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively.
Related Papers (5)