Signature-Encryption Scheme: A Novel Solution to Mobile Computation

2012 ◽  
Vol 546-547 ◽  
pp. 1415-1420
Author(s):  
Hai Yong Bao ◽  
Man De Xie ◽  
Zhen Fu Cao ◽  
Shan Shan Hong
Keyword(s):  
Mobile Communication ◽  
High Efficiency ◽  
Discrete Logarithm ◽  
Communication Technologies ◽  
Random Oracle ◽  
Security Requirements ◽  
Encryption Scheme ◽  
Daily Lives ◽  
Storage Devices ◽  
Diffie Hellman

Mobile communication technologies have been widely utilized in daily lives, many low-computing-power and weakly-structured-storage devices have emerged, such as PDA, cell phones and smart cards, etc. How to solve the security problems in such devices has become a key problem in secure mobile communication. In this paper, we would like to propose an efficient signature-encryption scheme. The security of the signature part is not loosely related to Discrete Logarithm Problem (DLP) assumption as most of the traditional schemes but tightly related to the Decisional Diffie-Hellman Problem (DDHP) assumption in the Random Oracle Models. Different from the existing solutions, our scheme introduces a trusted agent of the receiver who can filter the “rubbish” messages beforehand. Thus, with high efficiency in computation and storage, it is particularly suitable for the above mobile devices with severely constrained resources and can satisfy the security requirements of mobile computations.

Efficient message transmission via twisted Edwards curves

2020 ◽  
Vol 70 (6) ◽  
pp. 1511-1520
Author(s):  
Bariş Bülent Kirlar
Keyword(s):  
Discrete Logarithm ◽  
Encryption Scheme ◽  
Message Transmission ◽  
Edwards Curves ◽  
Diffie Hellman ◽  
Digital Signature Algorithm ◽  
Message Recovery ◽  
Secure Message Transmission ◽  
Chosen Ciphertext Attack ◽  
Twisted Edwards Curves

AbstractIn this paper, we suggest a novel public key scheme by incorporating the twisted Edwards model of elliptic curves. The security of the proposed encryption scheme depends on the hardness of solving elliptic curve version of discrete logarithm problem and Diffie-Hellman problem. It then ensures secure message transmission by having the property of one-wayness, indistinguishability under chosen-plaintext attack (IND-CPA) and indistinguishability under chosen-ciphertext attack (IND-CCA). Moreover, we introduce a variant of Nyberg-Rueppel digital signature algorithm with message recovery using the proposed encryption scheme and give some countermeasures to resist some wellknown forgery attacks.

scholarly journals Cryptanalysis and improvement of an encryption scheme that uses elliptic curves over finite fields

2021 ◽  
Vol 49 (1) ◽  
Author(s):  
Malik Zia Ullah Bashir ◽  
◽  
Rashid Ali ◽  
Keyword(s):  
Elliptic Curves ◽  
Discrete Logarithm ◽  
Security Requirements ◽  
Encryption Scheme ◽  
Secret Key ◽  
Public Keys ◽  
Secret Keys ◽  
Curves Over Finite Fields ◽  
Original Message ◽  
Global Parameters

In this paper, we cryptanalyzed a recently proposed encryption scheme that uses elliptic curves over a finite field. The security of the proposed scheme depends upon the elliptic curve discrete logarithm problem. Two secret keys are used to increase the security strength of the scheme as compared to traditionally used schemes that are based on one secret key. In this scheme, if an adversary gets one secret key then he is unable to get the contents of the original message without the second secret key. Our analysis shows that the proposed scheme is not secure and unable to provide the basic security requirements of the encryption scheme. Due to our successful cryptanalysis, an adversary can get the contents of the original message without the knowledge of the secret keys of the receiver. To mount the attack, Mallory first gets the transmitted ciphertext and then uses public keys of the receiver and global parameters of the scheme to recover the associated plaintext message. To overcome the security flaws, we introduced an improved version of the scheme.

scholarly journals A Cryptographic Application of the M-Injectivity of 𝑀𝑛(𝑍𝑝) Over Itself

2021 ◽  
Vol 10 (4) ◽  
pp. 7-14
Author(s):  
Wannarisuk Nongbsap ◽  
◽  
Dr. Madan Mohan Singh ◽  
Keyword(s):  
Discrete Logarithm ◽  
Matrix Ring ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Encryption Scheme ◽  
Diffie Hellman ◽  
Hill Cipher ◽  
The Matrix ◽  
Elgamal Encryption

In this paper, we present a public key scheme using Discrete Logarithm problem, proposed by Diffie and Hellman (DLP)[1], particularly known as the Computational Diffie-Hellman Problem (CDH)[12]. This paper uses the Elgamal encryption scheme [6] and extends it so that more than one message can be sent. The combination of Hill Cipher[14 ] and the property of the matrix ring 𝑴𝒏(𝒁𝒑), of being left m-injective over itself, where 𝒑 is a very large prime, are major contributions towards the proposal of this scheme.

"Recent Patents on the Triboelectrostatic Separation of Fly Ash"

2019 ◽  
Vol 13 ◽  
Author(s):  
Haisheng Li ◽  
Wenping Wang ◽  
Yinghua Chen ◽  
Xinxi Zhang ◽  
Chaoyong Li
Keyword(s):  
Fly Ash ◽  
Power Plants ◽  
High Efficiency ◽  
Separation Efficiency ◽  
High Reliability ◽  
Operating Conditions ◽  
Security Requirements ◽  
Unburned Carbon ◽  
Efficient Operation ◽  
Triboelectrostatic Separation

