Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Jean Monnerat"'
Autor:
Jean Monnerat, Serge Vaudenay
Publikováno v:
Journal of Cryptology. 24:545-587
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully scalable size depending on the security level. To this end, we develop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a77adf807279dd8a0d59e986f44507f
https://doi.org/10.1007/s00145-010-9070-1
https://doi.org/10.1007/s00145-010-9070-1
Publikováno v:
Information Processing Letters. 93:225-230
In 1999, Smart has shown how to solve in linear time ECDLP for elliptic curves of trace 1 defined over a prime finite field Fp, the so-called anomalous elliptic curves. In this article, we show how to construct such cryptographically weak curves for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd469fe88c90295bb2f503b10b8b1437
https://doi.org/10.1016/j.ipl.2004.11.008
https://doi.org/10.1016/j.ipl.2004.11.008
Publikováno v:
Topics in cryptology-CT-RSA 2008
Topics in cryptology-CT-RSA 2008, 2008, San Francisco, United States. pp.71-87, ⟨10.1007/978-3-540-79263-5_5⟩
Topics in Cryptology – CT-RSA 2008 ISBN: 9783540792628
CT-RSA
Web of Science
Topics in cryptology-CT-RSA 2008, 2008, San Francisco, United States. pp.71-87, ⟨10.1007/978-3-540-79263-5_5⟩
Topics in Cryptology – CT-RSA 2008 ISBN: 9783540792628
CT-RSA
Web of Science
International audience; In 2001, Bellare, Namprempre, Pointcheval and Semanko introduced the notion of "one-more" computational problems. Since their introduction, these problems have found numerous applications in cryptography. For instance, Bellare
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f025bf105f661e28d6f3c540509b64c2
https://hal.inria.fr/inria-00357754/document
https://hal.inria.fr/inria-00357754/document
Autor:
Serge Vaudenay, Jean Monnerat
Publikováno v:
Progress in Cryptology-VIETCRYPT 2006 ISBN: 9783540687993
VIETCRYPT
VIETCRYPT
Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f72c6f021efdd2c171851412bb337de
https://doi.org/10.1007/11958239_2
https://doi.org/10.1007/11958239_2
Autor:
Jean Monnerat, Serge Vaudenay
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540290018
ISC
ISC
This article revisits the original designated confirmer signature scheme of Chaum. Following the same spirit we naturally extend the Chaum's construction in a more general setting and analyze its security in a formal way. We prove its security in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdf16c9b98971636c8fc013968c2b63e
https://doi.org/10.1007/11556992_12
https://doi.org/10.1007/11556992_12
Autor:
Jean Monnerat, Serge Vaudenay
Publikováno v:
Information and Communications Security ISBN: 9783540235637
ICICS
ICICS
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and big-BES that are some extensions of the AES and BES respectively in the spirit of Hensel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2256d2053073d7756ed76d55ddad7188
https://doi.org/10.1007/978-3-540-30191-2_32
https://doi.org/10.1007/978-3-540-30191-2_32
TO CRYPTOGRAPHY EXERCISE BOOK Thomas Baignkres EPFL, Switzerland Pascal Junod EPFL, Switzerland Yi Lu EPFL, Switzerland Jean Monnerat EPFL, Switzerland Serge Vaudenay EPFL, Switzerland Springer - Thomas Baignbres Pascal Junod EPFL - I&C - LASEC Lausa
Autor:
Jean Monnerat, Serge Vaudenay
Publikováno v:
Advances in Cryptology-ASIACRYPT 2004 ISBN: 9783540239758
ASIACRYPT
ASIACRYPT
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b534c346467d4dc8a353308a2dc1bf74
https://infoscience.epfl.ch/record/99428
https://infoscience.epfl.ch/record/99428
Publikováno v:
Progress in Cryptology – Mycrypt 2005 ISBN: 9783540289388
Mycrypt
Mycrypt
This article presents optimization results on the MOVA undeniable signature scheme presented last year by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at Asiacrypt ’04 which is based on a secret group homomorphism. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::959d2e470de35f8484658edfb6a44f3a
https://infoscience.epfl.ch/record/99487
https://infoscience.epfl.ch/record/99487
Publikováno v:
Applied Cryptography and Network Security ISBN: 9783642019562
ACNS
ACNS
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicious verifier to transfer the proof to anyone else. It is for instance t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0836acc87242bbaece52c81199ffbff9
https://infoscience.epfl.ch/record/138720
https://infoscience.epfl.ch/record/138720