<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Year-2012</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/65</link>
<description/>
<pubDate>Sat, 04 Apr 2026 07:18:42 GMT</pubDate>
<dc:date>2026-04-04T07:18:42Z</dc:date>
<item>
<title>PhishAri : automatic realtime phishing detection on Twitter</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/110</link>
<description>PhishAri : automatic realtime phishing detection on Twitter
Aggarwal, Anupama; Kumaraguru, Ponnurangam (Advisor)
With the advent of online social media, phishers have started using social networks like Twitter,&#13;
Facebook, and Foursquare to spread phishing scams. Twitter is an immensely popular micro-&#13;
blogging network where people post short messages of 140 characters called tweets. It has over&#13;
100 million active users who post about 200 million tweets everyday. Phishers have started using&#13;
Twitter as a medium to spread phishing because of this vast information dissemination. Due&#13;
to constraints of limited text space in social systems like Twitter, phishers have begun to use&#13;
URL shortener services. In this study, we  rst provide an overview of phishing attacks for this&#13;
new scenario. One of our main conclusions was that phishers use URL shorteners not only for&#13;
reducing space but also to hide their identity. We also observed that social media websites like&#13;
Facebook, Habbo, Orkut are competing with e-commerce services like PayPal, eBay in terms of&#13;
tra c and focus of phishers. 1 Further, it is di cult to detect phishing on Twitter unlike emails&#13;
because of the quick spread of phishing links in the network, short size of the content, and use&#13;
of URL obfuscation to shorten the URL. We developed a technique, PhishAri, 2 which detects&#13;
phishing on Twitter in realtime. We use Twitter speci c features along with URL features to&#13;
detect whether a tweet posted with a URL is phishing or not. Some of the Twitter speci c&#13;
features we used are tweet content and its characteristics like length, hashtags, and mentions.&#13;
Other Twitter features used are the characteristics of the Twitter user posting the tweet such&#13;
as age of the account, number of tweets, and the follower-followee ratio. These TTwitterwitter&#13;
speci c features coupled with URL based features proved to be a strong mechanism to detect&#13;
phishing tweets. We used machine learning classi cation techniques and detected phishing tweets&#13;
with an accuracy of 92.52%. We deployed our system for end-users by providing an easy to use&#13;
Chrome browser extension. The extension works in realtime and classi es a tweet as phishing or&#13;
safe. In this research, we showed that we were able to detect phishing tweets at zero hour with&#13;
high accuracy which is much faster than public blacklists and as well as Twitter's own defense&#13;
mechanism to detect malicious content. We also performed a quick user evaluation of PhishAri&#13;
in a laboratory study to evaluate the usability and e ectiveness of PhishAri and showed that&#13;
users like and  nd it convenient to use PhishAri in real-world. Currently, there are 74 active&#13;
users of PhishAri chrome extension. To the best of our knowledge, this is the  rst realtime,&#13;
comprehensive and usable system to detect phishing on Twitter.
</description>
<pubDate>Fri, 11 Oct 2013 11:58:11 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/110</guid>
<dc:date>2013-10-11T11:58:11Z</dc:date>
</item>
<item>
<title>WhACKY! - what anyone could know about you from twitter</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/77</link>
<description>WhACKY! - what anyone could know about you from twitter
Correa, Denzil; Sureka, Ashish (Advisor)
Twitter is a popular micro-blogging website which allows users to post 140-character limit mes-&#13;
sages called tweets. Twitter users (also called Twitterers) post activity messages about their&#13;
daily lives, opinions on current events and news, and even have conversations with other users.&#13;
In addition, Twitterers also share various other information like photographs, videos and visited&#13;
locations hosted on other external services like Flickr, YouTube and Foursquare. Therefore,&#13;
tweets contain variety of information obtained from a combination of multiple sources. We&#13;
demonstrate a cheap and elegant solution { WhACKY! { to harness this multi-source informa-&#13;
tion to link Twitter pro les across other external services. In particular, we exploit activity feed&#13;
sharing patterns to map Twitter pro les to their corresponding external service accounts using&#13;
publicly available APIs. We illustrate a proof-of-concept by mapping 69,496 Twitter pro les to&#13;
at least one of the  ve popular external services : Flickr (photo-sharing service), Foursquare&#13;
(location-based service), YouTube (video-sharing service), Facebook (a popular social network)&#13;
and LastFM (music-sharing service). We evaluate our solution against a commercial social iden-&#13;
tity mapping service { FlipTop { and demonstrate the e ciency of our approach. WhACKY!&#13;
guarantees that the mapped pro les are 100% true-positive and helps quantify the unintended&#13;
leakage of Personally Identi able Information (PII) attributes. During the process, WhACKY!&#13;
is also able to detect duplicate Twitter pro les connected to multiple external services.We de-&#13;
velop a web application based on WhACKY!1 for perusal by Twitterers which can help them&#13;
better understand unintended leakage of their PII.
</description>
<pubDate>Wed, 06 Feb 2013 10:35:23 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/77</guid>
<dc:date>2013-02-06T10:35:23Z</dc:date>
</item>
<item>
<title>Robust and traffic analysis resistant cloud file system</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/70</link>
<description>Robust and traffic analysis resistant cloud file system
Gupta, Madhvi; Nagaraja, Shishir (Advisor)
With improved technology, every user now generates huge amount of data that requires ever&#13;
increasing amount of space to store it. It is not economical for the users to purchase new storage&#13;
device every time. As a remedy to this problem di erent service provider o ers storage space&#13;
that can be utilized by the users. Cloud computing also provides a similar functionality to the&#13;
users for storing their data over the Internet. The invention of cloud computing has ful lled&#13;
the need for extra storage space but at the same time it has also lead to increased concerns&#13;
regarding security of data stored over the Internet.&#13;
The responsibility of the security of this huge amount of data lies with the service provider, but&#13;
there may arise a situation where user may not trust the service provider due to the sensitivity&#13;
of data. So there is a need of a technique which provide users a level of trust and security.&#13;
In Document security solution (DSSol), we have tried to deal with such a situation, where we&#13;
provide protection against adversary which can also be the service provider itself. We have used&#13;
the Steganographic  le system along with encryption to protect the document uploaded over&#13;
the Google Docs from any security breach. The design encrypts the data  les to be uploaded&#13;
and divides them in equal sized chunks which gets uploaded along with some additional dummy&#13;
chunks to the Goggle Docs. This provides unobservability, tra c analysis resistance and thereby&#13;
providing protection against attacks possible due to tra c analysis and usage patterns.
</description>
<pubDate>Wed, 17 Oct 2012 06:31:32 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/70</guid>
<dc:date>2012-10-17T06:31:32Z</dc:date>
</item>
<item>
<title>Rebound attachs on GRφSTL</title>
<link>http://repository.iiitd.edu.in/xmlui/handle/123456789/66</link>
<description>Rebound attachs on GRφSTL
Kochar, Komal; Sanadhya, Somitra Kumar (Advisor)
Cryptographic hash Functions are widely used for a wide range of applications such as au-&#13;
thentication of information, digital signatures and protection of pass-phrases. In the last&#13;
few years, the cryptanalysis of hash functions has gained much importance within the cryp-&#13;
tographic community. In 2004 a series of attacks by Wang et al. [19, 20] have exposed&#13;
security vulnerabilities in the design of the most widely deployed SHA-1 hash function. As&#13;
a result, the US National Institute for Standards and Technology (NIST) recommended the&#13;
replacement of SHA-1 by the SHA-2 hash function family and in 2008, they announced a&#13;
call for the design of a new SHA-3 hashing algorithm.&#13;
On October 31, 2008, the “SHA-3 competition”, organised by the National Institute of&#13;
Standards and Technology (NIST), was launched [17]. 64 algorithms were submitted, out&#13;
of which, 51 were accepted for the first round of the competition. On July 24, 2009, 14&#13;
candidates were chosen by NIST to advance to the second round of the competition. One&#13;
of the candidates accepted for the second round is called Grφstl [11], developed by Praveen&#13;
Gauravaram, Lars R. Knudsen and Krystian Matusiewicz. Grφstl further advanced to the&#13;
final round along with BLAKE [2], JH, Keccak [3], Skein [10] and became one of the top 5&#13;
proposals for SHA-3.&#13;
The report breifly specifies the Grφstl family of cryptographic hash algorithms, one of the&#13;
top 5 finalists of the SHA-3 hash function competition and a well known attack named&#13;
Rebound Attack on Grφstl. The rebound attack is a freedom degrees utilization technique&#13;
that was first proposed by Mendel et al. in [15] as an analysis of round-reduced Grφstl and&#13;
Whirlpool [18]. The main idea of the rebound attack is to use the available degrees of freedom&#13;
in a collision attack to effeciently bypass the low probability parts of a truncated differential&#13;
trail. The rebound attack consists of an inbound phase with a match-in-the-middle part to&#13;
exploit the available degrees of freedom, followed by a subsequent probabilistic outbound&#13;
phase. Report discusses available rebound attacks on reduced rounds of Grφstl-256.&#13;
The report first describes a simple method to utilize the available freedom degrees. The&#13;
original idea of rebound is then applied to reduced rounds of Grφstl- 256. Report describes&#13;
attack on 4 rounds of Grφstl-256. It further explains same rebound technique applied on 5&#13;
and 6 rounds Grφstl-256. The new technique Super Sbox Cryptanalysis [12] introduced by&#13;
Thomas Peyrin and Henri Gilbert is explained in the report alongwith its application on 7&#13;
rounds of Grφstl-256.
</description>
<pubDate>Wed, 25 Jul 2012 12:22:05 GMT</pubDate>
<guid isPermaLink="false">http://repository.iiitd.edu.in/xmlui/handle/123456789/66</guid>
<dc:date>2012-07-25T12:22:05Z</dc:date>
</item>
</channel>
</rss>
