ABSTRACT
A cryptographic system is said to use one-time key encryption if every plaintext is encrypted by means of an entirely new key, and that key is never used again for encryption. This chapter shows that the information to be encrypted resides on the edges of the graph; the algorithms can be modified to handle the cases where the information resides in the vertices, instead of the edges, or in both the vertices and the edges. It describes the processes of encrypting and decrypting a graph. The chapter argues that typical database operations, such as insert, delete, and update, can be executed without forcing a complete re-encryption of the database. It discusses the case in which the encrypted graph ciphertext graph (G3) need not be transmitted, mitigating the problems associated with graph size and network traffic. The chapter explores the proposed encryption algorithm for graphs. It describes a possible implementation of the graph G3 and alternative algorithms for encrypting a graph.
