<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"><channel><title>Amrita Tifac Core Cyber Security - RSS Feeds.</title><link>http://www.amrita.edu/ccs/rss/feeds.xml</link><description>Latest News and Events from TIFAC Core Cyber Security.</description><language>en-us</language><copyright>Copyright 2007 Cyber Security</copyright><managingEditor>Amrita</managingEditor><webMaster>webmaster@amrita.edu</webMaster><pubDate>Fri, 02 Feb 2007 05:14:18 GMT</pubDate><lastBuildDate>Fri, 02 Feb 2007 05:00:33 GMT</lastBuildDate><item><title>Admission</title><link>http://www.amrita.edu/ccs/admissions/courseadmi.htm</link><description>M TECH in Cyber Security Course details.</description><author>CyberSecurity WebMaster</author><category>Academics</category><guid isPermaLink="false">{7a375201-9d49-c0c8-b016-57f69236134}</guid><pubDate>Fri, 02 Feb 2007 05:00:33 GMT</pubDate></item><item><title>Implementation of an ISP-hosted nearest neighbor selection Web Server.</title><link>http://www.amrita.edu/ccs/research/index.htm#link17</link><description>The drawbacks associated with P2P systems can be solved by a service which is termed ‘Oracle’; it is a service which is hosted by the ISP on a Web Server known publicly and it helps in selecting the nearest neighbors. This service gets a list of IP addresses of possible neighbors from the P2P node and sorts it out according to AS, geographical distance, etc.
</description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{e732a3a-3706-fd81-5673-347cfa78faa6}</guid><pubDate>Fri, 02 Feb 2007 04:48:45 GMT</pubDate></item><item><title>A Reliable and Robust nearest Neighbor Selection Scheme for Ad hoc Networks Using Zone Routing Concept.</title><link>http://www.amrita.edu/ccs/research/index.htm#link16</link><description>Our ambition is to utilize the Zone Routing Protocol concept from ZRP [1, 4] and adapt it to find nearest neighbor, which proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. </description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{564b1145-5a56-1fae-7763-fc4d731a3f7}</guid><pubDate>Fri, 02 Feb 2007 04:48:42 GMT</pubDate></item><item><title>Deployment and Experimentation of Nearest Neighbor Discovery Scheme (The Oracle) for distributed systems in PlanetLab</title><link>http://www.amrita.edu/ccs/research/index.htm#link15</link><description>This project is about implementing the Nearest Neighbor discovery scheme known as the “Oracle” which is a central server hosted at a well known IP address within an ISP. This will be implemented in the Internet wide test bed, and deployment platform known as PlanetLab. The project aims at deploying and testing this proposed scheme for the most popular file sharing (P2P) protocol on the Internet known as Bit Torrent. </description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{cdc34d-b205-9c04-304f-a90a6b704024}</guid><pubDate>Fri, 02 Feb 2007 04:48:40 GMT</pubDate></item><item><title>Scheme for combining pollution in Peer-to-Peer Systems </title><link>http://www.amrita.edu/ccs/research/index.htm#link14</link><description> There are many trust based schemes which have been developed for combating pollution. Based on these schemes, a peer downloads content from another peer, only if it trusts that peer. We propose to develop a new scheme which combines ideas from these existing models ( eg. XRep protocol) along with a measure of nearness of the peer (which will be provided by the ISP hosted Oracle System).</description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{64f57653-f2f-1364-a2b2-17acf426815d}</guid><pubDate>Fri, 02 Feb 2007 04:48:35 GMT</pubDate></item><item><title>Network Intrusion Detection and Prevention System</title><link>http://www.amrita.edu/ccs/research/index.htm#link13</link><description>This project is aimed to develop IDS/IPS system to work with Cisco Routers and Switches to detect intrusive activity and block such connectivity based on some signatures. Dynamic Security solutions are needed to protect networks today from Hackers and unwanted access. Intrusion Detection / Prevention is one of such most recent dynamic technology to secure networks which handle vital data.</description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{739792dc-86ec-4c0a-1f5b-80622575c3a2}</guid><pubDate>Fri, 02 Feb 2007 04:48:33 GMT</pubDate></item><item><title>Dual Watermarking On Still Images</title><link>http://www.amrita.edu/ccs/research/index.htm#link12</link><description>Dual watermark is a combination of a visible watermark and an invisible watermark. We present an approach for still image watermarking in which the watermark embedding process incorporates a model of the human visual system (HVS) and at the same time it should be robust to various possible attacks.</description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{bfa9e02a-3378-704a-f421-31792dddeba}</guid><pubDate>Fri, 02 Feb 2007 04:48:31 GMT</pubDate></item><item><title>Hardware Implementation of Montgomery multiplication</title><link>http://www.amrita.edu/ccs/research/index.htm#link11</link><description>Security requirements in present day communications are achieved through efficient algorithms such as RSA encryption. The fundamental operation of such algorithms is modular exponentiation which involves repeated modular multiplications. However, the high bit-length operations, required to provide adequate security, challenges the design of an efficient hardware.</description><author>CyberSecurity WebMaster</author><category>Student Projects</category><guid isPermaLink="false">{f5af4c9-1980-5d1e-4277-12b88143e359}</guid><pubDate>Fri, 02 Feb 2007 04:48:29 GMT</pubDate></item><item><title>Fast implementation of finite field Arithmetic for Elliptic curve Cryptography</title><link>http://www.amrita.edu/ccs/research/index.htm#upcoming</link><description>In this project we attempt to address various VLSI design related issues with a special focus on low area and low power implementation of the finite filed arithmetic. We intend to select a few algorithms with the potential for application in the area. Their realization with FGPA will be studied, analyzed and compared. </description><author>CyberSecurity WebMaster</author><category>Sponsored Projects </category><guid isPermaLink="false">{1e45f4a2-f9ef-8962-f8dd-39c1ba95ecb4}</guid><pubDate>Fri, 02 Feb 2007 04:48:27 GMT</pubDate></item><item><title>Analysis of Word based Stream Ciphers</title><link>http://www.amrita.edu/ccs/research/index.htm#link4</link><description>For the assessment of the quality of multisequence for word based stream ciphers, we need to know the behaviour of joint linear complexity profile of random multisequence over a finite field. The joint linear complexity and joint linear complexity profile of multisequences have received a lot of attention recently. In this project we propose to study further the properties of multisequences in the same line.</description><author>CyberSecurity WebMaster</author><category>Sponsored Projects </category><guid isPermaLink="false">{96bb1a58-dffb-22ff-76d5-39245f1e3e1d}</guid><pubDate>Fri, 02 Feb 2007 04:48:25 GMT</pubDate></item><item><title>Development of Fast and Effective Cryptographic Techniques</title><link>http://www.amrita.edu/ccs/research/index.htm#link3</link><description>A major issue in the security analysis of stream ciphers is the quality assessment of key streams. In other words, we need to know how close the key stream is to true randomness. Key stream guaranteeing an adequate security level must meet various requirements such as possessing good statistical randomness properties and a high complexity (in a suitable sense), so that the key stream cannot be inferred from a small portion of its terms.</description><author>CyberSecurity WebMaster</author><category>Sponsored Projects </category><guid isPermaLink="false">{3c3e60c7-609-6a7c-afed-67d9a220877d}</guid><pubDate>Fri, 02 Feb 2007 04:48:22 GMT</pubDate></item><item><title>Design and analysis of cryptographically secure pseudorandom number Generators </title><link>http://www.amrita.edu/ccs/research/index.htm#link2</link><description>A cryptographically secure pseudorandom number generator is a pseudorandom number generator with properties that makes it suitable for use in cryptography. CSPRNGs are designed explicitly to resist determined mathematical reverse engineering. In this project, we are studying the designs of PRNGs based on number theory. </description><author>CyberSecurity WebMaster</author><category>Sponsored Projects </category><guid isPermaLink="false">{6076ba9-1842-2bee-44bb-220d58aafb6}</guid><pubDate>Fri, 02 Feb 2007 04:48:20 GMT</pubDate></item><item><title>Indo-German Joint project titled “Next Generation Secure Technology for Globally Distributed Enterprises”</title><link>http://www.amrita.edu/ccs/research/index.htm#link1</link><description>Routing assumes a complex dimension in the absence of hierarchy in the network. The limits of the complexity reached in the case of peer-to–peer communications. However, the same can be turned to an advantage for the application we have in mind. Taking the specific example of the Business Process Outsourcing industry, we aim to improve its performance and security.</description><author>CyberSecurity WebMaster</author><category>Sponsored Projects </category><guid isPermaLink="false">{5eb88e5e-1bf9-744e-48ec-56fd81bdc3ea}</guid><pubDate>Fri, 02 Feb 2007 04:48:16 GMT</pubDate></item><item><title>Dr. Shri Kant, Scientist, DRDO </title><description>Cryptography and Secure Communication on Aug 2006.</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{84d1aebc-72c2-79d6-e8b0-cfd682cee239}</guid><pubDate>Fri, 02 Feb 2007 04:27:07 GMT</pubDate></item><item><title>Dr. R. Sridhar, University of Buffalo</title><description>Advanced Networking( 6 weeks course ) on Aug 2006
</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{17c51e13-604d-c776-dedb-b82d7b1cdd64}</guid><pubDate>Fri, 02 Feb 2007 04:27:05 GMT</pubDate></item><item><title>Dr. S. V. Raghavan, IIT, Madras </title><description>Research Issues in National Information Infrastructure Protection on Sept 2006.</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{17eb8323-d8d9-7a0a-a579-36086a6620a}</guid><pubDate>Fri, 02 Feb 2007 04:27:02 GMT</pubDate></item><item><title>Dr. V. P. Gulati, TCS , Hyderabad </title><description>Challenges for Banking and Financial services on Sept 2006</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{8bea6de8-88ec-dc2-3a9a-1472c118cc3c}</guid><pubDate>Fri, 02 Feb 2007 04:27:00 GMT</pubDate></item><item><title>Dr. B. S. D. Prasada Rao, National Technical Research Organization</title><description>Cryptanalysis-An Overview on Sep 2006</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{b937322e-c0d1-6fcb-5ee7-3cf19359265a}</guid><pubDate>Fri, 02 Feb 2007 04:26:57 GMT</pubDate></item><item><title>Dr. Bharat Jayaraman, University of Buffalo </title><description>Language Based Security on Nov 2006.</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{252dfc8d-1152-e5c8-8b4d-6019738f77fd}</guid><pubDate>Fri, 02 Feb 2007 04:26:55 GMT</pubDate></item><item><title>Mr. Richard Hartmann, Technical University of Munich</title><description>Lecture series on VoIP Detection on Dec 2006.</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{db395705-b233-3c1d-c645-59727be89a69}</guid><pubDate>Fri, 02 Feb 2007 04:26:52 GMT</pubDate></item><item><title>Lecture Series -  Mr. Vinay Aggarwal, Technical University of Berlin</title><description>Lecture series on Peer-to-Peer Systems on Jan 2007</description><author>CyberSecurity WebMaster</author><category>Lecture </category><guid isPermaLink="false">{46112239-2802-8f16-e8a2-7886bb99606d}</guid><pubDate>Fri, 02 Feb 2007 04:26:48 GMT</pubDate></item><item><title>National workshop on Cryptology, Coimbatore Campus.</title><description>National workshop on Cryptology, Coimbatore Campus on Sept 2007.</description><author>CyberSecurity WebMaster</author><category>Events</category><guid isPermaLink="false">{12dfd254-101a-6dfc-a8e9-5e0fceea509d}</guid><pubDate>Fri, 02 Feb 2007 04:26:41 GMT</pubDate></item><item><title>Joint Indo-German Workshop, Coimbatore Campus.</title><description>Joint Indo-German Workshop, Coimbatore Campus on June 2007.</description><author>CyberSecurity WebMaster</author><category>Events</category><guid isPermaLink="false">{64c2924b-74d7-cb49-db2f-8978d68942f1}</guid><pubDate>Fri, 02 Feb 2007 04:26:38 GMT</pubDate></item><item><title> Two day Conference on Cyber Security, Bangalore Campus.</title><link>http://www.amrita.edu/ccs/newsevents/news.html</link><description> Two day Conference on Cyber Security, Bangalore Campus on March 2007:
</description><author>CyberSecurity WebMaster </author><category>Events</category><guid isPermaLink="false">{d581fe8c-39fc-570b-421-5c4ca90770f9}</guid><pubDate>Fri, 02 Feb 2007 04:26:34 GMT</pubDate></item><item><title>TCS sponsered Faculty Developement Program.</title><link>http://www.amrita.edu/ccs/newsevents/news.htm</link><description>TCS is conducting faculty development program on Cyber Security date: Feb 2007.</description><author>CyberSecurity WebMaster</author><category>Events</category><guid isPermaLink="false">{83efd4fc-e3a8-1506-ede6-e39d6402b83a}</guid><pubDate>Fri, 02 Feb 2007 04:26:15 GMT</pubDate></item></channel></rss>