#### DMCA

## Fuzzy identity-based encryption (2005)

Venue: | In EUROCRYPT |

Citations: | 352 - 20 self |

### Citations

2497 | How to share a secret
- Shamir
- 1979
(Show Context)
Citation Context ...hard. Our primary technique is that we construct a user’s private key as a set of private key components, one for each attribute in the user’s identity. We share use Shamir’s method of secret sharing =-=[14]-=- to distribute shares of a master secret in the exponents of the user’s private key components. Shamir’s secret sharing within the exponent gives our scheme the crucial property of being error-toleran... |

1696 | M.K.: Identity-based encryption from the weil pairing
- Boneh, Franklin
- 2001
(Show Context)
Citation Context ...r DiffieHellman assumption. 1.1 Related Work Identity-Based Encryption Shamir [15] first proposed the concept of Identity-Based Encryption. However, it wasn’t until much later that Boneh and Franklin =-=[3]-=- presented the first IdentityBased Encryption scheme that was both practical and secure. Their solution made novel use of groups for which there was an efficiently computable bilinear map. Canetti et ... |

1090 |
Identity-based cryptosystems and signature schemes
- Shamir
- 1984
(Show Context)
Citation Context ...llusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the Selective-ID security model. 1 Introduction Identity-Based Encryption =-=[15]-=- (IBE) allows for a sender to encrypt a message to an identity without access to a public key certificate. The ability to do public key encryption without certificates has many practical applications.... |

327 | A Fuzzy Commitment Scheme
- Juels, Wattenberg
- 1999
(Show Context)
Citation Context ...efficiency and prove security in the Selective-ID model without random oracles. Biometrics Other work in applying biometrics to cryptography has focused on the derivation of a secret from a biometric =-=[12, 11, 10, 6, 9, 7, 4]-=-. This secret can be then used for operations such as symmetric encryption or UNIX style password authentication. The distinguishing feature of our work from the above related work on biometrics above... |

247 | A forward-secure public-key encryption scheme
- Canetti, Halevi, et al.
- 2003
(Show Context)
Citation Context ... system for large universes, where attributes are defined by arbitrary strings. We prove our scheme secure under an adapted version of the Selective-ID security model first proposed by Canetti et al. =-=[5]-=-. Additionally, our construction does not use random oracles. We reduce the security of our scheme to an assumption that is similar to the Decisional Bilinear DiffieHellman assumption. 1.1 Related Wor... |

183 | Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
- Sahai
- 1999
(Show Context)
Citation Context ...ave been in the chosen-plaintext model. Our scheme can be extended to the chosen-ciphertext model by applying the technique of using simulation-sound NIZK proofs to achieve chosen-ciphertext security =-=[13]-=-. Alternatively, if we are willing to use random oracles, then the we can use standard techniques such as the Fujisaki-Okamoto transformation [8]. 5.2 Security in Full IBE Model Suppose all identities... |

149 | X.: Efficient selective-id secure identity based encryption without random oracles
- Boneh, Boyen
- 2004
(Show Context)
Citation Context ...d a slightly weaker model of security known as the Selective-ID model, in which the adversary declares which identity he will attack before the global public parameters are generated. Boneh and Boyen =-=[2]-=- give two schemes with improved efficiency and prove security in the Selective-ID model without random oracles. Biometrics Other work in applying biometrics to cryptography has focused on the derivati... |

145 |
On enabling secure applications through offline biometric identification
- Davida, Frankel, et al.
- 1998
(Show Context)
Citation Context ...fficiency and prove security in the Selective-ID model without random oracles. Biometrics. Other work in applying biometrics to cryptography has focused on the derivation of a secret from a biometric =-=[12, 11, 10, 6, 9, 7, 4]-=-. This secret can be then used for operations such as symmetric encryption or UNIX style password authentication. The distinguishing feature of our work from the above related work on biometrics above... |

140 | Password Hardening Based on Keystroke Dynamics
- Monrose, Reiter, et al.
- 1999
(Show Context)
Citation Context ...efficiency and prove security in the Selective-ID model without random oracles. Biometrics Other work in applying biometrics to cryptography has focused on the derivation of a secret from a biometric =-=[12, 11, 10, 6, 9, 7, 4]-=-. This secret can be then used for operations such as symmetric encryption or UNIX style password authentication. The distinguishing feature of our work from the above related work on biometrics above... |

114 | Key-privacy in publickey encryption
- Bellare, Boldyreva, et al.
- 2001
(Show Context)
Citation Context ...-based encryption systems there will often not be one party that can act as an authority for all attributes. Also, a Fuzzy-IBE scheme that hides the public key that was used to encrypt the ciphertext =-=[1]-=- is intriguing. Our scheme uses set-overlap as a similarity measure between identities. (We note a Hamming-distance construction can also be built using our techniques.) An open problem is to build ot... |

95 | Reusable Cryptographic Fuzzy Extractors
- Boyen
- 2004
(Show Context)
Citation Context ...efficiency and prove security in the Selective-ID model without random oracles. Biometrics Other work in applying biometrics to cryptography has focused on the derivation of a secret from a biometric =-=[12, 11, 10, 6, 9, 7, 4]-=-. This secret can be then used for operations such as symmetric encryption or UNIX style password authentication. The distinguishing feature of our work from the above related work on biometrics above... |

95 |
Cryptographic key generation from voice
- Monrose, Reiter, et al.
- 2001
(Show Context)
Citation Context |

40 | ID-Based Encryption for Complex Hierarchies with Applications to Forward Security and Broadcast Encryption
- Yao, Dodis, et al.
- 2004
(Show Context)
Citation Context ...capturing a digital reading of someone’s biometric would (forever) invalidate approaches where symmetric keys are systematically derived from biometric readings. Attribute-based encryption Yao et al. =-=[17]-=- show how an IBE system that encrypts to multiple hierarchical-identities in a collusion-resistant manner implies a forward secure Hierarchical IBE 3scheme. They also note how their techniques for re... |

19 |
Efficient identity based encryption without random oracles
- Waters
(Show Context)
Citation Context ...on [2] that our scheme is secure in the full model with a factor of ( ) |U| n in the reduction. The original IBE scheme of Boneh and Franklin [3] and a later schemes of Boneh and Boyen [2] and Waters =-=[16]-=- achieve IBE in the full model with non-exponential reductions. However, all methods achieve this by essentially removing the relationships between nearby identities. In 9Fuzzy-IBE it is essential th... |

4 |
Fuzzy extractors: How to generate string keys from biometrics and other noisy data
- Dodis, Reyzin, et al.
(Show Context)
Citation Context |

4 |
Towards Voice Generated Cryptographic Keys on Resource Constrained Devices
- Monrose, Reiter, et al.
- 2002
(Show Context)
Citation Context |