Adaptively Secure Computationally Efficient Searchable Symmetric Encryption

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\ud 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\ud from two disadvantages.\ud First, searching the stored documents takes time linear in the size of the database, and/or uses heavy arithmetic operations.\ud Secondly, the existing schemes do not consider adaptive attackers;\ud a search-query will reveal information even about documents stored\ud in the future. If they do consider this, it is at a significant\ud cost to updates.\ud In this paper we propose a novel symmetric searchable encryption\ud scheme that offers searching at constant time in the number of\ud unique keywords stored on the server. We present two variants of\ud the basic scheme which differ in the efficiency of search and\ud update. We show how each scheme could be used in a personal health\ud record system

CAVA (human Communication: an Audio-Visual Archive)

In order to investigate human communication and interaction, researchers need hours of audio-visual data, sometimes recorded over periods of months or years. The process of collecting, cataloguing and transcribing such valuable data is time-consuming and expensive. Once it is collected and ready to use, it makes sense to get the maximum value from it by reusing it and sharing it among the research community. But unlike highly-controlled experimental data, natural audio-visual data tends to defy easy classification, and may lead to idiosyncratic solutions to preservation, metadata and access issues. It is not uncommon for vital and unique data to languish on VHS tapes in personal collections. Natural data can often be used for more than the purpose its collector intended. Researchers may be able to save time and money, or improve the depth of their observations and conclusions, by reusing existing data instead of collecting their own. Despite its usefulness, data in personal collections does not lend itself to being shared between researchers and institutions on a large scale. This is largely due to the absence, until now, of a centralised data archive to support such research and to offer opportunities for collaborative work. CAVA (human Communication: an Audio-Visual Archive) is a JISC-funded project based at University College London in collaboration with the UK Data Archive (UKDA), running from April 2009 to March 2010

Data model issues in the Cherenkov Telescope Array project

The planned Cherenkov Telescope Array (CTA), a future ground-based Very-High-Energy (VHE) gamma-ray observatory, will be the largest project of its kind. It aims to provide an order of magnitude increase in sensitivity compared to currently operating VHE experiments and open access to guest observers. These features, together with the thirty years lifetime planned for the installation, impose severe constraints on the data model currently being developed for the project. In this contribution we analyze the challenges faced by the CTA data model development and present the requirements imposed to face them. While the full data model is still not completed we show the organization of the work, status of the design, and an overview of the prototyping efforts carried out so far. We also show examples of specific aspects of the data model currently under development.Comment: In Proceedings of the 34th International Cosmic Ray Conference (ICRC2015), The Hague, The Netherlands. All CTA contributions at arXiv:1508.0589

A Study on the Open Source Digital Library Software's: Special Reference to DSpace, EPrints and Greenstone

The richness in knowledge has changed access methods for all stake holders in retrieving key knowledge and relevant information. This paper presents a study of three open source digital library management software used to assimilate and disseminate information to world audience. The methodology followed involves online survey and study of related software documentation and associated technical manuals.Comment: 9 Pages, 3 Figures, 1 Table, "Published with International Journal of Computer Applications (IJCA)

Longitude : a privacy-preserving location sharing protocol for mobile applications

Location sharing services are becoming increasingly popular. Although many location sharing services allow users to set up privacy policies to control who can access their location, the use made by service providers remains a source of concern. Ideally, location sharing providers and middleware should not be able to access users’ location data without their consent. In this paper, we propose a new location sharing protocol called Longitude that eases privacy concerns by making it possible to share a user’s location data blindly and allowing the user to control who can access her location, when and to what degree of precision. The underlying cryptographic algorithms are designed for GPS-enabled mobile phones. We describe and evaluate our implementation for the Nexus One Android mobile phone