Pre-Grant Publication Number: 20100246827
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | This paper makes the relation between (hierarchical) identity-based encryption and searchable encryption explicit, and also provides extensions such as ID-based searchable encryption and temporarily searchable encryption that make clever use of the hierarchical key structure. |
Basic Information
| Type of Prior Art | Online Publication |
| URL | http://www.di.ens.fr/~mabdalla/... |
| Author/Creator | Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone |
| Title | Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions |
| Publication Date | February 2007 |
| Publisher | CRYPTO 2005 |
| Directions to Document Location | |
| Additional Information | pages 205-222 |
Notes / To Do
| Notes | Prior art identified by Gregory Neven, IBM, and submitted by Diane Willis. |
Excerpt
Excerpt We identify and fill some gaps with regard to consistency (the extent to which false positives are produced) for public-key encryption with keyword search (PEKS). We define computational and statistical relaxations of the existing notion of perfect consistency, show that the scheme of:
Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Public key en-
cryption with keyword search. In Christian Cachin and Jan Camenisch, editors, Advances in
Cryptology – EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages
506–522, Interlaken, Switzerland, May 2–6, 2004. Springer.
is computationally consistent, and provide a new scheme that is statistically consistent. We also provide a transform of an anonymous identity-based encryption (IBE) scheme to a secure PEKS scheme that, unlike the previous one, guarantees consistency. Finally, we suggest three extensions of the basic notions considered here, namely anonymous hierarchical identity-based encryption, public-key encryption with temporary keyword search, and identity-based encryption with keyword search. |
Relevance
Claims
1
Relevance
See the Excerpt.
See the Excerpt.
Claim Chart
Some
0 days left
