Results 21 to 30 of about 2,297 (264)
Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices [PDF]
, 2011 Networks are evolving toward a ubiquitous model in which heterogeneous devices are interconnected. Cryptographic algorithms are required for developing security solutions that protect network activity. However, the computational and energy limitations
Herrera-Joancomartí, Jordi +4 more
core +1 more source
Digital multi-signature scheme based on bilinear pairing
网络与信息安全学报, 2016 Based on bilinear pairing and three complicated problems,a new digital multi-signature scheme was pro-posed.In the new scheme,the advantage of fast signature in broadcasting digital multi-signature was applied to se-quential digital multi-signature.By ...
Cai-juan ZHANG, Lin YOU
doaj +3 more sources
ID-based Sever-aided Verification Proxy Re-signature Scheme [PDF]
Jisuanji gongcheng, 2017 Signature verification in the existing ID-based proxy re-signature schemes includes time-consuming bilinear pairing operations,which are not suitable for low-power devices.In order to improve the efficiency of signature verification,combined with server ...
YANG Xiaodong,LI Yanan,ZHOU Qixu,GAO Guojuan,WANG Caifen
doaj +1 more source
Efficient algorithms for secure outsourcing of bilinear pairings
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaofeng Chen 0001 +6 more
openaire +4 more sources
International Journal of Distributed Sensor Networks, 2017 Due to the real-time requirement of message in vehicle ad hoc networks, it is a challenge to design an authentication for vehicle ad hoc networks to achieve security, efficiency, and conditional privacy-preserving.
Libing Wu +4 more
doaj +1 more source
Bilinear pairings on elliptic curves [PDF]
L’Enseignement Mathématique, 2016 We give an elementary and self-contained introduction to pairings on elliptic curves over finite fields. The three different definitions of the Weil pairing that can be found in the literature are stated and proved to be equivalent using Weil reciprocity. Pairings with shorter loops, such as the ate, ate
openaire +3 more sources
Practical Short Signature Batch Verification [PDF]
, 2009 In many applications, it is desirable to work with digital signatures that are short, and yet where many messages from different signers be verified very quickly. RSA signatures satisfy the latter condition, but are generally thousands of bits in length.
Pedersen, Michael Østergaard +7 more
core +1 more source
Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability [PDF]
, 2017 It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this paper, we propose a noninteractive verifiable outsourcing algorithm of bilinear pairing based on two servers in the one ...
Xiaoni Du +3 more
core +1 more source
On pairing inversion of the self-bilinear map on unknown order groups
, 2021 A secure self-bilinear map is attractive since it can be naturally extended to a secure multi-linear map which has versatile applications in cryptography.
임선간, 이향숙
core +1 more source
Pairing-Free for Public Key Encryption With Equality Test Scheme
IEEE Access, 2021 The modular exponentiation has been proved better in terms of computational efficiency as compared to bilinear pairing. Therefore, discrete logarithm, a concept of modular exponentiation may be incorporated to present improved security schemes. With this
Huijun Zhu +3 more
doaj +1 more source