Improved RSA lossy trapdoor function and applications

IoT devices provide real-time data to a rich ecosystem of services and applications. The volume of data and the involved subscribe/notify signaling will likely become a challenge also for access and core networks. To alleviate the core of the network, other technologies like fog computing can be used. On the security side, designers of IoT low-cost devices and applications often reuse old versions of development frameworks and software components that contain vulnerabilities. Many server applications today are designed using microservice architectures where components are easier to update. Thus, IoT can benefit from deploying microservices in the fog as it offers the required flexibility for the main players of ubiquitous computing: nomadic users. In such deployments, IoT devices need the dynamic instantiation of microservices. IoT microservices require certificates so they can be accessed securely. Thus, every microservice instance may require a newly-created domain name and a certificate. The DNS-based Authentication of Named Entities (DANE) extension to Domain Name System Security Extensions (DNSSEC) allows linking a certificate to a given domain name. Thus, the combination of DNSSEC and DANE provides microservices’ clients with secure information regarding the domain name, IP address, and server certificate of a given microservice. However, IoT microservices may be short-lived since devices can move from one local fog to another, forcing DNSSEC servers to sign zones whenever new changes occur. Considering DNSSEC and DANE were designed to cope with static services, coping with IoT dynamic microservice instantiation can throttle the scalability in the fog. To overcome this limitation, this article proposes a solution that modifies the DNSSEC/DANE signature mechanism using chameleon signatures and defining a new soft delegation scheme. Chameleon signatures are signatures computed over a chameleon hash, which have a property: a secret trapdoor function can be used to compute collisions to the hash. Since the hash is maintained, the signature does not have to be computed again. In the soft delegation schema, DNS servers obtain a trapdoor that allows performing changes in a constrained zone without affecting normal DNS operation. In this way, a server can receive this soft delegation and modify the DNS zone to cope with frequent changes such as microservice dynamic instantiation. Changes in the soft delegated zone are much faster and do not require the intervention of the DNS primary servers of the zone.

Download Full-text

Paillier’s trapdoor function hides Θ(n) bits

Science China Information Sciences ◽

10.1007/s11432-011-4269-9 ◽

2011 ◽

Vol 54 (9) ◽

pp. 1827-1836 ◽

Cited By ~ 6

Author(s):

Dong Su ◽

KeWei Lü

Keyword(s):

Trapdoor Function

Download Full-text

Preimage Selective Trapdoor Function: How to Repair an Easy Problem

Mathematical Problems in Engineering ◽

10.1155/2014/475678 ◽

2014 ◽

Vol 2014 ◽

pp. 1-18

Author(s):

Baocang Wang

Keyword(s):

Public Key Cryptography ◽

Public Key ◽

Constructive Method ◽

Key Recovery ◽

Public Key Cryptosystems ◽

Cryptographic Primitive ◽

The One ◽

Trapdoor Function ◽

One Way Function ◽

Encryption Function

Public key cryptosystems are constructed by embedding a trapdoor into a one-way function. So, the one-wayness and the trapdoorness are vital to public key cryptography. In this paper, we propose a novel public key cryptographic primitive called preimage selective trapdoor function. This scenario allows to use exponentially many preimage to hide a plaintext even if the underlying function is not one-way. The compact knapsack problem is used to construct a probabilistic public key cryptosystem, the underlying encryption function of which is proven to be preimage selective trapdoor one-way functions under some linearization attack models. The constructive method can guarantee the noninjectivity of the underlying encryption function and the unique decipherability for ciphertexts simultaneously. It is heuristically argued that the security of the proposal cannot be compromised by a polynomial-time adversary even if the compact knapsack is easy to solve. We failed to provide any provable security results about the proposal; however, heuristic illustrations show that the proposal is secure against some known attacks including brute force attacks, linearization attacks, and key-recovery attacks. The proposal turns out to have acceptable key sizes and performs efficiently and hence is practical.

Download Full-text

How to sign given any trapdoor function

Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 ◽

