Person:
Mathuria, Anish

Profile Picture

Name

Anish Mathuria

Job Title

Faculty

Email Address

Telephone

079-68261541

Birth Date

Specialization

Network Security, Privacy-Preserving Computation, System and Software Security

Abstract

Biography

Anish Mathuria is a Professor at DA-IICT. His research interests are in information security and cryptography. Anish is currently an Associate Editor for Sadhana, a journal published by Indian Academy of Sciences. He has served on the program committees of ICISS, Indocrypt, and SPACE conferences. Anish was an invited speaker at the CIMPA-UNESCO-INDIA School on Security for Computer Systems and Networks held in 2005. He has served on the committee for �e-Authentication standards�� constituted by the Ministry of Communications and Information Technology. Anish has a Bachelor�s degree in Electronics from University of Bombay, and Master�s and PhD degrees in Computer Science from University of Wollongong, Australia. Prior to joining the faculty at DA-IICT, he was at IBM Tokyo Research Laboratory, and University of Massachusetts Dartmouth, USA

Research Projects

Organizational Units

Name

Filters

2010 - 20193

Settings

search.filters.applied.f.isAuthorOfPublication: search.filters.isAuthorOfPublication.078fff3e-c9c9-46b3-b171-66587e178807

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    PublicationMetadata only
    Information Systems Security
    (Springer, Berlin, 2010-12-07) Jha, Somesh; Mathuria, Anish
  • Thumbnail Image
    PublicationMetadata only
    Comprehensive evaluation of key management hierarchies for outsourced data
    (Springer, 01-12-2019) Kumar, Naveen; Mathuria, Anish; Mathuria, Anish; Mathuria, Anish; Mathuria, Anish; Mathuria, Anish; Mathuria, Anish; DA-IICT, Gandhinagar
    Key management is an essential component of a cryptographic access control system with a large number of resources. It manages the secret keys assigned to the system entities in such a way that only authorized users can access a resource. Read access control allows read access of a resource by the authorized users and disallows others. An important objective of a key management is to reduce the secret key storage with each authorized user. To this end, there exist two prominent types of key management hierarchy with single key storage per user used for read access control in data outsourcing scenario: user-based and resource-based. In this work, we analyze the two types of hierarchy with respect to static hierarchy characteristics and dynamic operations such as adding or revoking user authorization. Our analysis shows that the resource-based hierarchies can be a better candidate which is not given equal emphasis in the literature. A new heuristic for minimizing the key management hierarchy is introduced that makes it practical in use even for a large number of users and resources. The performance evaluation of dynamic operations such as adding or revoking a user�s read subscription is shown experimentally to support our analytical results.
  • Thumbnail Image
    PublicationMetadata only
    detecting flaws in dynamic hierarchical key management schemes using specification animation
    (01-09-2012) Mundra, Anil; Mathuria, Anish; Das, Maniklal; DA-IICT, Gandhinagar; Kumar, Naveen Sahu (201021001); Mundra, Anil (200911022)
    In key assignment schemes for hierarchical access control systems, each access class has a key associated with it that can be used to derive the keys associated with every descendant of that class. Many recently proposed key assignment schemes support updates to the hierarchy such as addition and deletion of classes and class relationships. The dynamic changes entail a change to the hierarchy as well as re-computing of public and secret information. In this paper, we describe a software tool that supports the animation of specifications of dynamic schemes. The specification of a scheme, written in Prolog, corresponds to a symbolic model of the algorithms used by the scheme for key generation and for handling dynamic changes. The tool allows us to generate a test hierarchy, generate keys for the classes in the hierarchy, and simulate various dynamic operations. The animation search using the tool has shown to be useful in finding previously unreported attacks on several existing dynamic schemes.