Results 11 to 20 of about 12,868 (287)
Sensors, 2021 5G-Vehicle-to-Everything (5G-V2X) supports high-reliability and low latency autonomous services and applications. Proposing an efficient security solution that supports multi-zone broadcast authentication and satisfies the 5G requirement is a critical ...
Shimaa A. Abdel Hakeem, HyungWon Kim
doaj +3 more sources
A Fault Attack on Pairing-Based Cryptography [PDF]
IEEE Transactions on Computers, 2006 Current fault attacks against public key cryptography focus on traditional schemes, such as RSA and ECC, and, to a lesser extent, on primitives such as XTR. However, bilinear maps, or pairings, have presented theorists with a new and increasingly popular way of constructing cryptographic protocols.
Page, DS, Vercauteren, Frederik R G
openaire +3 more sources
A Novel Efficient Pairing-Free CP-ABE Based on Elliptic Curve Cryptography for IoT
IEEE Access, 2018 Ciphertext-policy attribute-based encryption (CP-ABE) is a promising cryptographic technique that integrates data encryption with access control for ensuring data security in IoT systems.
Sheng Ding, Chen Li, Hui Li
doaj +3 more sources
Twisted Edwards Elliptic Curves for Zero-Knowledge Circuits
Mathematics, 2021 Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blockchain applications, and to current scalability problems that blockchains suffer from.
Marta Bellés-Muñoz +4 more
doaj +1 more source
CardioID: Secure ECG-BCG Agnostic Interaction-Free Device Pairing
IEEE Access, 2022 Usably secure ad-hoc device pairing fosters connectivity with hardware which is difficult to access (e.g., implanted) and grants convenience for ad-hoc short-term on-off pairing patterns (e.g. shared public domain).
Si Zuo +5 more
doaj +1 more source
Don’t Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13-310 and BW19-286, sparked interest in the field of public-key cryptography as small sizes of the prime fields.
Yu Dai, Fangguo Zhang, Chang-an Zhao
doaj +1 more source
Efficient algorithms for pairing-based cryptosystems [PDF]
, 2002 We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In particular, our techniques improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain ...
A. Joux +13 more
core +5 more sources
An efficient certificateless blind signature scheme without bilinear pairing
Anais da Academia Brasileira de Ciências, 2014 Recently, the certificateless public key cryptography (CLPKC) has been studied widely since it could solve both of the certificate management problem in traditional public key cryptography (TPKC) and the key escrow problem in the identity-based public ...
GUOFAGN DONG +3 more
doaj +1 more source
Efficient Unified Arithmetic for Hardware Cryptography [PDF]
, 2008 The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1 ...
Koc, Cetin Kaya +3 more
core +2 more sources
Self-pairings on hyperelliptic curves
Journal of Mathematical Cryptology, 2013 A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings are used in some cryptographic schemes and protocols. In this paper, we show how to compute the Tate–Lichtenbaum pairing on a curve more efficiently than
Galbraith Steven D., Zhao Chang-An
doaj +1 more source