Results 11 to 20 of about 2,138,593 (302)
Efficient algorithms for secure outsourcing of bilinear pairings [PDF]
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaofeng Chen +2 more
exaly +10 more sources
A New Short Signature Scheme with Random Oracle from Bilinear Pairings
Journal of Telecommunications and Information Technology, 2023 In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function.
Sedat Akleylek +3 more
doaj +2 more sources
Fast Software Implementations of Bilinear Pairings [PDF]
IEEE Transactions on Dependable and Secure Computing, 2017 Advancement in pairing-based protocols has had a major impact on the applicability of cryptography to the solution of more complex real-world problems. However, the computation of pairings in software still needs to be optimized for different platforms including emerging embedded systems and high-performance PCs.
Reza Azarderakhsh +6 more
semanticscholar +6 more sources
A Multi-User Public Key Encryption with Multi-Keyword Search out of Bilinear Pairings [PDF]
Sensors, 2020 Internet of Things (IoT) and cloud computing are adopted widely in daily life and industrial production. Sensors of IoT equipment gather personal, sensitive and important data, which is stored in a cloud server.
Shuo Zhang +4 more
doaj +2 more sources
New algorithms for verifiable outsourcing of bilinear pairings [PDF]
SCIENTIA SINICA Informationis, 2016 创新点 双线性对运算是密码学中最昂贵的运算之一, 已有的对运算外包计算方案效率很低或可验证概率不高。 基于两个不可信的服务器, 我们提出了新的双线性对运算外包方案。 用户不需要执行任何复杂度高的运算, 如标量乘、 模乘运算等。 如果服务器返回错误的计算结果, 用户能以概率 1 检测到, 即外包结果能完全验证。 与已有方案相比, 所提方案能同时提高双线性对运算的计算效率和可验证概率。
Yanli Ren +4 more
semanticscholar +2 more sources
Transactions on Cryptographic Hardware and Embedded Systems, 2023 We propose a novel approach that generalizes interleaved modular multiplication algorithms for the computation of sums of products over large prime fields. This operation has widespread use and is at the core of many cryptographic applications.
Patrick Longa
doaj +2 more sources
Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings
IEEE Access, 2018 Certificateless multi-receiver encryption/signcryption (CLME/CLMS) has become a research hotspot in the field of information security. Almost all of the existing CLME/CLMS schemes are constructed based on the bilinear pairing computation, a time ...
Liaojun Pang +3 more
doaj +2 more sources
A Provably-Secure Outsourced Revocable Certificateless Signature Scheme Without Bilinear Pairings
IEEE Access, 2018 Certificateless public key cryptosystem (CLPKC) is a desirable cryptographic system because it refrains from both certificate management and key escrow. In CLPKC, how to revoke a misbehaving or compromised user is an important issue.
Hongzhen Du, QiaoYan Wen, Shanshan Zhang
doaj +2 more sources
A Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings
Journal of Applied Mathematics, 2014 As people in modern societies are busier than any human era and computer network has profound impact on how people work and live through fast and convenient information exchange, people need more help from each other to accomplish more work via network ...
Nai-Wei Lo, Jia-Lun Tsai
doaj +2 more sources
Limited Verifier Signature from Bilinear Pairings [PDF]
Lecture Notes in Computer Science, 2004 Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a limited verifier, who will try to preserve the privacy of the signer if the signer follows some specified rules. Also, the limited verifier can provide a proof to convince a
Fangguo Zhang, Kwangjo Kim
exaly +3 more sources