Sciweavers

257 search results - page 18 / 52
» On the Security of RSA Screening
Sort
View
CCS
1997
ACM
13 years 12 months ago
On the Importance of Securing Your Bins: The Garbage-man-in-the-middle Attack
In this paper, we address the following problem: \ Is it possible to weaken/attack a scheme when a (provably) secure cryptosystem is used? ". The answer is yes. We exploit we...
Marc Joye, Jean-Jacques Quisquater
WISTP
2009
Springer
14 years 2 months ago
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
Abstract. In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing [1]. The performance is relati...
Hendrik Tews, Bart Jacobs
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
WWW
2004
ACM
14 years 8 months ago
Integrating elliptic curve cryptography into the web's security infrastructure
RSA is the most popular public-key cryptosystem on the Web today but long-term trends such as the proliferation of smaller, simpler devices and increasing security needs will make...
Vipul Gupta, Douglas Stebila, Sheueling Chang Shan...
ASIACRYPT
2009
Springer
14 years 13 days ago
PSS Is Secure against Random Fault Attacks
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
Jean-Sébastien Coron, Avradip Mandal