搜索结果: 1-15 共查到“军事学 bilinear pairings”相关记录34条 . 查询时间(0.078 秒)
An FPGA-based programmable processor for bilinear pairings
public-key cryptography implementation applications
2018/11/2
Bilinear pairings on elliptic curves are an active research field in cryptography. First cryptographic protocols based on bilinear pairings were proposed by the year 2000 and they are promising soluti...
Cryptanalysis of Wang et al’s Certificateless Signature Scheme without Bilinear Pairings
cryptographic protocols CLS
2017/3/6
In these years, the design of certificateless signature (CLS) scheme without bilinear pairings has been thoroughly investigated owing to its effectiveness on solving the key escrow problem in identity...
Public Key Encryption Supporting Equality Test and Flexible Authorization without Bilinear Pairings
PKEET public-key cryptography
2016/3/14
In recent years, public key encryption with equality test (PKEET) has become
a hot research topic in the cryptography community due to the advancement of cloud
computing. Recently, Ma et al. propose...
New Efficient and Flexible Algorithms for Secure Outsourcing of Bilinear Pairings
secure outsourcing algorithm bilinear pairings one-malicious model
2016/2/24
Outsourcing paradigm has become a hot research topic in the cryptography
community, where computation workloads can be outsourced to cloud servers by the
resource-constrained devices, such as RFID t...
One-Pass Authenticated Key Establishment Protocol on Bilinear Pairings for Wireless Sensor Networks
Key establishment bilinear pairings Session key
2016/1/26
The article proposes one-pass authenticated key establishment protocol
in random oracles for Wireless Sensor Networks. Security of the protocol relies on
Computational Diffie-Hellman Problem on Bili...
Computationally Sound Symbolic Security Reduction Analysis of Group Key Exchange Protocol using Bilinear Pairings
Universally Composable Symbolic Analysis Computational Soundness Bilinear Pairings Group Key Exchange Protocol Forward Secrecy
2012/3/26
Canetti and Herzog have proposed a universally composable symbolic analysis (UCSA) of mutual authentication and key exchange protocols within universally composable security framework. It is fully aut...
An efficient certificateless authenticated key agreement protocol without bilinear pairings
Certificateless cryptography Authenticated key agreement
2011/7/25
Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography.
Identity-based Digital Signature Scheme Without Bilinear Pairings
public-key cryptography / Digital signature Identity-based cryptography Bilinear pairings Elliptic curve
2012/3/29
Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar ...
Identity-based Digital Signature Scheme Without Bilinear Pairings
Digital signature Identity-based cryptography Bilinear pairings Elliptic curve
2011/2/24
Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar ...
Efficient and provably-secure certificateless signature scheme without bilinear pairings
Certificateless public key cryptography Certificateless signature Bilinear pairings
2010/12/14
Many certificateless signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar multipl...
Identity-based Digital Signature Scheme Without Bilinear Pairings
Digital signature Identity-based cryptography Bilinear pairings Elliptic curve
2010/12/9
Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher than that of the scalar ...
A novel k-out-of-n Oblivious Transfer Protocols Based on Bilinear Pairings
k-out-of-n Oblivious Transfer Protocols Bilinear Pairings
2010/2/1
Low bandwidth consumption is an important issue in a busy commercial network
whereas time may not be so crucial, for example, the end-of-day financial settlement
for commercial transactions in a day...
An Efficient ID- based Directed Signature Scheme from Bilinear Pairings
Directed signature ID-based cryptography CDH problem
2009/12/29
A directed signature scheme allows a designated verifier to directly verify a
signature issued to him, and a third party to check the signature validity with the help of
the signer or the designated...
Identity-Based Directed Signature Scheme from Bilinear Pairings
Bilinear pairings Directed signature Existential unforgeability
2009/6/5
In a directed signature scheme, a verifier can exclusively verify
the signatures designated to himself, and shares with the signer the
ability to prove correctness of the signature to a third party ...
Computing the Bilinear Pairings on Elliptic Curves with Automorphisms
Weil pairing super-optimal pairing non-supersingular curves
2009/6/4
In this paper, a super-optimal pairing based on the Weil
pairing is proposed with great efficiency. It is the first approach to reduce
the Miller iteration loop when computing the variants of theWei...