Guest
04-08-2014, 11:09 AM
1.i m ponnammal.
2.i want the meaning for secure ordered bucketization project abstract.
i dont know nothing about this topic.
now i am in a .net developer trainee position.
my problem is i am not understand what is the meaning of that abstract.
3.i want to know about secure ordered bucketization project.
abstract:
This study examines the ordered bucketization (OB) as a cryptographic object. In OB, plaintextspace is divided
into p disjoint buckets, numbered from 1 to p, based on the order of the ranges that they cover. OB is quite useful in that
a range query can be performed over encrypted data without the need to decrypt by attaching a bucket number to each
ciphertext. Unfortunately, no research has been carried out on the security of OB in a cryptographic sense. This paper
defines an encryption scheme with OB (EOB) and suggests a new security model for EOB, IND-OCPA-P, which assumes
an adversary has reasonable power. Previous constructions proposed for efficient range queries [14], [5], [6] were not secure
in this model. Finally, an OB construction, in which the EOB implementation is secure on the IND-OCPA-P model, is proposed.
In the proposed OB, p-1 points are selected on the uniform distribution in the plaintext-space and the plaintext-space is divided
based on the selected points. A bucket number is assigned to each divided range in ascending range order. With regard to
the efficiency of a range query, the proposed OB guarantees reasonably good efficiency on range queries by showing that the
distribution of a bucket size is not skewed.
Index Terms—Searchable encryption, Symmetric encryption, Data encryption, Database security, Security.[/size][/font]
2.i want the meaning for secure ordered bucketization project abstract.
i dont know nothing about this topic.
now i am in a .net developer trainee position.
my problem is i am not understand what is the meaning of that abstract.
3.i want to know about secure ordered bucketization project.
abstract:
This study examines the ordered bucketization (OB) as a cryptographic object. In OB, plaintextspace is divided
into p disjoint buckets, numbered from 1 to p, based on the order of the ranges that they cover. OB is quite useful in that
a range query can be performed over encrypted data without the need to decrypt by attaching a bucket number to each
ciphertext. Unfortunately, no research has been carried out on the security of OB in a cryptographic sense. This paper
defines an encryption scheme with OB (EOB) and suggests a new security model for EOB, IND-OCPA-P, which assumes
an adversary has reasonable power. Previous constructions proposed for efficient range queries [14], [5], [6] were not secure
in this model. Finally, an OB construction, in which the EOB implementation is secure on the IND-OCPA-P model, is proposed.
In the proposed OB, p-1 points are selected on the uniform distribution in the plaintext-space and the plaintext-space is divided
based on the selected points. A bucket number is assigned to each divided range in ascending range order. With regard to
the efficiency of a range query, the proposed OB guarantees reasonably good efficiency on range queries by showing that the
distribution of a bucket size is not skewed.
Index Terms—Searchable encryption, Symmetric encryption, Data encryption, Database security, Security.[/size][/font]