Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes. - Grégory Demay; Vishwambhar Rathi; Lars K. Rasmussen (DCC, 2010)

Optimality of LDGM-LDPC compound codes for lossy compression of binary erasure source. - Grégory Demay; Vishwambhar Rathi; Lars K. Rasmussen (ISITA, 2010)

Common randomness amplification: A constructive view. - Grégory Demay; Ueli Maurer (ITW, 2012)

Resource-Restricted Indifferentiability. - Grégory Demay; Peter Gazi; Martin Hirt; Ueli Maurer (IACR Cryptol. ePrint Arch., 2012)

Unfair coin tossing. - Grégory Demay; Ueli Maurer (ISIT, 2013)

Optimality of Non-Adaptive Strategies: The Case of Parallel Games. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (IACR Cryptol. ePrint Arch., 2014)

Query-Complexity Amplification for Random Oracles. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (IACR Cryptol. ePrint Arch., 2015)

Per-session security: Password-based cryptography revisited. - Grégory Demay; Peter Gazi; Ueli Maurer; Björn Tackmann (J. Comput. Secur., 2019)