Saeed Sedghi
University of Twente
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Saeed Sedghi.
very large data bases | 2010
Peter van Liesdonk; Saeed Sedghi; Jeroen Doumen; Pieter H. Hartel; Willem Jonker
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer from two disadvantages. First, searching the stored documents takes time linear in the size of the database, and/or uses heavy arithmetic operations. Secondly, the existing schemes do not consider adaptive attackers; a search-query will reveal information even about documents stored in the future. If they do consider this, it is at a significant cost to the performance of updates. In this paper we propose a novel symmetric searchable encryption scheme that offers searching at constant time in the number of unique keywords stored on the server. We present two variants of the basic scheme which differ in the efficiency of search and storage. We show how each scheme could be used in a personal health record system.
information security practice and experience | 2011
Saeed Sedghi; Pieter H. Hartel; Willem Jonker; S.I. Nikova
Traditional techniques of enforcing an access control policy rely on an honest reference monitor to enforce the policy. However, for applications where the resources are sensitive, the access control policy might also be sensitive. As a result, an honest-but-curious reference monitor would glean some interesting information from the requests that it processes. For example if a requestor in a role psychiatrist is granted access to a document, the patient associated with that document probably has a psychiatric problem. The patient would consider this sensitive information, and she might prefer the honest-but-curious reference monitor to remain oblivious of her mental problem. We present a high level framework for querying and enforcing a role based access control policy that identifies where sensitive information might be disclosed. We then propose a construction which enforces a role based access control policy cryptographically, in such a way that the reference monitor learns as little as possible about the policy. (The reference monitor only learns something from repeated queries). We prove the security of our scheme showing that it works in theory, but that it has a practical drawback. However, the practical drawback is common to all cryptographically enforced access policy schemes. We identify several approaches to mitigate the drawback and conclude by arguing that there is an underlying fundamental problem that cannot be solved. We also show why attribute based encryption techniques do not not solve the problem of enforcing policy by an honest but curious reference monitor.
Lecture Notes in Computer Science | 2010
Peter van Liesdonk; Saeed Sedghi; Jeroen Doumen; Pieter H. Hartel; Willem Jonker; Milan Petkovic
security and cryptography for networks | 2010
Saeed Sedghi; Peter van Liesdonk; S.I. Nikova; Pieter H. Hartel; Willem Jonker
CTIT technical report series | 2009
Saeed Sedghi; P. van Liesdonk; Jeroen Doumen; Pieter H. Hartel; Willem Jonker
Lecture Notes in Computer Science | 2011
Saeed Sedghi; Pieter H. Hartel; Willem Jonker; S.I. Nikova; Feng Bao; Jian Weng
Lecture Notes in Computer Science | 2010
Saeed Sedghi; Peter van Liesdonk; Svetla Nikova; Pieter H. Hartel; Willem Jonker; Juan A. Garay; Roberto De Prisco
Lecture Notes in Computer Science | 2008
Saeed Sedghi; Jeroen Doumen; Pieter H. Hartel; Willem Jonker
CTIT technical report series | 2008
Saeed Sedghi; Jeroen Doumen; Pieter H. Hartel; Willem Jonker