Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Benoit Chevallier-Mames"'
Publikováno v:
IEEE Transactions on Computers. 53:760-768
We introduce simple methods to convert a cryptographic algorithm into an algorithm protected against simple side-channel attacks. Contrary to previously known solutions, the proposed techniques are not at the expense of the execution time. Moreover,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::615b9075ca25aa253aac9d72ab85e186
https://doi.org/10.1109/tc.2004.13
https://doi.org/10.1109/tc.2004.13
Publikováno v:
Lecture Notes in Computer Science
9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS)
9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS), Apr 2010, Passau, Germany. pp.24-35, ⟨10.1007/978-3-642-12510-2_3⟩
Lecture Notes in Computer Science ISBN: 9783642125096
CARDIS
9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS)
9th IFIP WG 8.8/11.2 International Conference on Smart Card Research and Advanced Applications (CARDIS), Apr 2010, Passau, Germany. pp.24-35, ⟨10.1007/978-3-642-12510-2_3⟩
Lecture Notes in Computer Science ISBN: 9783642125096
CARDIS
International audience; In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computation of the pairing e(A,B) to a more powerful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1883b4d9981e8c75eb01f35ad829d0a
https://hal.inria.fr/hal-01056101/file/pairing2.pdf
https://hal.inria.fr/hal-01056101/file/pairing2.pdf
Autor:
Benoit Chevallier-Mames, David Pointcheval, Julien P. Stern, Pierre-Alain Fouque, Jacques Traore
Publikováno v:
Towards Trustworthy Elections
D. Chaum, R. Rivest, M. Jakobsson, B. Schoenmakers, P. Ryan, and J. Benaloh. Towards Trustworthy Elections, 6000, springer, pp.191--199, 2010, lncs
Towards Trustworthy Elections ISBN: 9783642129797
D. Chaum, R. Rivest, M. Jakobsson, B. Schoenmakers, P. Ryan, and J. Benaloh. Towards Trustworthy Elections, 6000, springer, pp.191--199, 2010, lncs
Towards Trustworthy Elections ISBN: 9783642129797
In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. More specifically, we focus on the universal verifiability of the computation of the tally, on the unco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58b56253f2d02b4312c5accf2c9528bc
https://hal.inria.fr/inria-00539539
https://hal.inria.fr/inria-00539539
Autor:
Benoit Chevallier-Mames, Marc Joye
Publikováno v:
Provable Security ISBN: 9783642046414
ProvSec
ProvSec
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the standard model. We rely on instance-independence assumptions, which, roughly speaking, conjecture that for certain problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d620e71ef7ca08e7e7e75c51e0a997d
https://doi.org/10.1007/978-3-642-04642-1_5
https://doi.org/10.1007/978-3-642-04642-1_5
Autor:
Benoit Chevallier-Mames, Christophe Clavier, Aline Gouget, Emmanuel Bresson, Pascal Paillier, Thomas Peyrin
Publikováno v:
ProvSec 2008
ProvSec 2008, Oct 2008, Shanghai, China. pp.241-253, ⟨10.1007/978-3-540-88733-1_17⟩
Provable Security ISBN: 9783540887324
ProvSec
ProvSec 2008, Oct 2008, Shanghai, China. pp.241-253, ⟨10.1007/978-3-540-88733-1_17⟩
Provable Security ISBN: 9783540887324
ProvSec
This paper reports a thorough standard-model investigation on how attacks on hash functions impact the security of hash-and-sign signature schemes. We identify two important properties that appear to be crucial in analyzing the nature of security rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a61f17bda58c9390a6f159a9f3f844e0
https://hal.archives-ouvertes.fr/hal-02486997
https://hal.archives-ouvertes.fr/hal-02486997
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540858546
SCN
SCN
The Naccache-Stern ( ns ) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying public-keys indexed by the message bits modulo a prime p. The cleartext is recover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::634fb37c33be5e751b10acf56366383a
https://doi.org/10.1007/978-3-540-85855-3_22
https://doi.org/10.1007/978-3-540-85855-3_22
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540754954
ISC
ISC
ElGamal scheme has been the first encryption scheme based on discrete logarithm. One of its main advantage is that it is simple, natural and efficient, but also that its security is clearly understood. However, one of its -- often forgotten -- disadv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e09018d6e1fe2313073905805c97b6a9
https://doi.org/10.1007/978-3-540-75496-1_24
https://doi.org/10.1007/978-3-540-75496-1_24
Publikováno v:
CHES 2006
CHES 2006, Oct 2006, Yokohama, Japan. pp.324-338, ⟨10.1007/11894063_26⟩
Lecture Notes in Computer Science ISBN: 9783540465591
CHES
CHES 2006, Oct 2006, Yokohama, Japan. pp.324-338, ⟨10.1007/11894063_26⟩
Lecture Notes in Computer Science ISBN: 9783540465591
CHES
It is well known that a malicious adversary can try to retrieve secret information by inducing a fault during cryptographic operations. Following the work of Seifert on fault inductions during RSA signature verification, we consider in this paper the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2129f127f216c0820e8d34e025558c4
https://hal.archives-ouvertes.fr/hal-02487012
https://hal.archives-ouvertes.fr/hal-02487012
Publikováno v:
Public Key Cryptography-PKC 2006 ISBN: 9783540338512
Public Key Cryptography
Public Key Cryptography
ElGamal encryption is the most extensively used alternative to RSA. Easily adaptable to many kinds of cryptographic groups, ElGamal encryption enjoys homomorphic properties while remaining semantically secure providing that the DDH assumption holds o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caf0f4979aa5b5cf93ffba544a4c4c09
https://doi.org/10.1007/11745853_7
https://doi.org/10.1007/11745853_7
Autor:
Marc Joye, Benoit Chevallier-Mames
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540693277
CT-RSA
CT-RSA
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the Cramer-Shoup (CS) signature scheme. Remarkably, these schemes meet the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98677a80522fd25f511282b1acea9575
https://doi.org/10.1007/11967668_22
https://doi.org/10.1007/11967668_22