Results 121 to 130 of about 2,297 (264)
Pairing-Based Cryptography in Theory and Practice
In this thesis we review bilinear maps and their usage in modern cryptography, i.e. the theoretical framework of pairing-based cryptography including the underlying mathematical hardness assumptions.
Salin, Hannes
core
Covariance Structure Modeling of Engineering Demand Parameters in Cloud‐Based Seismic Analysis
ABSTRACT Probabilistic seismic demand modeling aims to estimate structural demand as a function of ground motion intensity—a critical stage in seismic risk assessment. Although many models exist to describe the structural demand, few consider the covariance among engineering demand parameters, potentially overlooking a key factor in improving the ...
Archie Rudman +3 more
wiley +1 more source
Cryptography in the Cloud Computing: the Current State and Logical Tasks
The current state of the cloud computing (CC) information security is analysed and logical problems of storage and data transmission security at CC are allocated.
Sergey Nikolaevich Kyazhin +1 more
doaj
Computing pairings on elliptic curves with embedding degree two via biextensions
Bilinear pairings have emerged as a fundamental tool in public-key cryptography, enabling advanced protocols such as identity-based encryption, short signatures, and zero-knowledge proofs.
Zheng Yuhao, Lin Jianming, Zhao Chang-An
doaj +1 more source
Multiplication and Squaring on Pairing-Friendly Fields [PDF]
Pairing-friendly fields are finite fields that are suitable for the implementation of cryptographic bilinear pairings. In this paper we review multiplication and squaring methods for pairing-friendly fields $\fpk$ with $k \in \{2,3,4,6\}$. For composite $
Colm Ó~hÉigeartaigh +3 more
core
ABSTRACT Background and Aims Little information is available on tooth displacement and periodontal ligament (PDL) stress distribution caused by computer assisted design‐computer assisted manufacturing (CAD/CAM) retainers. Therefore, the purpose of this study was to compare CAD/CAM and multistrand retainers in terms of PDL stresses, risk of root ...
Hanie Daryanavard +6 more
wiley +1 more source
Efficient self-pairing on ordinary elliptic curves
A self-pairing e(P, P) is a special bilinear pairing where both points are equal. Self-pairings are used in some cryptographic schemes and protocols, such as ZSS shorter signatures and so on.
Wu, Hongfeng +3 more
core +1 more source
ABSTRACT Nonlinear differential equations play a fundamental role in modeling complex physical phenomena across solid‐state physics, hydrodynamics, plasma physics, nonlinear optics, and biological systems. This study focuses on the Shynaray II‐A equation, a relatively less‐explored parametric nonlinear partial differential equation that describes ...
Aamir Farooq +4 more
wiley +1 more source
Efficient identification protocol provably secure in standard model
Based on the hardness assumption of the collusion attack algorithm with k traitors (K-CAA) in a gap Diffie-Hellman (GDH) group, a new and efficient identification protocol is proposed.
LI Yan-ping1, WANG Yu-min1
doaj +2 more sources
High efficient key-insulated attribute based encryption scheme without bilinear pairing operations. [PDF]
Hong H, Sun Z.
europepmc +1 more source

