Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
SPINS: security protocols for sensor networks
Wireless Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Everlasting security in the bounded storage model
IEEE Transactions on Information Theory
New directions in cryptography
IEEE Transactions on Information Theory
Secret-key agreement over unauthenticated public channels .I. Definitions and a completeness result
IEEE Transactions on Information Theory
Secret-key agreement over unauthenticated public channels-Part II: the simulatability condition
IEEE Transactions on Information Theory
Secret-key agreement over unauthenticated public channels .II. Privacy amplification
IEEE Transactions on Information Theory
An attack on the Interlock Protocol when used for authentication
IEEE Transactions on Information Theory
Executing SQL queries over encrypted character strings in the Database-As-Service model
Knowledge-Based Systems
Hi-index | 0.00 |
As knowledge based systems become more sophisticated, communications between systems or among their subsystems often conducted over public channels such as the Internet, wireless medium, etc. To secure communications over public channels, the most often used method is Diffie and Hellman's public key infrastructure approach. This method requires a trusted third party to verify identifies, which does not play well with independent knowledge based systems, especially in the case of autonomous agents. In this paper, we proposes an asymptotic secrecy model to secure communications between and within knowledge based systems over public channels. The new model assumes that adversaries are storage space bounded, but not computationally bounded. At the initial phase of the secret communication, both parties exchange a large amount of random bits so that adversaries are not able to save all of them due to the storage space limitation. Each party only saves received data. At the second phase, each party regenerates the random bits, combines them with received data, and generates an encryption key iteratively with a one-way hash function. The key is then used to encrypt the future transmissions from one party to the other. After each transmission, the key is also updated iteratively based on data received. Finally, the proposed model is applied to solve some problems in wireless sensor networks as examples to show how the model can be applied for knowledge based systems in general.