scispace - formally typeset
Search or ask a question
Institution

International Institute of Information Technology, Hyderabad

EducationHyderabad, India
About: International Institute of Information Technology, Hyderabad is a education organization based out in Hyderabad, India. It is known for research contribution in the topics: Authentication & Internet security. The organization has 2048 authors who have published 3677 publications receiving 45319 citations. The organization is also known as: IIIT Hyderabad & International Institute of Information Technology (IIIT).


Papers
More filters
Journal ArticleDOI
TL;DR: A new fine grained access control with user authentication scheme for TMIS is put forwards and the formal security analysis using both the widely accepted real-or-random model and Burrows-Abadi–Needham logic is presented.
Abstract: A telecare medicine information system (TMIS) for health-care delivery service requires information exchange among multiple IT systems, where different types of users with different access privileges are involved. In TMIS, users generally communicate via public channels. Hence, authentication is essential to provide access to the genuine users. However, access rights for the correct information and resources for different services to the genuine users can be provided with the help of efficient user access control mechanism. The existing user authentication protocols designed for TMIS only provide authentication, but for this kind of application, it is required that the authorized users should also have unique access privilege to access specific data. This paper puts forwards a new fine grained access control with user authentication scheme for TMIS. We present the formal security analysis using both the widely accepted real-or-random model and Burrows-Abadi–Needham logic. The proposed scheme supports user anonymity, forward secrecy, and efficient password change without contacting the remote server. In addition, the proposed scheme is comparable with respect to communication and computation costs as compared with other related schemes proposed in TMIS. Moreover, better tradeoff among security and functionality features, and communication and computation costs makes the proposed scheme suitable and practical for telecare medicine environments as compared with other existing related schemes.

32 citations

Proceedings ArticleDOI
23 Jul 2006
TL;DR: The method used in this paper for language and encoding identification uses pruned character n-grams, alone as well augmented with word n- grams, and seems to give results comparable to other methods.
Abstract: To determine how close two language models (e.g., n-grams models) are, we can use several distance measures. If we can represent the models as distributions, then the similarity is basically the similarity of distributions. And a number of measures are based on information theoretic approach. In this paper we present some experiments on using such similarity measures for an old Natural Language Processing (NLP) problem. One of the measures considered is perhaps a novel one, which we have called mutual cross entropy. Other measures are either well known or based on well known measures, but the results obtained with them vis-avis one-another might help in gaining an insight into how similarity measures work in practice. The first step in processing a text is to identify the language and encoding of its contents. This is a practical problem since for many languages, there are no universally followed text encoding standards. The method we have used in this paper for language and encoding identification uses pruned character n-grams, alone as well augmented with word n-grams. This method seems to give results comparable to other methods.

32 citations

Journal ArticleDOI
TL;DR: The proposed method of frame synchronization and frequency offset estimation is applied to the downlink synchronization in OFDM mode of wireless metropolitan area network (WMAN) standard IEEE 802.16-2004, and its performance is studied through simulations.
Abstract: Orthogonal frequency division multiplexing (OFDM) is a parallel transmission scheme for transmitting data at very high rates over time dispersive radio channels. In an OFDM system, frame synchronization and frequency offset estimation are extremely important for maintaining orthogonality among the subcarriers. In this paper, for a preamble having two identical halves in time, a timing metric is proposed for OFDM frame synchronization. The timing metric is analyzed and its mean values at the preamble boundary and in its neighborhood are evaluated, for AWGN and for frequency selective channels with specified mean power profile of the channel taps, and the variance expression is derived for AWGN case. Since the derivation of the variance expression for frequency selective channel case is tedious, we used simulations to estimate the same. Based on the theoretical value of the mean and estimate of the variance, we suggest a threshold for detection of the preamble boundary and evaluating the probability of false and correct detections. We also suggest a method for a threshold selection and the preamble boundary detection in practical applications. A simple and computationally efficient method for estimating fractional and integer frequency offset, using the same preamble, is also described. Simulations are used to corroborate the results of the analysis. The proposed method of frame synchronization and frequency offset estimation is applied to the downlink synchronization in OFDM mode of wireless metropolitan area network (WMAN) standard IEEE 802.16-2004, and its performance is studied through simulations.

31 citations

Proceedings ArticleDOI
25 Mar 2012
TL;DR: Results from the project entitled “New Parameterization for Emotional Speech Synthesis” held at the Summer 2011 JHU CLSP workshop are described, which allows for natural sounding speech but also allows for stylistically varying speech.
Abstract: This paper describes some of the results from the project entitled “New Parameterization for Emotional Speech Synthesis” held at the Summer 2011 JHU CLSP workshop. We describe experiments on how to use articulatory features as a meaningful intermediate representation for speech synthesis. This parameterization not only allows us to reproduce natural sounding speech but also allows us to generate stylistically varying speech.

31 citations

Proceedings ArticleDOI
28 Jun 2011
TL;DR: An efficient method to rank the research papers from various fields of research published in various conferences over the years using a modified version of the PageRank algorithm, which takes into account the time factor to reduce the bias against the recent papers.
Abstract: In this paper we propose an efficient method to rank the research papers from various fields of research published in various conferences over the years. This ranking method is based on citation network. The importance of a research paper is captured well by the peer vote, which in this case is the research paper being cited in other research papers. Using a modified version of the PageRank algorithm, we rank the research papers, assigning each of them an authoritative score. Using the scores of the research papers calculated by above mentioned method, we formulate scores for conferences and authors and rank them as well. We have introduced a new metric in the algorithm which takes into account the time factor in ranking the research papers to reduce the bias against the recent papers which get less time for being studied and consequently cited by the researchers as compared to the older papers. Often a researcher is more interested in finding the top conferences in a particular year rather than the overall conference ranking. Considering the year of publication of the papers, in addition to the paper scores we also calculated the year-wise score of each conference by slight improvisation of the above mentioned algorithm.

31 citations


Authors

Showing all 2066 results

NameH-indexPapersCitations
Ravi Shankar6667219326
Joakim Nivre6129517203
Aravind K. Joshi5924916417
Ashok Kumar Das562789166
Malcolm F. White5517210762
B. Yegnanarayana5434012861
Ram Bilas Pachori481828140
C. V. Jawahar454799582
Saurabh Garg402066738
Himanshu Thapliyal362013992
Monika Sharma362384412
Ponnurangam Kumaraguru332696849
Abhijit Mitra332407795
Ramanathan Sowdhamini332564458
Helmut Schiessel321173527
Network Information
Related Institutions (5)
Microsoft
86.9K papers, 4.1M citations

90% related

Facebook
10.9K papers, 570.1K citations

89% related

Google
39.8K papers, 2.1M citations

89% related

Carnegie Mellon University
104.3K papers, 5.9M citations

87% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202310
202229
2021373
2020440
2019367
2018364