Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 17 of 17
Full-Text Articles in Entire DC Network
Randomized Algorithms For Resource Allocation In Device To Device Communication., Subhankar Ghosal Dr.
Randomized Algorithms For Resource Allocation In Device To Device Communication., Subhankar Ghosal Dr.
Doctoral Theses
In device to device (D2D) communication, two users residing in close proximity can directly communicate between them, through a common channel, without the need of a base station. A pair of D2D users forms a link and a channel needs to be allocated to it. The interference relationship among the active links at time t is modelled as an interference graph g(t). To establish interference-free communication, we have to assign a channel vector C(t) and a power vector corresponding to the active links such that the required signal to interference plus noise ratio (SINR) is satisfied for each link. Since …
Provable Security Of Symmetric-Key Cryptographic Schemes., Ashwin Jha Dr.
Provable Security Of Symmetric-Key Cryptographic Schemes., Ashwin Jha Dr.
Doctoral Theses
In this thesis, we provide quantitative and/or qualitative improvements in the provable security of several symmetric-key schemes, encompassing major information security goals, viz. data authentication, encryption, and authenticated encryption.AUTHENTICATION AND INTEGRITY: Among authentication schemes, we analyze the CBC-MAC family and counter-based MACs (XMACC, XMACR, PCS, LightMAC etc.), referred as the XMAC family. First, we revisit the security proofs for CBC-MAC and EMAC, and identify a critical flaw in the state-of-the-art results. We revise the security proofs and obtain significantly better bounds in case of EMAC, ECBC and FCBC. Second, we study the security of CBC-MAC family, when the underlying primitive …
Tree-Based Symmetric Key Broadcast Encryption., Sanjay Bhattacherjee Dr.
Tree-Based Symmetric Key Broadcast Encryption., Sanjay Bhattacherjee Dr.
Doctoral Theses
In symmetric key cryptography, it is assumed that there are two parties Alice and Bob and there is an insecure communication channel between them as shown in Figure 1.1. A cryptographic system can be used to achieve secure communication between these two parties. This cryptographic system assumes that there is a secret K called the key that is known only to Alice and Bob and no one else. The message to be communicated is called the plaintext and is denoted by M. The cryptographic system has an encryption algorithm Enc(M, K) used by the sender that takes as input a …
Some Results On Analysis And Implementation Of Hc-128 Stream Cipher., Shashwat Raizada Dr.
Some Results On Analysis And Implementation Of Hc-128 Stream Cipher., Shashwat Raizada Dr.
Doctoral Theses
The HC-128 stream cipher is a successful entrant in the eStream candidate list (software profile) and is the lighter variant of HC-256 stream cipher. Apart from the analysis by the designer of the cipher (Hongjun Wu) to conjecture the security of this cipher, there are only a few other observations on this cipher despite being the focus of researchers during the three phases of eStream evaluation and later efforts in the community. Till date none of the security claims in favor of HC-128 by the designer could be broken. One may expect HC-128 stream cipher to be popular in commercial …
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Doctoral Theses
In this thesis, we study the generic construction of some cryptographic primitives over various public key paradigms like traditional Public Key Cryptosystems and Identity Based Cryptosystems. It can be broadly divided into two categories1. Generic construction of some highly secure cryptographic primitives from less secure cryptographic primitives, and2. Generic construction of some complex cryptographic primitives from basic cryptographic primitives. Mathematical tools provide a way to achieve cryptographic functionality like confidentiality, authentication, data-integrity, non-repudiation etc., but in the case of complex cryptographic functionality like achieving confidentiality and authentication at the same time or confidentiality, authentication and non-repudiation at the same time …
Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr.
Coverage And Detection In Wireless Sensor Networks., Mrinal Nandi Dr.
Doctoral Theses
A Wireless Sensor Networks (WSNs), which are two or three dimensional systems, usually consist of a large number of small sensors equipped with some processing circuit, and a wireless transceiver. The sensors have small size, low battery capacity, non-renewable power supply, small processing power, limited buffer capacity and low-power radio. They may measure distance, direction, speed, humidity, wind speed, soil makeup, temperature, chemicals, light, and various other parameters. The sensors are autonomous devices with integrated sensing, processing, and communication capabilities.In this thesis, we consider ‘coverage problem’ and ‘detection problem’ in Wireless Sensor Networks (WSNs) in grid as well as in …
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Doctoral Theses
In this thesis, we propose some new results in Cryptanalysis of RSA and related Factorization problems. Till date, the best known algorithm to solve the Integer Factorization problem is the Number Field Sieve, which has a runtime greater than exp(log1/3 N) for factoring an integer N. However, if one obtains certain information about the RSA parameters, there are algorithms which can factor the RSA modulus N = pq quite efficiently. The intention of this thesis is to identify such weaknesses of the RSA cryptosystem and its variants. Further we study results related to factorization.In Africacrypt 2008, Nitaj presented a class …
Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.
Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.
Doctoral Theses
Due to the extraordinary growth of demand in mobile communication facility, design of efficient systems for providing specialized services has become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: single-hop and multi-hop. The single-hop model [110] is based on the cellular network, and it provides one-hop wireless connectivity between the host and the static nodes known as base stations. single-hop networks rely on a fixed backbone infrastructure that interconnects all the base stations by high speed wired links. On the other hand, the multi-hop model requires neither fixed wired infrastructure nor …
Applications Of Combinatorial Designs In Key Pre-Distribution In Sensor Networks., Dibyendu Chakrabarti Dr.
Applications Of Combinatorial Designs In Key Pre-Distribution In Sensor Networks., Dibyendu Chakrabarti Dr.
Doctoral Theses
Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Some improved techniques over the existing schemes (employing combinatorial designs) have been proposed in this thesis and detailed mathematical analysis of the schemes has been presented. At first, combinatorial design followed by randomized merging strategy is applied to key pre-distribution in sensor nodes. Our main target is to get more than one pair of common keys between any pair of nodes to provide a robust network in terms of security under adversarial conditions where some nodes may get compromised. A transversal design is used to construct a …
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Algorithms For Some Geometric Facility Location And Path Planning Problems., Sasanka Roy Dr.
Doctoral Theses
The facility location problem is a resource allocation problem that mainly deals with adequate placement of various types of facilities to serve a distributed set of demands satisfying the nature of interactions between the demands and facilities and optimizing the cost of placing/maintaining the facilities and the quality of services.The facility location problem is well-studied in the Operations Research literature and recently has received a lot of attention in the Computer Science community. For a company, the facility location problem provides more strategic decisions than just giving importance to locate the lowest cost space for storing its products. While identifying …
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Doctoral Theses
No abstract provided.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.
Doctoral Theses
This thesis describes research that I conducted during the course of my Ph.D. study at Indian Statistical Institute (ISI), Kolkata. I hope that this work is of use and will be carried on.I would like to begin by thanking my supervisor, Prof. Rana Barua for his support and endless patience. He has provided me background in Cryptography, Combinatorics and Theory of Automata during the period 2000-2002 of my course work of M.Tech in Computer Science at Indian Statistical Institute. I really appreciate his extraordinary patience in reading my numerous inferior drafts, for listening and analyzing all my ideas, forcing me …
Essays In Mechanism Design., Suresh Mutuswami Dr.
Essays In Mechanism Design., Suresh Mutuswami Dr.
Doctoral Theses
The theory of implementation or mechanism design had its origins in the debates in the 1930s between Hayek, Lange and Lerner on the informational efficiency of the market economy. However, it was the work of Hurwicz in the 1950s and the 1960s which formalised the insights of Hayek, Lange and Lerner and paved the way for the body of work that followed his pioneering effort.In addition to the considerable theoretical literature on mechanism de- sign'. there also exists a body of literature which uses the mechanism design approach to address specific problems. Some examples of work in this vein include …
New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr.
New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr.
Doctoral Theses
Many real-life applications in the areas of signal processing, image processing, etc., require a large amount of fast computations to be performed. Although high speed powerful processors are currently available due to the phenomenal advances in VLSI technology, the increasing demand for massive real-time computations can not be met just by a uniprocessor system. One way of achieving the goal of fast computation is through parallel processing. In parallel processing, a problem is broken into several subproblems, which are distributed among different processors so that each of the processors can perform its task simultaneously. Main areas of recent research in …
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Doctoral Theses
Many real-life applications such as image processing, weather forecasting, digital signal processing, etc., require large amount of computations. By distributing the task among several processors, one can appreciably reduce the computation time. To solve complex problems, several computer architectures using multiple processors have been introduced. Recent developments in IC technology have made it economically feasible to construct multiple processor systems consisting of hundreds or thousands of processors.There are two types of multiprocessor systems (PS87). One is tightly coupled, where the processors share a common clock and/or memory. The other is loosely coupled, where each processor runs independently with a local …
Studies On Design, Routing And Fault Tolerance Of Interconnection Network., Krishnendu Mukhopadhyay Dr.
Studies On Design, Routing And Fault Tolerance Of Interconnection Network., Krishnendu Mukhopadhyay Dr.
Doctoral Theses
A recent trend in computing is to distribute the computations among a set of processing elements. There are two basic appronches to this - one is to build a loosely-coupled system and the other is to form a tightly-coupled system [PS85].In a loosely-coupled system, the processors do not share common memory or a common clock; but sharing of important resources like data files, softwares, special hardware components etc., is possible without duplicating the resources themselves. The processing nodes may even be geographicully separated from each other and are connected through databuses, telephone/radio links, satellite, etc. Such loosely- coupled systems are …
On Lexical And Syntactic Processing Of Bangla Language By Computer., Probal Sengupta Dr.
On Lexical And Syntactic Processing Of Bangla Language By Computer., Probal Sengupta Dr.
Doctoral Theses
A distinctive intelligent trait of human beings is the ability to carry out meaningful communication through language. The communication may be direct as in spoken conversation or indirect as in written form, through the audio-visual media, etc. Linguistic ability in humans have fascinated scholars ever since man first learnt to use language. Linguistics, the branch of study involved in studying the nature of human linguistic communication, is perhaps as old as language itself. The invention of the computer added a new dimension to linguistics. Making the computer emu- late human linguistic behaviour was taken up as a challenge by computer …