• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

LH*RE: A Scalable Distributed Data Structure with Recoverable Encryption

Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2010), LH*RE: A Scalable Distributed Data Structure with Recoverable Encryption, IEEE 3rd International Conference on Cloud Computing (CLOUD), 2010 - proceedings, IEEE, p. 354-361. http://dx.doi.org/10.1109/CLOUD.2010.41

View/Open
document_jajodia.pdf (777.4Kb)
Type
Communication / Conférence
Date
2010
Conference title
IEEE 3rd International Conference on Cloud Computing (CLOUD), 2010
Conference date
2010-07
Conference city
Miami
Conference country
États-Unis
Book title
IEEE 3rd International Conference on Cloud Computing (CLOUD), 2010 - proceedings
Publisher
IEEE
ISBN
978-1-4244-8207-8
Pages
354-361
Publication identifier
http://dx.doi.org/10.1109/CLOUD.2010.41
Metadata
Show full item record
Author(s)
Jajodia, Sushil
Litwin, Witold
Schwarz, Thomas
Abstract (EN)
LH*RE is a new Scalable Distributed Data Structure (SDDS) for hash files stored in a cloud. The client-side symmetric encryption protects the data against the server-side disclosure. The encryption key(s) at the client are backed up in the file. The client may recover/revoke any keys lost or stolen from its node. A trusted official can also do it on behalf of the client or of an authority, e.g., to imperatively access the data of a client missing or disabled. In contrast, with high assurance, e.g., 99%, the attacker of the cloud should not usually disclose any data, even if the intrusion succeeds over dozens or possibly thousands of servers for a larger file. Storage and primary key-based access performance of LH*RE should be about those of the well-known LH* SDDS. Two messages should typically suffice for a key-based search and four in the worst case, with the application data load factor of 70%, regardless of the file scale up. These features are among most efficient for a hash SDDS. LH*RE should be attractive with respect to the competition.
Subjects / Keywords
Linear Hashing; LH*; Scalable Distributed Data Structures; Encryption; Database as a Service

Related items

Showing items related by title and author.

  • Thumbnail
    Scalable Distributed Virtual Data Structures 
    Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2014) Communication / Conférence
  • Thumbnail
    LH*RS---a highly-available scalable distributed data structure 
    Litwin, Witold; Moussa, Rim; Schwarz, Thomas (2005) Article accepté pour publication ou publié
  • Thumbnail
    LH*RSP2P: a scalable distributed data structure for P2P environment 
    Litwin, Witold; Yakouben, Hanafi; Schwarz, Thomas (2008) Communication / Conférence
  • Thumbnail
    Privacy of data outsourced to a cloud for selected readers through client-side encryption 
    Schwarz, Thomas; Jajodia, Sushil; Litwin, Witold (2011) Communication / Conférence
  • Thumbnail
    Recoverable Encryption through Noised Secret over a Large Cloud 
    Schwarz, Thomas; Litwin, Witold; Jajodia, Sushil (2012) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo