Results 251 to 260 of about 12,868 (287)

Elliptic Curves Suitable for Pairing Based Cryptography

Designs, Codes and Cryptography, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brezing, Friederike, Weng, Annegret
openaire   +2 more sources

Tampering Attacks in Pairing-Based Cryptography

2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2014
In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic.
Johannes Blomer, Peter Gunther, Gennadij Liske   +2 more
openaire   +1 more source

Automated Proofs of Pairing-Based Cryptography

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015
Analyzing cryptographic constructions in the computational model, or simply verifying the correctness of security proofs, are complex and error-prone tasks. Although computer tools have significant potential to increase confidence in security proofs and to reduce the time for building these proofs, existing tools are either limited in scope, or can ...
Barthe, Gilles, Grégoire, Benjamin, Schmidt, Benedikt   +2 more
openaire   +1 more source

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   +1 more source

Guide to Pairing-Based Cryptography

2017
This book is devoted to efficient pairing computations and implementations, useful tools for cryptographers working on topics like identity-based cryptography and the simplification of existing protocols like signature schemes. As well as exploring the basic mathematical background of finite fields and elliptic curves, Guide to Pairing-Based ...
openaire   +1 more source

High Security Pairing-Based Cryptography Revisited

2006
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves for various practical levels of security.
Granger, Robert, Page, Daniel, Smart, Nigel P.   +2 more
openaire   +1 more source

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, Dan Page, Johann Großschädl   +2 more
openaire   +1 more source

Usability of pairing-based cryptography on smartphones

2015 38th International Conference on Telecommunications and Signal Processing (TSP), 2015
This paper deals with the usability of pairing-based cryptography on smartphones. Pairing-based cryptographic schemes can offer many advanced cryptographic primitives such as privacy protection, identity-based encryption and so on. These schemes are used to secure services and applications that may run on hand-held devices.
Lukas Malina, Jan Hajny, Vaclav Zeman
openaire   +1 more source

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

Constructing suitable parameters for pairing-based cryptography

2017
Οι ``ζευγισμοί'' παρουσιάστηκαν για πρώτη φορά από τον André Weil το 1940 και αρχικά χρησιμοποιήθηκαν ως μηχανισμός επίθεσης στο πρόβλημα διακριτού λογάριθμου σε ελλειπτικές καμπύλες. Περίπου 60 χρόνια μετά την ανακάλυψή τους, οι ζευγισμοί έχουν γίνει ένα από τα σπουδαιότερα αντικείμενα μελέτης στην κρυπτογραφία.
openaire   +2 more sources