• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Securing password recovery through dispersion

Thumbnail
Date
2012
Dewey
Organisation des données
Sujet
Cloud; Dispersion; Password escrow; Password recovery
DOI
http://dx.doi.org/10.1109/CASoN.2012.6412407
Conference name
2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)
Conference date
11-2012
Conference city
Sao Carlos
Conference country
Brazil
Book title
2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN), proceedings
Publisher
IEEE
Year
2012
ISBN
978-1-4673-4793-8
URI
https://basepub.dauphine.fr/handle/123456789/11835
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Jajodia, Sushil
Litwin, Witold
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Schwarz, Thomas
Type
Communication / Conférence
Item number of pages
228-233
Abstract (EN)
Passwords form the Achilles heel of most uses of modern cryptography. Key recovery is necessary to provide continuous access to documents and other electronic assets in spite of possible loss of a password. Key escrow services provide key recovery for the owner, but need to be trusted. Additionally, a user might want to divulge passwords in case of his/her death or incapacitation, but not before. We present here a scheme that uses dispersion to provide trusted escrow services. Our scheme uses secret sharing to disperse password recovery information over several escrow services that authenticate based on a weak password. To protect against dictionary attacks, each authentication attempt takes a noticeable, but tolerable time (e.g. minutes). We achieve this by having the share of the secret be the solution of a puzzle that is solved by brute force in time depending on the number of processors employed. This additionally prevents escrow agencies from optimizing their part in recovering a password by pre-computing and storing their share in a more accessible and hence vulnerable format.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.