We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Sprout, continuously tries new routes to the destination. Routes are probabilistically generated, with complete disregard for performance metrics. This makes Sprout uniquely resilient to attack: it cannot be tempted by shortcuts. In order to avoid compromised routes, and to ensure good overall performance, the quality of each active route is monitored by means of signed end-to-end acknowledgments. The amount of traffic sent on each route is adjusted accordingly. Sprout effectively mitigates the vast majority of known routing layer attacks, even when under assault from a large number of colluding attackers. Experiments on our 31-node testbed demonstrates the real-world performance of Sprout in terms of packet delivery ratio, round-trip times and TCP throughput. Our security analysis and simulation results show that Sprout is able to quickly find working paths in networks of hundreds of nodes and dozens or more attackers. For example, in a network of 200 nodes and an astounding 64 attackers, Sprout, on average, found a successful route within less than 10 attempts. Yet, in benign settings, Sprout provides TCP throughput within 15% of the shortest path throughput Overall, Sprout consistently delivers high, reliable performance in benign as well as hostile environments.

/pdf/routing-amid-colluding-attackers-1bhh9s0zz5.pdf

Routing amid Colluding Attackers

A new experience for teaching Cryptography to engineering students is shown. The aim is to give them a better understanding of secure and cryptographic algorithms by using Maple software, in a graduate-level course. In this paper we discuss how to structure, define, and implement a web-based course as a part of the traditional classes, according to the convergence of the European Higher Education Project. The proposed course facilitates the use of new Information and Communication Technologies.

/pdf/cryptography-adapted-to-the-new-european-area-of-higher-5a3liadt2r.pdf

Cryptography Adapted to the New European Area of Higher Education

In this paper, a new security system in electronic commerce based on PKI and extended by digital fingerprinting and digital watermarking is proposed. The security system can effective protect the data security of electronic commerce. The whole security system integrates three partspsila strong point and forms its own good qualities, so it has very high level security and can suit for the complicated applications of electronic commerce.

Applications of digital fingerprinting and digital watermarking for E-commerce security mechanism

Information technologies plays a major role in our information society, thus it is important to protect it against many kinds of threats or attacks which may lead to lose of money, or lose of reputation and thus destroy businesses. The El-Gamal public key cryptosystem over elliptic curves is often used in modern computer and communication technologies; it enables secure communication over public unsecure channels. This paper introduce the security of the El-Gamal cryptosystem based on elliptic curves, it suggests a modification that can make the cryptosystem more immune against some attacks. This modification solves a weakness in the basic El-Gamal scheme by including the identity parameter of the sender in the encryption process, thus making the cryptosystem immune against man-in-the-middle attack and known k parameter attack. The modification described in this paper can in analogy be implemented on the El-Gamal cryptosystem over finite fields. Other important benefit is that the El-Gamal cryptosystem described here can easily be implemented and is very suitable on small and limited devices (e.g. smart cards) due the use of elliptic curves. This paper also briefly describe some attacks on the El-Gamal cryptosystem and the suitable choice of El-Gamal cryptosystem parameter settings to avoid such attacks.

/pdf/authenticated-and-secure-el-gamal-cryptosystem-over-elliptic-3xes7ume21.pdf

AUTHENTICATED AND SECURE El-GAMAL CRYPTOSYSTEM OVER ELLIPTIC CURVES

Elliptic curves have been extensively studied for over hundred years, originally pursued mainly for aesthetic reasons; elliptic curves have recently become a tool in several important applied areas, including coding theory, pseudo-random bit generation and number theory algorithms. Actually ECC is an alternative approach for traditional public key cryptography like RSA, DSA and DH. It provides the highest strength-per-bit of any cryptosystem known today with smaller key size resulting in faster computations, lower power assumption and memory. Another advantage is that authentication protocols based on ECC are secure enough even if a small key size is used. It also provides a methodology for obtaining high speed, efficient and scalable implementations of protocols for authentication and key agreement. The present paper consists of an introduction to elliptic curves and an authentication protocol based on ECC and zero knowledge property. The protocol is developed for group communication where every person of the group has a secret information and the communication starts when all this information is put together. If one person is not online, the others cannot communicate.

A Secure And Efficient Authentication Protocol Based On Elliptic Curve Diffie-Hellman Algorithm And Zero Knowledge Property

Recently elliptic curve public-key cryptosystem become a research focus in the field of compute information security. Compared with traditional public-key cryptosystem,elliptic curve public-key cryptosystem is very popular in security. It will take the place of traditional public-key cryptosystem, such as RSA,DSS etc. Firstly, the article introduce elliptic curve public-key cryptosystem and its relative knowledge. Then the study compare it with the traditional public-key cryptosystem. Finally, the thesis give the research hotspot and applicable foreground of elliptic curve public-key cryptosystem.

LI Wei-min

Papers

Elliptic Curve Public-key Cryptosystem