Sciweavers

1562 search results - page 110 / 313
» Mathematics, Cryptology, Security
Sort
View
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
14 years 1 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
CTRSA
2004
Springer
96views Cryptology» more  CTRSA 2004»
14 years 1 months ago
Self-Randomized Exponentiation Algorithms
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
Benoît Chevallier-Mames
SCN
2004
Springer
121views Communications» more  SCN 2004»
14 years 1 months ago
ECRYPT: The Cryptographic Research Challenges for the Next Decade
Abstract. In the past thirty years, cryptology has evolved from a secret art to a modern science. Weaker algorithms and algorithms with short keys are disappearing, political contr...
Bart Preneel
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
14 years 1 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay
ASIACRYPT
2001
Springer
14 years 22 days ago
How to Achieve a McEliece-Based Digital Signature Scheme
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
Nicolas Courtois, Matthieu Finiasz, Nicolas Sendri...