10.1145/62212.62216 ◽

1988 ◽

Cited By ~ 17

Author(s):

Mihir Bellare ◽

Silvio Micali

Keyword(s):

Trapdoor Function

Download Full-text

Novel Framework for Maximizing Security over Wireless Network

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.e1967.039520 ◽

2020 ◽

Vol 9 (5) ◽

pp. 39-45

Keyword(s):

Wireless Network ◽

Public Key ◽

Dynamic State ◽

Public Key Encryption ◽

Secret Key ◽

Maximum Security ◽

Network Vulnerabilities ◽

Trapdoor Function ◽

Security Standards ◽

Security Concern

With the increasing adoption of application running over wireless networking system, there is also an increasing security concern in it. Review of existing security protocols in wireless networks shows that they are highly specific to adversaries and hence they cannot be applicable with the dynamic state of network vulnerabilities. Apart from this, it was also explored that public key encryption requires a drastic change in its design methodology in order to make it more resource friendly for increased network lifetime. Therefore, this manuscript presents a novel framework that develops an enhanced model of public key encryption using algebraic structure that can generate an elite secret key. The study also introduces a design of an efficient trapdoor function which renders maximum resiliency towards different forms of lethal attacks as well as adhere to maximum security standards in wireless network. The study outcome shows that proposed system out performs frequently used existing security standards in many aspects.

Download Full-text

A Secure and Privacy-Preserving Approach to Protect User Data across Cloud based Online Social Networks

Research Anthology on Artificial Intelligence Applications in Security ◽

10.4018/978-1-7998-7705-9.ch027 ◽

2021 ◽

pp. 560-585

Author(s):

Neelu khare ◽

Kumaran U.

Keyword(s):

Social Networks ◽

Online Social Networks ◽

Data Access ◽

Privacy Preserving ◽

Security And Privacy ◽

Sensitive Information ◽

Privacy Concerns ◽

Attribute Based Encryption ◽

User Data ◽

Trapdoor Function

The tremendous growth of social networking systems enables the active participation of a wide variety of users. This has led to an increased probability of security and privacy concerns. In order to solve the issue, the article defines a secure and privacy-preserving approach to protect user data across Cloud-based online social networks. The proposed approach models social networks as a directed graph, such that a user can share sensitive information with other users only if there exists a directed edge from one user to another. The connectivity between data users data is efficiently shared using an attribute-based encryption (ABE) with different data access levels. The proposed ABE technique makes use of a trapdoor function to re-encrypt the data without the use of proxy re-encryption techniques. Experimental evaluation states that the proposed approach provides comparatively better results than the existing techniques.

Download Full-text

Blind Signature Based on Discrete Logarithm Type Cryptosystem

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.204-210.1318 ◽

2011 ◽

Vol 204-210 ◽

pp. 1318-1321

Author(s):

Xuan Wu Zhou ◽

Yan Fu

Keyword(s):

Elliptic Curves ◽

Discrete Logarithm ◽

Blind Signature ◽

Discrete Logarithm Problem ◽

Public Key ◽

Security Level ◽

Signature Schemes ◽

Public Key Cryptosystems ◽

Trapdoor Function ◽

Asymmetric Cryptosystem

Discrete logarithm problem is an important trapdoor function to design asymmetric cryptosystem, and some fast public key cryptosystems have been designed based on it. In the paper, we introduced fast asymmetric cryptosystem into the designing and analyzing of blind signature, and presented improved blind signature schemes based on ECC (Elliptic Curves Cryptosystem). The trapdoor function of the blind signatures is based on ECDLP (Elliptic Curves Discrete Logarithm Problem), and the algorithms of the scheme make full use of the superiority of ECC, such as high efficiency and short key length. The improved blind signature schemes can achieve the same security level with less storing space, smaller communication band-width and less overheads regarding software and hardware application. Furthermore, the algorithms in the schemes can be generalized into other public key cryptosystems based on discrete logarithm problem without any influence to efficiency or security.

Download Full-text