[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Volume 14, Issue 6November 2020
Reflects downloads up to 03 Feb 2025Bibliometrics
Skip Table Of Content Section
research-article
Efficient blacklistable anonymous credential system with reputation using a pairing‐based accumulator

As privacy‐enhancing authentications without any TTP (Trusted Third Party), blacklistable anonymous credential systems with reputation have been proposed. However, the previous systems have the efficiency problem: The authentication data size is O(L) or O(...

research-article
Pairing free identity based aggregate signcryption scheme

The idea of aggregate signcryption was first proposed by Selvi. The aggregation process reduces the communication overhead and hence, it is efficient in low‐bandwidth communication networks such as wireless sensor networks and vehicular ad‐hoc network ...

research-article
Efficient elliptic curve Diffie‐Hellman computation at the 256‐bit security level

In this study, the authors introduce new Montgomery and Edwards form elliptic curves targeted at the 256‐bit security level. To this end, they work with three primes, namely p1:=2506−45, p2:=2510−75 and p3:=2521−1. While p3 has been considered earlier in ...

research-article
More realistic analysis of mass surveillance – security in multi‐surveillant settings

The PRISM made the research of cryptography against subversion attacks flourish these years. In a subversion attack, surveillants can compromise the security of users’ systems by subverting implementations of cryptographic algorithms. While the scenario ...

research-article
Further study on constructing bent functions outside the completed Maiorana–McFarland class

In the mid‐sixties, Rothaus introduced the notion of bent function and later presented a secondary construction of bent functions (building new bent functions from already defined ones), called Rothaus’ construction. In Zhang et al. 2017 (‘Constructing ...

research-article
Post‐quantum protocol for computing set intersection cardinality with linear complexity

Nowadays, the necessity of electronic information increases rapidly. As a consequence, often, that information needs to be shared among mutually distrustful parties. In this area, private set intersection (PSI) and its variants play an important role when ...

research-article
SPCOR: a secure and privacy‐preserving protocol for mobile‐healthcare emergency to reap computing opportunities at remote and nearby

This study proposes a secure and privacy‐preserving protocol for outsourcing health data processing operations during the emergency in the mobile healthcare network. The proposed protocol provides a practical solution to utilise smartphone resources at ...

research-article
C‐NSA: a hybrid approach based on artificial immune algorithms for anomaly detection in web traffic

Security vulnerabilities in web traffic can directly lead to data leak. Preventing these data leaks to a large extent has become an important problem to solve. Besides, the accurate detection and prevention of abnormal changes in web traffic is of great ...

research-article
Economic feasibility study for stealthy socialbot network establishment

Socialbots are intelligent software that controls all behaviour of fake accounts in an online social network. Since they are armed with detection evasion techniques, it is valuable to be able to determine the effectiveness of these techniques. In this ...

research-article
P2 KASE A2 —privacy‐preserving key aggregate searchable encryption supporting authentication and access control on multi‐delegation

Delegation is a technique that allows a subject receiving a delegation (the delegatee) to act on behalf of the delegating subject (the delegator). Although the existing Key Aggregate Searchable Encryption (KASE) schemes support delegation of search rights ...

research-article
Multi‐party key generation protocol for the identity‐based signature scheme in the IEEE P1363 standard for public key cryptography

Identity‐based cryptography (IBC) is considered as a promising mechanism in the Internet of Things and ad‐hoc networks, providing lightweight authentication and powerful access control. However, it suffers from two inherent problems, i.e. key escrow and ...

research-article
Achieving secure and convenient WLAN sharing in personal

The authors analyse the security threats caused by personal wireless local area network (WLAN) sharing, propose schemes under two different conditions, and evaluate the performance of their schemes. WLAN is a widely used low‐cost wireless networking ...

research-article
Statistical watermarking approach for 3D mesh using local curvature estimation

In this study, an oblivious 3D mesh watermarking scheme is represented utilising local curvature estimation and statistical characteristics of 3D mesh to provide robustness as well as retaining the imperceptibility of the 3D model. The proposed method ...

research-article
Non‐stochastic hypothesis testing for privacy

In this study, I consider privacy against hypothesis testing adversaries within a non‐stochastic framework. He developed a theory of non‐stochastic hypothesis testing by borrowing the notion of uncertain variables from non‐stochastic information theory. I ...

research-article
Tightly‐secure two‐pass authenticated key exchange protocol using twin Diffie–Hellman problem

Tight security is an important requirement of practical cryptographic schemes. Compared with loosely‐secure schemes, tightly‐secure schemes allow shorter security parameters hence are more efficient. In CRYPTO 2018, Gjøsteen and Jager proposed a tightly‐...

research-article
GUIM‐SMD: guilty user identification model using summation matrix‐based distribution

Data sharing across multiple different entities is on‐demand to upgrade an enterprise's performance. However, some malicious entity can reveal this data to an unauthorised third party that may result in heavy loss to the enterprises in terms of finance, ...

case-study
New dynamic and verifiable multi‐secret sharing schemes based on LFSR public key cryptosystem

A verifiable multi‐secret sharing (VMSS) scheme allows distributors to share multiple secrets simultaneously and can detect fraud by both distributors and participants. After analysing the security of the VMSS schemes proposed by Dehkordi and Mashhadi in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.