Title
A novel one‐to‐many and many‐to‐one asymmetric encryption model and its algorithms
Abstract
Traditional asymmetric encryption algorithms involve only two parties: one party is a sender (encrypter) and the other a receiver (decrypter), in which each party has two different keys: a private key and a public key. However, if applied in some multiparty-oriented environments, there may be a serious problem that each party needs to store and manage many keys, which is not only an overload but also a potential safety hazard. In this paper, we built a new secure communication model for private client-server networks, in which each party only needs to store a private key, but it can still implement two-way secure communications with two properties of "one-to-many encryption" (i.e., if the server encrypts a plaintext, all clients can decrypt the ciphertext by using their respective private keys) and "many-to-one encryption" (i.e., if each client encrypts a plaintext by using his or her private key, only the server can decrypt the ciphertext). Furthermore, by introducing the basic theories for solving linear equations and ElGamal cryptographic algorithms, we designed the corresponding encryption and decryption algorithms in detail. The analysis results show that our algorithms are secure and efficient, and there are many good potential applications in military and electronic commerce fields. Copyright (C) 2015 John Wiley & Sons, Ltd.
Year
DOI
Venue
2015
10.1002/sec.1309
SECURITY AND COMMUNICATION NETWORKS
Keywords
Field
DocType
cryptography,asymmetric encryption,one-to-many encryption,many-to-one encryption
Symmetric-key algorithm,Computer science,Computer security,Deterministic encryption,Attribute-based encryption,Computer network,Algorithm,Encryption,Probabilistic encryption,Ciphertext,On-the-fly encryption,Link encryption
Journal
Volume
Issue
ISSN
8
18
1939-0114
Citations 
PageRank 
References 
0
0.34
13
Authors
4
Name
Order
Citations
PageRank
runhua shi1259.65
Hong Zhong29018.46
jie cui3133.79
Shun Zhang422627.93