Multicrypt: A Provably Secure Encryption Scheme for Multicast Communication

Prakash, A. John; Uthariaraj, V. Rhymend

doi:10.1109/netcom.2009.80

Cited by 7 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This study proposes a cryptosystem, namely, Multicrypt, which is close in algebraic structure to Harkins et al (2005) encryption scheme, extending our earlier work (Prakash and Uthariaraj, 2008;2009). The Multicrypt presented here has a modified Authentication, Encryption, Decryption algorithms such it is more efficient in terms of computational complexity and security than our earlier work.…”

Section: Ajasmentioning

confidence: 87%

Performance Evaluation of Multicrypt Encryption Mechanism

Arockiasamy

Elizabeth

Vaidyanathan

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

Multicast communication allows a single message packet to be routed to multiple nodes simultaneously. Membership in a multicast group is dynamic, allowing nodes to enter and leave the multicast session. Besides the benefits, multicast communication presents the challenge of securing the communication. In order to preserve confidentiality the general encryption mechanism used for point to point communications are used. A specific encryption mechanism rather a general one is needed to suit the multicast communication requirements wherein the life time of a secret key is very short and requires a frequent change. Moreover, the next generation wireless networks have very limited resources and need a light weight security mechanism. The proposed cipher, Multicrypt, is similar to the One Time Pad and Hill cipher based on a sub band coding scheme using the principle of Orthogonal Vectors. The proposed cipher is based on the assumption of Computational Diffie Hellman problem and insolvability of Hadamard conjecture. It is designed to have multiple keys to decrypt the message like asymmetric cryptosystem so that a (key) compromise of a member would not lead to compromise of the entire system, less computational and communicational overheads, less storage complexity and there is no need for state-full members. This study also presents an extensive security analysis and the performance analysis with RSA, a public key encryption mechanism used to establish session keys. With the help of security analysis the study proves that brute force attack does not compromise the system. Multicrypt cryptosystem has the capability of dynamically adding and revoking members. The performance of Multicrypt is relatively better in terms of key setup time, encryption time, decryption time, encryption throughput and decryption throughput than RSA in the simulated setup. The proposed cipher is also proved to be secure against IND-CPA and IND-CCA attacks

show abstract

Section: Ajasmentioning

confidence: 87%

Performance Evaluation of Multicrypt Encryption Mechanism

Arockiasamy

Elizabeth

Vaidyanathan

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In the bucketization structure, a single lookup of a node in the index information has complexity of O(|V|) , and a single lookup of a bucket in the set of buckets has a complexity of O(E B ) , where E B is the number of buckets. The encryption and decryption complexity depends on the security parameter of the underlying encryption scheme [34]. For instance, in the case of AES, the encryption and decryption complexity is O(m) for variable sized blocks, where m is the number of blocks used which itself depends on the length of the secret key [4,33].…”

Section: Definition 39mentioning

confidence: 99%

Secrecy and performance models for query processing on outsourced graph data

Suntaxi

Ghazi

Böhm

2020

Distrib Parallel Databases

View full text Add to dashboard Cite

Database outsourcing is a challenge concerning data secrecy. Even if an adversary, including the service provider, accesses the data, she should not be able to learn any information from the accessed data. In this paper, we address this problem for graph-structured data. First, we define a secrecy notion for graph-structured data based on the concepts of indistinguishability and searchable encryption. To address this problem, we propose an approach based on bucketization. Next to bucketization, it makes use of obfuscated indexes and encryption. We show that finding an optimal bucketization tailored to graph-structured data is NP-hard; therefore, we come up with a heuristic. We prove that the proposed bucketization approach fulfills our secrecy notion. In addition, we present a performance model for scale-free networks which consists of (1) a number-of-buckets model that estimates the number of buckets obtained after applying our bucketization approach and (2) a query-cost model. Finally, we demonstrate with a set of experiments the accuracy of our number-ofbuckets model and the efficiency of our approach with respect to query processing.

show abstract