Background: The fly ash produced by coal-fired power plants is an industrial waste. The environmental pollution problems caused by fly ash have been widely of public environmental concern. As a waste of recoverable resources, it can be used in the field of building materials, agricultural fertilizers, environmental materials, new materials, etc. Unburned carbon content in fly ash has an influence on the performance of resource reuse products. Therefore, it is the key to remove unburned carbon from fly ash. As a physical method, triboelectrostatic separation technology has been widely used because of obvious advantages, such as high-efficiency, simple process, high reliability, without water resources consumption and secondary pollution. Objective: The related patents of fly ash triboelectrostatic separation had been reviewed. The structural characteristics and working principle of these patents are analyzed in detail. The results can provide some meaningful references for the improvement of separation efficiency and optimal design. Methods: Based on the comparative analysis for the latest patents related to fly ash triboelectrostatic separation, the future development is presented. Results: The patents focused on the charging efficiency and separation efficiency. Studies show that remarkable improvements have been achieved for the fly ash triboelectrostatic separation. Some patents have been used in industrial production. Conclusion: According to the current technology status, the researches related to process optimization and anti-interference ability will be beneficial to overcome the influence of operating conditions and complex environment, and meet system security requirements. The intelligent control can not only ensure the process continuity and stability, but also realize the efficient operation and management automatically. Meanwhile, the researchers should pay more attention to the resource utilization of fly ash processed by triboelectrostatic separation.

Shifting Dynamics of Contention in the Digital Age

2020 ◽  
Author(s):  
Jun Liu
Keyword(s):  
Information And Communication Technologies ◽  
Mobile Communication ◽  
Communication Technologies ◽  
Digital Age ◽  
Chinese Society ◽  
Internet Users ◽  
Communicative Practice ◽  
Political Contention ◽  
Information And Communication ◽  
Everyday Resistance

Over the past decades, waves of political contention involving the use of information and communication technologies have swept across the globe. The phenomenon stimulates the scholarship on digital communication technologies and contentious collective action to thrive as an exciting, relevant, but highly fragmentary and contested field with disciplinary boundaries. To advance the interdisciplinary understanding, Shifting Dynamics of Contention in the Digital Age outlines a communication-centered framework that articulates the intricate relationship between technology, communication, and contention. It further prods us to engage more critically with existing theories from communication, sociology, and political science on digital technologies and political movements. Given the theoretical endeavor, Shifting Dynamics of Contention in the Digital Age systematically explores, for the first time, the influence of mobile technology on political contention in China, the country with the world’s largest number of mobile and Internet users. Using first-hand in-depth interview and fieldwork data, it tracks the strategic choice of mobile phones as repertoires of contention, illustrates the effective mobilization of mobile communication on the basis of its strong and reciprocal social ties, and identifies the communicative practice of forwarding officially alleged “rumors” as a form of everyday resistance. Through this ground-breaking study, Shifting Dynamics of Contention in the Digital Age presents a nuanced portrayal of an emerging dynamics of contention—both its strengths and limitations—through the embedding of mobile communication into Chinese society and politics.

scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

scholarly journals BESTIE: Broadcast Encryption Scheme for Tiny IoT Equipment

Electronics ◽  
2020 ◽  
Vol 9 (9) ◽  
pp. 1389
Author(s):  
Jiwon Lee ◽  
Jihye Kim ◽  
Hyunok Oh
Keyword(s):  
The Other ◽  
Public Key ◽  
Broadcast Encryption ◽  
Encryption Scheme ◽  
The Public ◽  
Private Key ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Encryption Decryption ◽  
Subset Difference

In public key broadcast encryption, anyone can securely transmit a message to a group of receivers such that privileged users can decrypt it. The three important parameters of the broadcast encryption scheme are the length of the ciphertext, the size of private/public key, and the performance of encryption/decryption. It is suggested to decrease them as much as possible; however, it turns out that decreasing one increases the other in most schemes. This paper proposes a new broadcast encryption scheme for tiny Internet of Things (IoT) equipment (BESTIE), minimizing the private key size in each user. In the proposed scheme, the private key size is O(logn), the public key size is O(logn), the encryption time per subset is O(logn), the decryption time is O(logn), and the ciphertext text size is O(r), where n denotes the maximum number of users, and r indicates the number of revoked users. The proposed scheme is the first subset difference-based broadcast encryption scheme to reduce the private key size O(logn) without sacrificing the other parameters. We prove that our proposed scheme is secure under q-Simplified Multi-Exponent Bilinear Diffie-Hellman (q-SMEBDH) in the standard model.

scholarly journals A Contemporary View on Online and Web Tools for Students with Sensory & Learning Disabilities

2019 ◽  
Vol 15 (12) ◽  
pp. 97
Author(s):  
Vasiliki Bravou ◽  
Athanasios S. Drigas
Keyword(s):  
Special Needs ◽  
Information And Communication Technologies ◽  
Communication Technologies ◽  
Disabled People ◽  
Students With Special Needs ◽  
Daily Lives ◽  
Web Tools ◽  
Special Needs Education ◽  
Sensory Learning ◽  
Information And Communication

<p class="0abstract">In the last 30 years, the use of information and communication technologies, the evolution of hardware and software for special needs people, as well as the spreading of the World Wide Web, is assisting people with disabilities in overcoming obstacles, accessing information, learning and participating in activities, which otherwise were not able to carry out. Special needs education is the process adjusting the education of learners with disabilities according to their unique requirements. Evolvement of technology has made computers and mobile devices capable of complementing usual teaching processes for students with special needs. In this report we present a summary of some representative online applications for assisting disabled people in the learning process and their daily lives.</p>

Sign in / Sign up

Export Citation Format

Share Document