Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
657 results
-
-
Seminar
-
Cryptography
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble
Speaker : Michele Orru - ENS
-
-
-
Seminar
-
Cryptography
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Speaker : Simon Masson - Loria, Nancy
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situation is to propose alternative curves that are immune to these attacks, without compromising the efficiency of the pairing computation too much. We follow this direction, and focus on embedding[…] -
-
-
Seminar
-
Cryptography
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
Speaker : Benjamin WESOLOWSKI - École Polytechnique Federale de Lausanne
An isogeny graph is a graph whose vertices are abelian varieties (typically elliptic curves, or Jacobians of genus 2 hyperelliptic curves) and whose edges are isogenies between them. Such a graph is "horizontal" if all the abelian varieties have the same endomorphism ring. We study the connectivity and the expander properties of these graphs. We use these results, together with a recent algorithm[…] -
-
-
Seminar
-
Cryptography
CSIDH: an efficient post-quantum commutative group action
Speaker : Chloé Martindale - Technical University of Eindhoven
CSIDH, or `commutative supersingular isogeny Diffie-Hellman' is a new isogeny-based protocol of Castryck, Lange, Martindale, Panny, and Renes.<br/> The Diffie-Hellman style scheme resulting from the group action allows for public key validation at very little cost, runs reasonably fast in practice, and has public keys of only 64 bytes at a conjectured AES-128 security level, matching NIST’s post[…] -
-
-
Seminar
-
Cryptography
Isogeny-based cryptography from superspecial genus-2 curves
Speaker : Wouter Castryck - KU Leuven
I will report on some first attempts to do isogeny-based cryptography in genus 2. More precisely, we will use isogeny graphs of superspecial principally polarized abelian surfaces over GF(p^2) for constructing variants of Charles, Goren and Lauter's hash function and of Jao and De Feo's SIDH key exchange protocol, both of which use supersingular elliptic curves over GF(p^2). This will be largely[…] -
-
-
Seminar
-
Cryptography
Zero-Knowledge Argument for Matrix-Vector Relations and Lattice-Based Group Encryption
Speaker : Fabrice Mouhartem - ENS Lyon
Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the receiver is a properly certified group member. Should the need arise, an opening authority is capable of identifying the receiver of any ciphertext. As intro- duced by Kiayias, Tsiounis and Yung […] -