搜索结果: 1-15 共查到“军队指挥学 Pairing”相关记录211条 . 查询时间(0.127 秒)
Breaking the Bluetooth Pairing – The Fixed Coordinate Invalid Curve Attack
Bluetooth elliptic curve cryptosystem Diffie-Hellman
font style='font-size:12px;'>
2019/9/19
Bluetooth is a widely deployed standard for wireless communications between mobile devices. It uses authenticated Elliptic Curve Diffie-Hellman for its key exchange. In this paper we show that the aut...
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
NFS optimal ate pairing computation
font style='font-size:12px;'>
2019/4/28
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situ...
Miller Inversion is Easy for the Reduced Tate Pairing on Trace Zero Supersingular Curves
elliptic curve cryptosystem pairing inversion Tate pairing
font style='font-size:12px;'>
2019/4/16
We present a simple algorithm for Miller inversion for the reduced Tate pairing on supersingular elliptic curve of trace zero defined over the finite fields with q elements. Our algorithm runs with O(...
On the efficiency of pairing-based proofs under the d-PKE
zk-SNARKs Knowledge Assumptions
font style='font-size:12px;'>
2019/2/25
We investigate the minimal number of group elements and prover running time in a zk-SNARK when using only a symmetric ``linear'' knowledge assumption, like the dd-Power Knowledge of Exponent assumptio...
Pairing Implementation Revisited
Pairing-based Cryptography Implementation
font style='font-size:12px;'>
2019/1/29
Pairing-based cryptography is now a mature science. However implementation of a pairing-based protocol can be challenging, as the efficient computation of a pairing is difficult, and the existing lite...
A Provably-Secure Unidirectional Proxy Re-Encryption Scheme Without Pairing in the Random Oracle Model
Proxy Re-Encryption Random Oracle Model Chosen Ciphertext Security
font style='font-size:12px;'>
2018/11/29
Proxy re-encryption (PRE) enables delegation of decryption rights by entrusting a proxy server with special information, that allows it to transform a ciphertext under one public key into a ciphertext...
A fully distributed revocable ciphertext-policy hierarchical attribute-based encryption without pairing
Cloud computing Hierarchical attribute-based encryption Access control
font style='font-size:12px;'>
2018/11/20
Several appealing features of cloud computing such as cost-effectiveness and user-friendliness have made many users and enterprises interested to outsource their sensitive data for sharing via cloud. ...
TNFS Resistant Families of Pairing-Friendly Elliptic Curves
Pairings elliptic curves pairing-friendly parameters
font style='font-size:12px;'>
2018/11/2
Recently there has been a significant progress on the tower number field sieve (TNFS) method, reducing the complexity of the discrete logarithm problem (DLP) in finite field extensions of composite de...
Pairing-Friendly Twisted Hessian Curves
twisted Hessian curves pairing-friendly curves ate pairing
font style='font-size:12px;'>
2018/11/2
This paper presents efficient formulas to compute Miller doubling and Miller addition utilizing degree-3 twists on curves with j-invariant 0 written in Hessian form. We give the formulas for both odd...
Towards Static Assumption Based Cryptosystem in Pairing Setting: Further Applications of DéjàQ and Dual-Form Signature
Bilinear target assumption q-type assumption DejaQ technique and Dual form signature technique
font style='font-size:12px;'>
2018/8/16
A large number of parameterized complexity assumptions have been introduced in the bilinear pairing setting to design novel cryptosystems and an important question is whether such ``qq-type" assumptio...
Reducing Complexity of Pairing Comparisons using Polynomial Evaluation
elliptic curve cryptosystem implementation polynomials bilinear maps
font style='font-size:12px;'>
2018/6/5
We propose a new method for reducing complexity of the pairing comparisons based on polynomials. Thought the construction introduces uncertainty into (usually deterministic) checks, it is easily quant...
A New Family of Pairing-Friendly elliptic curves
Pairing-Friendly elliptic curves large characteristic
font style='font-size:12px;'>
2018/3/5
There have been recent advances in solving the finite extension field discrete logarithm problem as it arises in the context of pairing-friendly elliptic curves. This has lead to the abandonment of ap...
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction
Verifiable and secure delegation bilinear maps cryptographic protocols
font style='font-size:12px;'>
2017/12/6
We address the problem of secure and verifiable delegation of general pairing computation. We first analyze some recently proposed pairing delegation schemes and present several attacks on their secur...
Efficient Optimal Ate Pairing at 128-bit Security Level
KSS-16 curve Optimal-Ate pairing sparse multiplication
font style='font-size:12px;'>
2017/12/6
Following the emergence of Kim and Barbulescu's new number field sieve (exTNFS) algorithm at CRYPTO'16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptograp...
An Efficient Pairing-Based Shuffle Argument
Common reference string generic group model mix-net
font style='font-size:12px;'>
2017/9/18
We prove the knowledge-soundness of the first two subarguments in the generic bilinear group model, and the culpable soundness of the third subargument under a KerMDH assumption. This proves the sound...