Results 21 to 30 of about 19,309 (293)
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
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
Practical identity-based key agreement for secure communication in sensor networks [PDF]
, 2009 Despite much research effort key distribution in Wireless Sensor Networks (WSNs) still remains an open problem. In this paper we address this issue by proposing a simple identity- based key agreement scheme. Our protocol uses Identity-Based Cryptography (
Martin Collier +3 more
core +1 more source
Low-energy symmetric key distribution in wireless sensor networks [PDF]
, 2011 In this work a scheme for key distribution and network access in a Wireless Sensor Network (WSN) that utilises Identity- Based Cryptography (IBC) is presented.
N E O'Connor +4 more
core +1 more source
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
Trace zero varieties in cryptography : optimal representation and index calculus [PDF]
, 2014 The trace zero variety associated to an elliptic or hyperelliptic curve is an abelian variety defined over a finite field F_q. Its F_q-rational points yield a finite group, the trace zero subgroup of the degree zero Picard group of the original curve ...
Massierer, Maike
core +1 more source
Simplified pairing computation and security implications
Journal of Mathematical Cryptology, 2007 Recent progress on pairing implementation has made certain pairings extremely simple and fast to compute. Hence, it is natural to examine if there are consequences for the security of pairing-based cryptography.
Galbraith Steven D. +2 more
doaj +1 more source
A STUDY OF BILINEAR MAPS IN WIRELESS SENSOR NETWORKS
ICTACT Journal on Communication Technology, 2017 In the past, a large part of security requirements of wireless sensor networks (WSN) were fulfilled by symmetric cryptography systems. But, today by introduction of new needs in these networks and their security development, researchers of security and ...
Reza Alimoradi +2 more
doaj +1 more source
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 +1 more source
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography [PDF]
, 2019 The value of the Tate pairing on an elliptic curve over a finite field may be viewed as an element of an algebraic torus. Using this simple observation, we transfer techniques recently developed for torus-based cryptography to pairing-based cryptography,
Stam, M., Granger, R., Page, D.
core +2 more sources