DocumentCode :
2226915
Title :
Space-Efficient Identity Based EncryptionWithout Pairings
Author :
Boneh, Dan ; Gentry, Craig ; Hamburg, Michael
Author_Institution :
Stanford Univ., Stanford
fYear :
2007
fDate :
21-23 Oct. 2007
Firstpage :
647
Lastpage :
657
Abstract :
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which builds an IBE based on the quadratic residuosity problem modulo an RSA composite N. The Cocks system, however, produces long ciphertexts. Since the introduction of the Cocks system in 2001 it has been an open problem to construct a space efficient IBE system without pairings. In this paper we present an IBE system in which ciphertext size is short: an encryption of an f.-bit message consists of a single element in Z/NZ plus lscr + 1 additional bits. Security, as in the Cocks system, relies on the quadratic residuosity problem. The system is based on the theory of ternary quadratic forms and as a result, encryption and decryption are slower than in the Cocks system.
Keywords :
public key cryptography; random processes; Cocks system; RSA cryptography; bilinear map; cipher text; elliptic curve cryptography; public key cryptography; quadratic residuosity problem modulo; random oracle model; space-efficient identity based encryption system; ternary quadratic form theory; Application software; Computer science; Computer security; Elliptic curve cryptography; Elliptic curves; Identity-based encryption; Public key; Public key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
Conference_Location :
Providence, RI
ISSN :
0272-5428
Print_ISBN :
978-0-7695-3010-9
Type :
conf
DOI :
10.1109/FOCS.2007.50
Filename :
4389533
Link To Document :
بازگشت