Space-Efficient Identity-Based Encryption: Spelling out the Approach by Boneh-Gentry-Hamburg
نویسندگان
چکیده
Identity-based encryption (also known as IBE) is a type of public key cryptography in which the public key of a user is some unique information about his identity. The initial motivation to the creation of IBE was to simplify key management in email systems. An open problem was the creation of a space-efficient IBE scheme that was not based in pairings on elliptic curves. Boneh, Gentry and Hamburg proposed such a system in 2007. The objective of this work is to do a critical analysis of how Boneh, Gentry and Hamburg scheme works, filling in some missing details whenever necessary. Resumo. Encriptação Baseada em Identidade (mais conhecida como Identitybased encryption ou IBE) é um tipo de criptografia de chave pública tal que a chave pública de um usuário é alguma informação única sobre a sua identidade. A motivação inicial para a criação de IBE foi simplificar o gerenciamento de certificados em sistemas de email. Um problema em aberto era a criação de um esquema de IBE espaço-eficiente e sem recorrer a emparelhamentos em curvas elípticas. Boneh, Gentry e Hamburg propuseram tal sistema em 2007. O objetivo desse trabalho é fazer uma análise crítica do funcionamento do esquema de Boneh, Gentry e Hamburg, preenchendo detalhes quando necessário.
منابع مشابه
New Efficient Identity-Based Encryption From Factorization
Identity Based Encryption (IBE) systems are often constructed using pairings or lattices. Three exceptions are due to Cocks in 2001, Boneh, Gentry and Hamburg in 2007, and Paterson and Srinivasan in 2009. The main goal of this paper to propose new IBE schemes, which may give a way to find IBEs without pairing or lattice. Essentially, the security of our IBE schemes is rooted in the intractabili...
متن کاملBoneh-Gentry-Hamburg's Identity-based Encryption Schemes Revisited
We revise Boneh-Gentry-Hamburg’s identity-based encryption schemes and we show that we can renounce to the use of pseudo-random functions. We then prove IND-ID-CPA and ANON-IND-ID-CPA security of these schemes by showing that the advantage of any efficient adversary against these schemes is less than or equal to the quadratic residuosity advantage of some efficient adversary against the RSA gen...
متن کاملMediated Encryption: Analysis and Design
Boneh, Ding and Tsudik presented identity-based mediated RSA encryption and signature systems in which the users are not allowed to decrypt/sign messages without the authorisation of a security mediator.We show that ID-MRSA is not secure and we present a secure modified version of it which is as efficient as the original system. We also propose a generic mediated encryption that translates any ...
متن کاملAnonymous IBE from Quadratic Residuosity with Improved Performance
Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity. The latter is an attractive basis for an IBE owing to the fact that it is a well-understood hard problem from number theory. Cocks constructed the first such scheme, and subsequent improvements have been made to achieve anonymity and improve space efficiency. However, the anonymous v...
متن کاملJhanwar-Barua's Identity-Based Encryption Revisited
In FOCS’07, Boneh, Gentry and Hamburg presented an identity-based encryption (IBE) system (BasicIBE) based on the quadratic residuosity (QR) assumption. A BasicIBE encryption of an l-bit message has a short ciphertext of log2 N +2l bits where N is a Blum integer. However, it is not time-efficient due to solving l+1 equations in the formRx+ Sy ≡ 1 (mod N). Jhanwar and Barua presented a variant o...
متن کامل