搜索结果: 1-15 共查到“密码学 pairings”相关记录122条 . 查询时间(0.086 秒)
Optimal TNFS-secure pairings on elliptic curves with composite embedding degree
Optimal ate pairing twists of elliptic curves jacobian coordinates
font style='font-size:12px;'>
2019/5/27
In this paper we present a comprehensive comparison between pairing-friendly elliptic curves, considering different curve forms and twists where possible. We define a measure of the efficiency of a pa...
A taxonomy of pairings, their security, their complexity
Discrete Logarithm Problem Number Field Sieve Elliptic Curves
font style='font-size:12px;'>
2019/5/14
A recent NFS attack against pairings made it necessary to increase the key sizes of the most popular families of pairings : BN, BLS12, KSS16, KSS18 and BLS24. The attack applies to other families of p...
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Verifiable Delay Function Isogenies Pairings
font style='font-size:12px;'>
2019/2/25
We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography. We discuss both the advantages and some drawbacks of our constructions, we study their securi...
Efficient Group Signature Scheme without Pairings
group signature EDL signature pairings
font style='font-size:12px;'>
2018/11/13
Group signature is a useful cryptographic primitive, which makes every group member sign messages on behalf of a group they belong to. Namely group signature allows that group member anonymously signs...
Optimal TNFS-secure pairings on elliptic curves with even embedding degree
TNFS-secure optimal pairing twisted Ate pairing
font style='font-size:12px;'>
2018/11/6
In this paper we give a comprehensive comparison between pairing-friendly elliptic curves in Jacobi Quartic and Edwards form with quadratic, quartic, and sextic twists. Our comparison looks at the bes...
An FPGA-based programmable processor for bilinear pairings
public-key cryptography implementation applications
font style='font-size:12px;'>
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...
Cryptographic Pairings
pairings elliptic curves
font style='font-size:12px;'>
2017/11/21
This article appeared as Chapter 9 of the book "Topics in Computational Number Theory inspired by Peter L. Montgomery", edited by Joppe W. Bos and Arjen K. Lenstra and published by Cambridge Universit...
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings
Functional Encryption multi-input inner-product
font style='font-size:12px;'>
2017/10/9
We present new constructions of multi-input functional encryption (MIFE) schemes for the inner-product functionality that improve the state of the art solution of Abdalla et al. (Eurocrypt 2017) in tw...
Lightweight Symmetric-Key Hidden Vector Encryption without Pairings
Hidden Vector Encryption Symmetric-Key Simulation-Security
font style='font-size:12px;'>
2017/8/28
Hidden vector encryption (HVE), introduced by Boneh and Waters in TCC'07, is an expressive sub-class of predicate encryption, that allows conjunctive, subset, range and comparison queries over encrypt...
Updating key size estimations for pairings
public-key cryptography NFS
font style='font-size:12px;'>
2017/4/19
Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings. It allows us to propose new pairing-frien...
Cryptanalysis of Wang et al’s Certificateless Signature Scheme without Bilinear Pairings
cryptographic protocols CLS
font style='font-size:12px;'>
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...
Adequate Elliptic Curve for Computing the Product of n Pairings
BN curves KSS16 curves BLS curves
font style='font-size:12px;'>
2016/5/18
Many pairing-based protocols require the computation of the product and/or of a quotient of n pairings where n > 1 is a natural integer. Zhang et al.[1] recently showed that the Kachisa-Schafer and Sc...
Multi-Input Inner-Product Functional Encryption from Pairings
Multi-Input Functional Encryption Inner product
font style='font-size:12px;'>
2016/5/3
We present a multi-input functional encryption scheme (MIFE) for the inner product functionality based on the k-Linear assumption in prime-order bilinear groups. Our construction works for any polynom...
Public Key Encryption Supporting Equality Test and Flexible Authorization without Bilinear Pairings
PKEET public-key cryptography
font style='font-size:12px;'>
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...
Still Wrong Use of Pairings in Cryptography
Pairing-Based Protocols Bilinear Maps Security
font style='font-size:12px;'>
2016/3/1
Several pairing-based cryptographic protocols are recently
proposed with a wide variety of new novel applications including the ones
in emerging technologies like cloud computing, internet of things...