Results 251 to 260 of about 23,346,457 (282)
Some of the next articles are maybe not open access.

Pairing Based Cryptography For Distributed And Grid Computing

2006 IEEE International Conference on Communications, 2006
Over recent years, bilinear pairings have emerged as a major research topic in cryptography. In this paper, we describe some applications of bilinear pairings in cryptography for distributed and Grid computing scenarios by presenting mechanisms for trust delegation and confidentiality on a distributed network like a Grid infrastructure.
Ben Soh, Amitabh Saxena
exaly   +2 more sources

Securing pairing-based cryptography on smartcards

International Journal of Information and Computer Security, 2012
Research efforts have produced many algorithms for fast pairing computation and several efficient hardware implementations. However, side channel attacks (SCAs) are a serious threat on hardware implementations. Previous works in this area have provided some costly countermeasures against side channel attacks.
openaire   +2 more sources

Learning pairing-based cryptography by hands-on exercises

2017 IEEE 6th International Conference on Teaching, Assessment, and Learning for Engineering (TALE), 2017
Many modem cryptographic schemes, especially those with special functionalities, employ elliptic curves and pairings thereon. While the cryptographic system itself may be quite simple to specify and write down, prototyping such a system to compute examples is often a significant independent challenge connected to understanding the system itself ...
Stefan Rass, Johannes Winkler
openaire   +2 more sources

Instruction Set Extensions for Pairing-Based Cryptography

2007
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means many different variations of base field must ideally be supported on the target platform.
Tobias Vejda   +2 more
openaire   +2 more sources

A Note on Subgroup Security in Pairing-Based Cryptography

Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018
Barreto~et al.\ (LATINCRYPT~2015) proposed a security notion, called subgroup security, for elliptic curves in pairing-based cryptography. They also claimed that, in some schemes, if an elliptic curve is subgroup-secure, the membership check, called full membership check, can be replaced by a cheaper membership check, called light membership check ...
openaire   +2 more sources

Access Control Using Pairing Based Cryptography

2003
We present a new class of signature schemes based on properties of certain bilinear algebraic maps. These signatures are secure against existential forgery under a chosen message attack in the standard model (without using the random oracle model). Security is based on the computational Diffie-Hellman problem.
openaire   +1 more source

Pairing-Based Cryptography

2017
Sébastien Canard, Jacques Traoré
openaire   +1 more source

Weak Instances of Class Group Action Based Cryptography via Self-pairings

Lecture Notes in Computer Science, 2023
Wouter Castryck   +2 more
exaly  

A Brief Look at Pairings Based Cryptography

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 2007
openaire   +1 more source

Efficient Pairing-Based Cryptography on Raspberry Pi

Journal of Communications, 2018
Yuki Nanjo   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy