ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Efficient Protocol for Authenticated Email Search

Chatterjee, Sanjit and Mukherjee, Sayantan and Patidar, Govind (2015) Efficient Protocol for Authenticated Email Search. In: 5th International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE), OCT 03-07, 2015, Malaviya Natl Inst Technol, Jaipur, INDIA, pp. 1-20.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-319-24126-5_1

Abstract

Executing authenticated computation on outsourced data is currently an area of major interest in cryptology. Large databases are being outsourced to untrusted servers without appreciable verification mechanisms. As adversarial server could produce erroneous output, clients should not trust the server's response blindly. Primitive set operations like union, set difference, intersection etc. can be invoked on outsourced data in different concrete settings and should be verifiable by the client. One such interesting adaptation is to authenticate email search result where the untrusted mail server has to provide a proof along with the search result. Recently Ohrimenko et al. proposed a scheme for authenticating email search. We suggest significant improvements over their proposal in terms of client computation and communication resources by properly recasting it in two-party settings. In contrast to Ohrimenko et al. we are able to make the number of bilinear pairing evaluation, the costliest operation in verification procedure, independent of the result set cardinality for union operation. We also provide an analytical comparison of our scheme with their proposal which is further corroborated through experiments.

Item Type: Conference Proceedings
Related URLs:
Additional Information: Copy right for this article belongs to the SPRINGER INT PUBLISHING AG, GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND
Keywords: Authenticated email search; outsourced verifiable computation; bilinear accumulator; pairing-based cryptography
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 06 Jan 2016 05:53
Last Modified: 06 Jan 2016 05:53
URI: http://eprints.iisc.ernet.in/id/eprint/53062

Actions (login required)

View Item View Item