Abstract
According to the Jericho forum, the trend in information security is moving the security perimeter as close to the data as possible. In this context, we suggest the idea of data-based access control, where decryption of data is made possible by knowing enough of the data. Trust is thus based on what someone already knows. A specific problem is defined as follows: given n pieces of data, an agent is able to recover all n items once she knows k of them. The problem is similar to both secure sketches and secret sharing, and we show that both can be used as a basis for constructions. Examples of possible applications are granting access without credentials, recovering forgotten passwords and sharing personal data in social networks.
Original language | Undefined |
---|---|
Title of host publication | Data and Applications Security 2009 |
Editors | E. Gudes, J. Vaidya |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 240-251 |
Number of pages | 12 |
ISBN (Print) | 978-3-642-03006-2 |
DOIs | |
Publication status | Published - Jul 2009 |
Event | 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security, DBSec 2009 - Montreal, Canada Duration: 12 Jul 2009 → 15 Jul 2009 Conference number: 23 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Verlag |
Volume | 5645 |
Conference
Conference | 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security, DBSec 2009 |
---|---|
Abbreviated title | DBSec |
Country/Territory | Canada |
City | Montreal |
Period | 12/07/09 → 15/07/09 |
Keywords
- METIS-264411
- De-perimeterisation
- IR-67816
- EWI-15728
- secure sketches
- data-based access control
- SCS-Cybersecurity
- secret sharing