CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On Confidentiality and Algorithms

J. Agat ; David Sands (Institutionen för datavetenskap ; Institutionen för datavetenskap, ProSec)
Proceedings of the 2001 IEEE Symposium on Security and Privacy (S&P-01) / Titsworth, Francis M. p. 64-77. (2001)
[Konferensbidrag, refereegranskat]

Recent interest in methods for certifying programs for secure information flow (noninterference) have failed to raise a key question: can efficient algorithms be written so as to satisfy the requirements of secure information flow? In this paper we discuss how algorithms for searching and sorting can be adapted to work on collections of secret data without leaking any confidential information, either directly, indirectly, or through timing behaviour. We pay particular attention to the issue of timing channels caused by cache behaviour, and argue that it is necessary to disable the effect of the cache in order to construct algorithms manipulating pointers to objects in such a way that they satisfy the conditions of noninterference.

Denna post skapades 2006-09-28. Senast ändrad 2017-09-14.
CPL Pubid: 18062


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap (1993-2001)
Institutionen för datavetenskap, ProSec (2002-2004)


Datavetenskap (datalogi)

Chalmers infrastruktur