Still wrong use of pairings in cryptography (Q2335138)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Still wrong use of pairings in cryptography

scientific article; zbMATH DE number 7129934

Language	Label	Description	Also known as
default for all languages	No label defined
English	Still wrong use of pairings in cryptography	scientific article; zbMATH DE number 7129934

Statements

instance of

scholarly article

0 references

title

Still wrong use of pairings in cryptography (English)

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

13 November 2019

0 references

full work available at URL

https://arxiv.org/abs/1603.02826

0 references

zbMATH Keywords

pairing-based protocols

0 references

bilinear maps

0 references

security

0 references

efficiency

0 references

discrete logarithm problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Converting cryptographic schemes from symmetric to asymmetric bilinear groups

0 references

Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma

0 references

Financial Cryptography

0 references

Public Key Cryptography – PKC 2004

0 references

Updating key size estimations for pairings

0 references

Subgroup security in pairing-based cryptography

0 references

Advances in Elliptic Curve Cryptography

0 references

Hierarchical Identity Based Encryption with Constant Size Ciphertext

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Q4783728

0 references

Q4434890

0 references

Q4474196

0 references

On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited

0 references

Type 2 structure-preserving signature schemes revisited

0 references

On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One

0 references

Shorter IBE and signatures via asymmetric pairings

0 references

A new approach to the discrete logarithm problem with auxiliary inputs

0 references

A group action on \({\mathbb Z}_p^{\times}\) and the generalized DLP with auxiliary inputs

0 references

Handbook of Elliptic and Hyperelliptic Curve Cryptography

0 references

Boneh et al.'s \(k\)-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption

0 references

Public key encryption with keyword search secure against keyword guessing attacks without random oracle

0 references

A taxonomy of pairing-friendly elliptic curves

0 references

A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves

0 references

Recent progress on the elliptic curve discrete logarithm problem

0 references

Aspects of Pairing Inversion

0 references

Pairings for cryptographers

0 references

Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))

0 references

Pairing Lattices

0 references

On the Minimal Embedding Field

0 references

Tightly secure signatures and public-key encryption

0 references

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree

0 references

Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups

0 references

Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity

0 references

Self-updatable encryption with short public parameters and its extensions

0 references

Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption

0 references

Decentralizing attribute-based encryption

0 references

Linearly homomorphic structure-preserving signatures and their applications

0 references

TMDS: thin-model data sharing scheme supporting keyword search in cloud storage

0 references

MOV attack in various subgroups on elliptic curves

0 references

Reducing elliptic curve logarithms to logarithms in a finite field

0 references

Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

0 references

Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)

0 references

A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm

0 references

Compact Proofs of Retrievability

0 references

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

0 references

Software Implementation of an Attribute-Based Encryption Scheme

0 references

Identifiers

zbMATH Open document ID

1427.94083

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.AMC.2018.03.062

0 references

Sitelinks

Mathematics(1 entry)

mardi Still wrong use of pairings in cryptography