Results 1  10
of
11
Cryptographic Solution to a Problem of Access Control in a Hierarchical
 ACM Transaction on Computer System
, 1983
"... A scheme based on cryptography is proposed for access control in a system where hierarchy is represented by a partially ordered set (or poset). Straightforward implementation f the scheme requires users highly placed in the hierarchy to store a large number of cryptographic keys. A timeversusstora ..."
Abstract

Cited by 105 (1 self)
 Add to MetaCart
(Show Context)
A scheme based on cryptography is proposed for access control in a system where hierarchy is represented by a partially ordered set (or poset). Straightforward implementation f the scheme requires users highly placed in the hierarchy to store a large number of cryptographic keys. A timeversusstorage tradeoff is then described for addressing this key management problem.
Menudriven systems
 In: The Encyclopedia of Microcomputers
, 1984
"... The cost of delivering financial services in both developing and developed countries has always been an aspect of concern to financial institutions. Financial institutions incur exorbitant operating costs in the course of providing services to their clients. These costs definitely in the end trickle ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
The cost of delivering financial services in both developing and developed countries has always been an aspect of concern to financial institutions. Financial institutions incur exorbitant operating costs in the course of providing services to their clients. These costs definitely in the end trickle down to the bank client and translate into a draw back to the number of clients an institution attracts. On top of this the inconvenience to the client in terms of time delays and access is also a fundamental issue. While developed countries have a developed Internet infrastructure that has expedited development and pervasiveness of electronic banking services, developing countries have low access to the Internet. Take for example in Uganda internet connectivity is at level 1.5 given a scale of 0 to 4 according to Minges et al (2001) [18]. Thus with the diffusion of mobile telephony taking the case of Uganda cellular subscribers have increased from 3000 in 1996 to over 2.3 million by 2006. Today researchers are working at developing more low cost and secure
Design of a Robust Cryptosystem Algorithm for NonInvertible Matrices Based on Hill Cipher
 International Journal of Computer Science and Network Security, (2009): Vol
"... Information security is an important issue. Hill Cipher is one of the most famous symmetric cryptosystem that can be used to protect information from unauthorized access.Hill cipher is a polygraph substitution cipher based on linear algebra. Invented by Lester S. Hill in 1929, it was the first polyg ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Information security is an important issue. Hill Cipher is one of the most famous symmetric cryptosystem that can be used to protect information from unauthorized access.Hill cipher is a polygraph substitution cipher based on linear algebra. Invented by Lester S. Hill in 1929, it was the first polygraph cipher which was practical to operate on more than three symbols at once, Hill Cipher has many advantages in data encryption. First, it is resistant to the frequency letter analysis. It's also very simple since it uses matrix multiplication. Finally, it has high speed and high throughput [1,13,14], However, noninvertible key matrix over is the main disadvantage of Hill Cipher, because few of the matrices have inverses over. This means that the encrypted text can't be decrypted [2]. This paper suggests a new technique in Hill Cipher algorithm to overcome its major problemnoninvertible key matrix. also our paper suggest enhancement the security of Hill Cipher against known plaintext attack because all steps in Hill Cipher depend on linear algebra calculation This is possible by using public key idea and key generating depending on various options and without linear algebra steps. Therefore, it will be difficult for the attacker to get the key. Finally, our paper will present a proper solution for the problem of sending secret key ( ) for the first time. Our idea is using a public key public ( ) that doesn't sent but generated in the encryption and decryption sides. Key words:
Cryptology
"... Cryptology has advanced tremendously since 1976; this chapter provides a brief overview of the current stateoftheart in the field. Several major themes predominate in the development. One such theme is the careful elaboration of the definition of security for a cryptosystem. A second theme has be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Cryptology has advanced tremendously since 1976; this chapter provides a brief overview of the current stateoftheart in the field. Several major themes predominate in the development. One such theme is the careful elaboration of the definition of security for a cryptosystem. A second theme has been the search for provably secure cryptosystems, based on plausible assumptions about the difficulty of specific numbertheoretic problems or on the existence of certain kinds of functions (such as oneway functions). A third theme is the invention of many novel and surprising cryptographic capabilities, such as publickey cryptography, digital signatures, secretsharing, oblivious transfers, and zeroknowledge proofs. These themes have been developed and interwoven so that today theorems of breathtaking generality and power assert the existence of cryptographic techniques capable of solving almost any imaginable cryptographic problem.
A CERTIFICATE BASED, CONTEXT AWARE ACCESS CONTROL MODEL FOR MULTI DOMAIN ENVIRONMENTS
, 2011
"... This is to certify that we have read this thesis and that in our opinion it is fully adequate, in ..."
Abstract
 Add to MetaCart
(Show Context)
This is to certify that we have read this thesis and that in our opinion it is fully adequate, in
ABSTRACT TESTING PRIMITIVE POLYNOMIALS FOR GENERALIZED FEEDBACK SHIFT REGISTER RANDOM NUMBER GENERATORS
, 2005
"... of a project submitted by ..."
(Show Context)
1569148901 1 Networking Aspects for the Security of Game Input
"... Abstract — Following the trends of our era, Games At Large IST Project introduces an innovative platform for running interactive, rich content multimedia applications over a Wireless Local Area Network. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — Following the trends of our era, Games At Large IST Project introduces an innovative platform for running interactive, rich content multimedia applications over a Wireless Local Area Network.
Key Generation for Text Encryption in Cellular Networks using Multipoint Crossover Function
"... This paper is mainly concerned with providing security for messages in cellular networks. Encryption of data in cellular networks is mandatory since it is sensitive to eaves dropping. This project focuses on encrypting the data sent between the mobile stations and base stations using a stream cipher ..."
Abstract
 Add to MetaCart
(Show Context)
This paper is mainly concerned with providing security for messages in cellular networks. Encryption of data in cellular networks is mandatory since it is sensitive to eaves dropping. This project focuses on encrypting the data sent between the mobile stations and base stations using a stream cipher method. However, the keys for encryption are generated using an evolutionary computation approach termed genetic algorithm. This genetic algorithm technique gives the best or optimal key for encryption. Before we single point cross over technique is used in generating optimal key for encryption but this paper emphasizes on genetic algorithm technique for different sizes of population and different number of iterations considering multi point crossover. The plain text which is to be encrypted along with the key are encoded using the arithmetic coding technique. Encryption is done to convert the plain text into cipher text. And the comparison with the existing system is explained in detail.
Some Facets of Complexity Theory and Cryptography: A FiveLectures Tutorial
, 2001
"... In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern publickey cryptography. Particular attention is paid to cryptographic protocols a ..."
Abstract
 Add to MetaCart
In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern publickey cryptography. Particular attention is paid to cryptographic protocols and the problem of constructing the key components of such protocols such as oneway functions. A function is oneway if it is easy to compute, but hard to invert. We discuss the notion of oneway functions both in a cryptographic and in a complexitytheoretic setting. We also consider interactive proof systems and present some interesting zeroknowledge protocols. In a zeroknowledge protocol one party can convince the other party of knowing some secret information without disclosing any bit of this information. Motivated by these protocols, we survey some complexitytheoretic results on interactive proof systems and related complexity classes.